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.Comment: 11 pages, 1 figur
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.