New quantum algorithm for studying NP-complete problems
Masanori Ohya, Igor Vasil'evich Volovich · 2003
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. keywords: Quantum Algorithm, NP-complete problem, Chaotic Dynamics 1