New quantum algorithm for studying NP-complete problems

Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm which is a combination of the ordinary quantum algorithm with a chaotic dynamical system. We consider the satisfiability problem as an example of NP-complete problems and argue that the problem, in principle, can be solved in polynomial time by using our new quantum algorithm.

[1]  I. V. Volovich.  Atomic Quantum Computer , 1999 .

[2]  Edith Hemaspaandra,et al.  Almost-Everywhere Superiority for Quantum Polynomial Time , 2002, Inf. Comput..

[3]  D. Bouwmeester,et al.  The Physics of Quantum Information , 2000 .

[4]  Lance Fortnow,et al.  Complexity limitations on quantum computation , 1999, J. Comput. Syst. Sci..

[5]  R. Jozsa,et al.  Quantum Computation and Shor's Factoring Algorithm , 1996 .

[6]  P. Zoller,et al.  Quantum Chaos in an Ion Trap: The Delta-Kicked Harmonic Oscillator , 1997 .

[7]  G. Long,et al.  Quantum computing , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[9]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[10]  Ilki Kim,et al.  Quantum chaos in quantum Turing machines , 1999 .

[11]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[12]  D. Abrams,et al.  NONLINEAR QUANTUM MECHANICS IMPLIES POLYNOMIAL-TIME SOLUTION FOR NP-COMPLETE AND P PROBLEMS , 1998, quant-ph/9801041.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  R. Cleve.  An Introduction to Quantum Complexity Theory , 1999, quant-ph/9906111.

[15]  Masanori Ohya,et al.  NP Problem in Quantum Algorithm , 1998 .

[16]  Luigi Accardi,et al.  On the Ohya-Masuda Quantum SAT Algorithm , 2000, UMC.

[17]  R. Schack.  Using a quantum computer to investigate quantum chaos , 1997, quant-ph/9705016.

[18]  M. Ohya.  Complexities and Their Applications to Characterization of Chaos , 1998 .

[19]  John L. Casti,et al.  Unconventional Models of Computation , 2002, Lecture Notes in Computer Science.

[20]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[21]  Masanori Ohya,et al.  Quantum Computing, NP-complete Problems and Chaotic Dynamics , 1999, ArXiv.