title: 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.
authors.affiliation: Los Alamos National Laboratory, New Mexico 87545, USA.
authors.forename: Rolando D
authors.initials: RD
authors.lastname: Somma
authors.forename: Daniel
authors.initials: D
authors.lastname: Nagaj
authors.forename: Mária
authors.initials: M
authors.lastname: Kieferová