arXiv Analytics

Sign in

arXiv:quant-ph/0205048AbstractReferencesReviewsResources

Speedup in Quantum Adiabatic Evolution Algorithm

Joonwoo Bae, Younghun Kwon

Published 2002-05-09, updated 2002-10-24Version 2

Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential to examine the minimum energy gap between the ground level and the next one through the evolution. In this letter, we show a way of speedup in quantum adiabatic evolution algorithm, using the extended Hamiltonian. We present the exact relation between the energy gap and the elements of the extended Hamiltonian, which provides the new point of view to reduce the running time.

Comments: 5 pages, Latex
Journal: Z. Naturforsch 58a, 1-3 (2003)
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:2202.00118 [quant-ph] (Published 2022-01-31)
Quantum annealing for hard 2-SAT problems : Distribution and scaling of minimum energy gap and success probability
arXiv:quant-ph/0502072 (Published 2005-02-12, updated 2005-02-21)
NP-complete Problems and Physical Reality
arXiv:quant-ph/0204087 (Published 2002-04-16, updated 2003-11-25)
Maximum Speedup in Quantum Search : O(1) Running Time