%0 Journal Article %1 Farhi2000Quantum %A Farhi, Edward %A Goldstone, Jeffrey %A Gutmann, Sam %A Sipser, Michael %D 2000 %K adiabatic, quantum-information %T Quantum Computation by Adiabatic Evolution %U http://arxiv.org/abs/quant-ph/0001106 %X 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. To ensure that the system evolves to the desired final ground state, the evolution time must be big enough. The time required depends on the minimum energy difference between the two lowest states of the interpolating Hamiltonian. We are unable to estimate this gap in general. We give some special symmetric cases of the satisfiability problem where the symmetry allows us to estimate the gap and we show that, in these cases, our algorithm runs in polynomial time.

@article{Farhi2000Quantum, abstract = {{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. To ensure that the system evolves to the desired final ground state, the evolution time must be big enough. The time required depends on the minimum energy difference between the two lowest states of the interpolating Hamiltonian. We are unable to estimate this gap in general. We give some special symmetric cases of the satisfiability problem where the symmetry allows us to estimate the gap and we show that, in these cases, our algorithm runs in polynomial time.}}, added-at = {2019-02-26T15:22:34.000+0100}, archiveprefix = {arXiv}, author = {Farhi, Edward and Goldstone, Jeffrey and Gutmann, Sam and Sipser, Michael}, biburl = {https://www.bibsonomy.org/bibtex/269ea4d5aea4b61fc68bee705ce8a9fce/rspreeuw}, citeulike-article-id = {437948}, citeulike-linkout-0 = {http://arxiv.org/abs/quant-ph/0001106}, citeulike-linkout-1 = {http://arxiv.org/pdf/quant-ph/0001106}, day = 28, eprint = {quant-ph/0001106}, interhash = {375a00f475aff4168260aa3a3388536e}, intrahash = {69ea4d5aea4b61fc68bee705ce8a9fce}, keywords = {adiabatic, quantum-information}, month = jan, posted-at = {2007-04-11 14:57:39}, priority = {2}, timestamp = {2019-02-26T15:22:34.000+0100}, title = {{Quantum Computation by Adiabatic Evolution}}, url = {http://arxiv.org/abs/quant-ph/0001106}, year = 2000 }