Simple Proof of Equivalence between Adiabatic Quantum Computation and the Circuit Model
Authors:
- 16 August 2007
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 99 (7) , 070502
Abstract
We prove the equivalence between adiabatic quantum computation and quantum computation in the circuit model. An explicit adiabatic computation procedure is given that generates a ground state from which the answer can be extracted. The amount of time needed is evaluated by computing the gap. We show that the procedure is computationally efficient.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- General error estimate for adiabatic quantum computingPhysical Review A, 2006
- Internal consistency of fault-tolerant quantum error correction in light of rigorous derivations of the quantum Markovian limitPhysical Review A, 2006
- The Complexity of the Local Hamiltonian ProblemSIAM Journal on Computing, 2006
- Solving satisfiability problems by the ground-state quantum computerPhysical Review A, 2005
- Efficiency of the ground-state quantum computerPhysical Review A, 2005
- From quantum circuits to adiabatic algorithmsPhysical Review A, 2005
- Mimicking time evolution within a quantum ground state: Ground-state quantum computation, cloning, and teleportationPhysical Review A, 2004
- Scaling considerations in ground-state quantum computationPhysical Review A, 2002
- Energy barrier to decoherencePhysical Review A, 2001
- Quantum computational networksProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1989