New quantum algorithm for studying NP-complete problems
量子物理
2015-06-26 v1
摘要
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.
引用
@article{arxiv.quant-ph/0406216,
title = {New quantum algorithm for studying NP-complete problems},
author = {Masanori Ohya and Igor V. Volovich},
journal= {arXiv preprint arXiv:quant-ph/0406216},
year = {2015}
}
评论
11 pages, 1 figure