First-Order Phase Transition in the Quantum Adiabatic Algorithm
Top Cited Papers
- 14 January 2010
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 104 (2) , 020502
- https://doi.org/10.1103/physrevlett.104.020502
Abstract
We simulate the quantum adiabatic algorithm (QAA) for the exact cover problem for sizes up to using quantum Monte Carlo simulations incorporating parallel tempering. At large , we find that some instances have a discontinuous (first-order) quantum phase transition during the evolution of the QAA. This fraction increases with increasing and may tend to 1 for .
Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Size Dependence of the Minimum Excitation Gap in the Quantum Adiabatic AlgorithmPhysical Review Letters, 2008
- Simple Glass Models and Their Quantum AnnealingPhysical Review Letters, 2008
- Phase diagram of the 1-in-3 satisfiability problemPhysical Review E, 2007
- Adiabatic quantum computing for random satisfiability problemsPhysical Review A, 2003
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 2001
- Quantum annealing in the transverse Ising modelPhysical Review E, 1998
- Exchange Monte Carlo Method and Application to Spin Glass SimulationsJournal of the Physics Society Japan, 1996
- Critical Behavior in the Satisfiability of Random Boolean ExpressionsScience, 1994
- Solvable model of the quantum spin glass in a transverse fieldPhysical Review B, 1990
- The simplest spin glassNuclear Physics B, 1984