Quantum Adiabatic Evolution Algorithms with Different Paths

Details Quantum Adiabatic Evolution Algorithms with Different Paths Quantum Adiabatic Evolution Algorithms with Different Paths

2002-08-21

arxiv.org/abs/quant-ph/0208135v1

Physics

Quantum Physics

9 pp., 2 eps figures, using LaTeX and BoxedEPS macros; email correspondence to farhi@mit.edu

Scientific paper

In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes the solution of the computational problem. These algorithms have generally been studied in the case where the "straight line" path from initial to final Hamiltonian is taken. But there is no reason not to try paths involving terms that are not linear combinations of the initial and final Hamiltonians. We give several proposals for randomly generating new paths. Using one of these proposals, we convert an algorithmic failure into a success.

Affiliated with

Also associated with

No associations

Rating

Quantum Adiabatic Evolution Algorithms with Different Paths 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 Adiabatic Evolution Algorithms with Different Paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Adiabatic Evolution Algorithms with Different Paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221028