Physics – Quantum Physics
Scientific paper
2004-05-18
SIAM Journal of Computing, Vol. 37, Issue 1, p. 166-194 (2007), conference version in Proc. 45th FOCS, p. 42-51 (2004)
Physics
Quantum Physics
30 pages, updated version
Scientific paper
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which implies that the adiabatic computation model and the conventional quantum computation model are polynomially equivalent. Our result can be extended to the physically realistic setting of particles arranged on a two-dimensional grid with nearest neighbor interactions. The equivalence between the models provides a new vantage point from which to tackle the central issues in quantum computation, namely designing new quantum algorithms and constructing fault tolerant quantum computers. In particular, by translating the main open questions in the area of quantum algorithms to the language of spectral gaps of sparse matrices, the result makes these questions accessible to a wider scientific audience, acquainted with mathematical physics, expander theory and rapidly mixing Markov chains.
Aharonov Dorit
Dam Wim van
Kempe Julia
Landau Zeph
Lloyd Seth
No associations
LandOfFree
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation 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 Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-366596