Quantum Computation by Adiabatic Evolution

28 Jan 2000 Edward Farhi Jeffrey Goldstone Sam Gutmann Michael Sipser

We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment... (read more)

PDF Abstract
No code implementations yet. Submit your code now