Quantum resonance for solving NP-complete problems by simulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1509, Issue , 1999, Pages 160-166

  Zak, Michail ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; NASA; QUANTUM COMPUTERS;

COMBINATORIAL PROBLEM; DECOMPOSABILITY; MATHEMATICAL FORMALISM; NP COMPLETE; QUANTUM ANALOG; QUANTUM PHENOMENA; QUANTUM RESONANCES; TENSOR PRODUCTS;

QUANTUM COMMUNICATION;

EID: 84961383914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49208-9_13     Document Type: Conference Paper

References (8)

1. R. Feynman, Int. J. of Theoretical Physics, Vol. 21, No. 6/7 1982.
2. J. Taub and H. Wozniakowski, “Breaking Intractability,” Scientific American, August 1992, Vol. 46.
3. V. Cerny, Phys. Rev. A, Vol. 48, No. 1, p 116, 1993.
4. M. Lewenstain, Quantum Perceptions, J. Modern Optics, 1999, Vol. 41, No. 12 p 2491-8501.
5. M. Zak, C. Williams, Quantum Neural Nets, Int. J. of Theor. Physics. No. 2, 1998.
6. D. R. Bates, Quantum Theory, Acad. Press, N.Y. 1961, p 271.
7. Andre Stechert, Private Communications, JPL, Jan. 25, 1998
8. M. R. Garey and D. S. Johnson, Computers and Intractability, 1979 W. H. Freeman and Co., NY, p 90