Quantum Speedup by Quantum Annealing
Abstract
We study the glued-trees problem from A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. Spielman, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (ACM, San Diego, CA, 2003), p. 59. in the adiabatic model of quantum computing and provide an annealing schedule to solve an oracular problem exponentially faster than classically possible. The Hamiltonians involved in the quantum annealing do not suffer from the so-called sign problem. Unlike the typical scenario, our schedule is efficient even though the minimum energy gap of the Hamiltonians is exponentially small in the problem size. We discuss generalizations based on initial-state randomization to avoid some slowdowns in adiabatic quantum computing due to small gaps.
- Publication:
-
Physical Review Letters
- Pub Date:
- August 2012
- DOI:
- 10.1103/PhysRevLett.109.050501
- arXiv:
- arXiv:1202.6257
- Bibcode:
- 2012PhRvL.109e0501S
- Keywords:
-
- 03.67.Ac;
- 03.65.-w;
- 03.67.Lx;
- 42.50.Lc;
- Quantum algorithms protocols and simulations;
- Quantum mechanics;
- Quantum computation;
- Quantum fluctuations quantum noise and quantum jumps;
- Quantum Physics
- E-Print:
- 7 pages