Skip to main content
SpringerLink
Log in
Book cover

NASA International Conference on Quantum Computing and Quantum Communications

QCQC 1998: Quantum Computing and Quantum Communications pp 160–166Cite as

Quantum Resonance for Solving NP-complete Problems by Simulations

  • Conference paper
  • First Online:

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

Abstract

Quantum analog computing is based upon similarity between mathematical formalism of a quantum phenomenon and phenomena to be analyzed. In this paper, the mathematical formalism of quantum resonance combined with tensor product decomposability of unitary evolutions is mapped onto a class of NP-complete combinatorial problems.

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. R. Feynman, Int. J. of Theoretical Physics, Vol. 21, No. 6/7 1982.

    Google Scholar 

  2. J. Taub and H. Wozniakowski, “Breaking Intractability,„ Scientific American, August 1992, Vol. 46.

    Google Scholar 

  3. V. Cerny, Phys. Rev. A, Vol. 48, No. 1, p. 116, 1993.

    Article  Google Scholar 

  4. M. Lewenstain, Quantum Perceptions, J. Modern Optics, 1999, Vol. 41, No. 12 p 2491–8501.

    Article  Google Scholar 

  5. M. Zak, C. Williams, Quantum Neural Nets, Int. J. of Theor. Physics. No. 2, 1998.

    Google Scholar 

  6. D. R. Bates, Quantum Theory, Acad. Press, N.Y. 1961, p. 271.

    Google Scholar 

  7. Andre Stechert, Private Communications, JPL, Jan. 25, 1998

    Google Scholar 

  8. M. R. Garey and D. S. Johnson, Computers and Intractability, 1979 W. H. Freeman and Co., NY, p. 90

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ultracomputing Group, Jet Propulsion Laboratory California institute of Technology, Mail Stop 525-3660, Pasadena, CA, 91109-8099

    Michail Zak

Authors
  1. Michail Zak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Jet Propulsion Laboratory, California Institute of Technology Quantum Algorithms and Technologies Group Information and Computing Technologies Research Section, Mail Stop 126-347, Pasadena, CA, 91109-8099, USA

    Colin P. Williams

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zak, M. (1999). Quantum Resonance for Solving NP-complete Problems by Simulations. In: Williams, C.P. (eds) Quantum Computing and Quantum Communications. QCQC 1998. Lecture Notes in Computer Science, vol 1509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49208-9_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-49208-9_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65514-5

  • Online ISBN: 978-3-540-49208-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation