Skip to main content
SpringerLink
Log in
Book cover

International Conference on Unconventional Methods of Computation

UMC 2002: Unconventional Models of Computation pp 300–314Cite as

Quantum Optimization Problems

Extended Abstract

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2509))

Abstract

[Krentel] presented a framework for combinatorial NP optimization problems that search op- timal values of polynomial-size solutions computed deterministically in polynomial time. This paper applies his framework to a quantum expan- sion of such optimization problems. With the notion of an “universal” quantum function similar to a classical “complete” function, we exhibit canonical quantum optimization problems whose optimal cost functions are universal for certain classes of quantum optimization problems. We also study the complexity of quantum optimization problems in connec- tion to well-known complexity classes.

This work was in part supported by Natural Sciences and Engineering Research Council of Canada and Japan Science and Technology Corporation.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. M. Adleman, J. DeMarrais, and M. A. Huang, Quantum computability, SIAM J. Comput. 26 (1997), 1524–1540.

    Article  MATH  MathSciNet  Google Scholar 

  2. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weaknesses of quantum computing, SIAM J. Comput. 26, 1510–1523, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  3. E. Bernstein and U. Vazirani, Quantum complexity theory, SIAM J. Comput. 26, 1411–1473, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  4. H. Buhrman, J. Kadin, and T. Thierauf, Functions computable with nonadaptive queries to NP, Theory of Computing Systems, 31 (1998), 77–92.

    Article  MATH  MathSciNet  Google Scholar 

  5. Z. Chen and S. Toda, On the complexity of computing optimal solutions, International Journal of Foundations of Computer Science 2 (1991), 207–220.

    Article  MATH  MathSciNet  Google Scholar 

  6. D. Deutsch, Quantum theory, the Church-Turing principle, and the universal quantum computer, Proc. Roy. Soc. London, A, 400 (1985), 97–117.

    Article  MATH  MathSciNet  Google Scholar 

  7. S. Fenner, L. Fortnow, and S. Kurtz, Gap-definable counting classes, J. Comput. System Sci. 48 (1994), 116–148.

    Article  MATH  MathSciNet  Google Scholar 

  8. F. Green, On the power of deterministic reductions to C=P, Mathematical Systems Theory 26 (1993), 215–233.

    Article  MATH  MathSciNet  Google Scholar 

  9. A. Kitaev, “Quantum NP”, Public Talk at AQIP’99: 2nd Workshop on Algorithms in Quantum Information Processing, DePaul University, 1999.

    Google Scholar 

  10. J. Köbler, U. Schöning, and J. Torán, On counting and approximation, Acta Informatica, 26 (1989), 363–379.

    MATH  MathSciNet  Google Scholar 

  11. M. W. Krentel, The complexity of optimization problems, J. Comput. System Sci., 36 (1988), 490–509.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. W. Krentel, Generalizations of OptP to the polynomial hierarchy, Theoretical Computer Science, 97 (1992), 183–198.

    Article  MATH  MathSciNet  Google Scholar 

  13. L. Li, On the counting functions, Ph.D. thesis, Department of Computer Science, University of Chicago, 1993. Also see technical report TR 93-12.

    Google Scholar 

  14. M. Ogiwara and L. Hemachandra, A complexity theory for feasible closure properties, J. Comput. System Sci. 46 (1993), 295–325.

    Article  MATH  MathSciNet  Google Scholar 

  15. L. A. Hemaspaandra and M. Ogihara, The Complexity Theory Companion, Springer, 2002.

    Google Scholar 

  16. M. Ozawa and H. Nishimura, Local transition functions of quantum Turing machines, in Proceedings of the 4th International Conference on Quantum Communication, Complexity, and Measurement, 1999.

    Google Scholar 

  17. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover Publications, 1998.

    Google Scholar 

  18. L. Valiant, The complexity of computing the permanent, Theor. Comput. Sci. 8 (1979), 189–201.

    Article  MATH  MathSciNet  Google Scholar 

  19. J. Watrous, Succinct quantum proofs for properties of finite groups, in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 537–546, 2000.

    Google Scholar 

  20. T. Yamakami, A foundation of programming a multi-tape quantum Turing machine, in Proceedings of the 24th International Symposium on Mathematical Foundation of Computer Science, Lecture Notes in Computer Science, Vol. 1672, pp. 430–441, 1999.

    Google Scholar 

  21. T. Yamakami, Analysis of quantum functions, in Proceedings of the 19th International Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 1738, pp. 407–419, 1999.

    Chapter  Google Scholar 

  22. A. C. Yao, Quantum circuit complexity, in Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pp. 352–361, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada, K1N 6N5

    Tomoyuki Yamakami

Authors
  1. Tomoyuki Yamakami
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamakami, T. (2002). Quantum Optimization Problems. In: Unconventional Models of Computation. UMC 2002. Lecture Notes in Computer Science, vol 2509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45833-6_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-45833-6_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44311-7

  • Online ISBN: 978-3-540-45833-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation