Journal
PHYSICAL REVIEW LETTERS
Volume 109, Issue 5, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.109.050501
Keywords
-
Categories
Funding
- European project Q-ESSENCE
- Slovak Research and Development Agency [LPP-0430-09, APVV-0646-10 COQI]
- National Science Foundation through the CCF program
- Laboratory Directed Research and Development Program at Los Alamos
- Sandia National Laboratories
- U.S. Department of Energy's National Nuclear Security Administration [DE-AC04-94AL85000]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available