Quantum Algorithms for Some Well-Known NP Problems
Guo Hao, Long Gui-Lu, Li Feng · Communications in Theoretical Physics · 2002
It is known that quantum computer is more powerful than classical computer. In this paper we present quantum algorithms for some famous NP problems in graph theory and combination theory, these quantum algorithms are at least quadratically faster than the classical ones.