arXiv:quant-ph/0206003AbstractReferencesReviewsResources
How Powerful is Adiabatic Quantum Computation?
Wim van Dam, Michele Mosca, Umesh Vazirani
Published 2002-06-01Version 1
We analyze the computational power and limitations of the recently proposed 'quantum adiabatic evolution algorithm'.
Comments: 12 pages, LaTeX2e, requires fullpage, times, amssymb, and amsmath packages. This article appeared in the proceedings of FOCS'01; original submission date: April 27, 2001
Journal: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, pp. 279-287 (2001)
Categories: quant-ph
Keywords: adiabatic quantum computation, quantum adiabatic evolution algorithm, computational power, limitations
Tags: journal article
Related articles: Most relevant | Search more
A study of heuristic guesses for adiabatic quantum computation
arXiv:2204.03862 [quant-ph] (Published 2022-04-08)
Improving approximate vacuum prepared by the adiabatic quantum computation
Adiabatic Quantum Computation in Open Systems