Different adiabatic quantum optimization algorithms for the NP-complete exact cover and 3SAT problems
ChoiVicky · Quantum Information and Computation · 2011
One of the most important questions in studying quantum computation is: whether a quantum computer can solve NP-complete problems more efficiently than a classical computer? In 2000, Farhi, et al. ...