A Stochastic Limit Approach to the SAT Problem

There exists an important problem whether there exists an algorithm to solve an NP-complete problem in polynomial time. In this paper, a new concept of quantum adaptive stochastic systems is proposed, and it is shown that it can be used to solve the problem above.

[1]  Cristian S. Calude.  Information and Randomness , 1994, Monographs in Theoretical Computer Science An EATCS Series.

[2]  Masanori Ohya,et al.  A Mathematical foundation of quantum information and quantum computer: On Quantum mutual entropy and entanglement , 1998 .

[3]  Marek Czachor.  Notes on nonlinear quantum algorithms , 1998 .

[4]  Masanori Ohya,et al.  How Can We Observe and Describe Chaos? , 2003, Open Syst. Inf. Dyn..

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

[6]  Masanori Ohya,et al.  Compound Channels, Transition Expectations, and Liftings , 1999 .

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

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

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

[10]  F. Fagnola,et al.  On the existence of stationary states for quantum dynamical semigroups , 2001 .

[11]  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.

[12]  Masanori Ohya,et al.  New quantum algorithm for studying NP-complete problems , 2003 .

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

[14]  Igor Volovich,et al.  Quantum Theory and Its Stochastic Limit , 2002 .

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

[16]  H. S. Allen.  The Quantum Theory , 1928, Nature.

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

[18]  Luigi Accardi,et al.  A Generalization of Grover's Algorithm , 2000 .

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

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

[21]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

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