A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem.
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We tested one such algorithm by applying it to randomly generated hard instances of an NP-complete problem. For the small examples that we could simulate, the quantum adiabatic algorithm worked well, providing evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems.
Farhi
E
E
Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA. farhi@mit.edu
Goldstone
J
J
Gutmann
S
S
Lapan
J
J
Lundgren
A
A
Preda
D
D