arXiv Analytics

Sign in

arXiv:0910.1378 [cond-mat.stat-mech]AbstractReferencesReviewsResources

First order phase transition in the Quantum Adiabatic Algorithm

A. P. Young, S. Knysh, V. N. Smelyanskiy

Published 2009-10-07, updated 2010-01-19Version 2

We simulate the quantum adiabatic algorithm (QAA) for the exact cover problem for sizes up to N=256 using quantum Monte Carlo simulations incorporating parallel tempering. At large N we find that some instances have a discontinuous (first order) quantum phase transition during the evolution of the QAA. This fraction increases with increasing N and may tend to 1 for N -> infinity.

Comments: 5 pages, 3 figures. Replaced with published version; two figures slightly changed and some small changes to the text
Journal: Phys. Rev. Lett. 104, 020502 (2010)
Related articles: Most relevant | Search more
arXiv:1109.6872 [cond-mat.stat-mech] (Published 2011-09-30, updated 2011-12-29)
Exponential Complexity of the Quantum Adiabatic Algorithm for certain Satisfiability Problems
arXiv:cond-mat/0204349 (Published 2002-04-16, updated 2002-06-26)
First Order Phase Transition and Phase Coexistence in a Spin-Glass Model
arXiv:cond-mat/0301407 (Published 2003-01-22, updated 2003-05-31)
First Order Phase Transition in a Reaction-Diffusion Model With Open Boundary: The Yang-Lee Theory Approach