Quantum Speedup by Quantum Annealing

Details Quantum Speedup by Quantum Annealing Quantum Speedup by Quantum Annealing

2012-02-28

arxiv.org/abs/1202.6257v1

Physics

Quantum Physics

7 pages

Scientific paper

We study the glued-trees problem of Childs et. al. 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.

Affiliated with

Also associated with

No associations

Rating

Quantum Speedup by Quantum Annealing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Speedup by Quantum Annealing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Speedup by Quantum Annealing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-611244