Unstructured Randomness, Small Gaps and Localization

Matrix Analysis and Applied Linear Algebra

Carl D. Meyer · 2001

Earlier work this paper cites.

The exact ground state for a class of matrix Hamiltonian models: quantum phase transition and universality in the thermodynamic limit

M. Ostilli and C. Presilla · 2006

Earlier work this paper cites.

Bounds for the adiabatic approximation with applications to quantum computation

S. Jansen, M.-B. Ruskai, and R. Seiler · 2007

Earlier work this paper cites.

How to Make the Quantum Adiabatic Algorithm Fail

E. Farhi, J. Goldstone, S. Gutmann, and D. Nagaj · 2008

Earlier work this paper cites.

Size Dependence of the Minimum Excitation Gap in the Quantum Adiabatic Algorithm

A. P. Young, S. Knysh, and V. N. Smelyanskiy · 2008

Earlier work this paper cites.

Adiabatic quantum optimization fails for random instances of NP-complete problems

Original

B. Altshuler, H. Krovi, and J. Roland · 2009

Cited alongside, same era.

Anderson localization casts clouds over adiabatic quantum optimization

Original

B. Altshuler, H. Krovi, and J. Roland · 2009

Cited alongside, same era.

First-order quantum phase transition in adiabatic quantum computation

M. H. S. Amin and V. Choi · 2009

Cited alongside, same era.

Quantum Adiabatic Algorithms, Small Gaps, and Different Paths

Original

E. Farhi, J. Goldstone, D. Gosset, S. Gutmann, H. B. Meyer, and P. Shor · 2009

Cited alongside, same era.

Quantum Annealing of Hard Problems

T. Jörg, F. Krzakala, J. Kurchan, and A. C. Maggs · 2010

Closest in time.

On the relevance of avoided crossings away from quantum critical point to the complexity of quantum adiabatic algorithm

Original

S. Knysh and V. Smelyanskiy · 2010

Closest in time.

Phase transition and annealing in quantum random energy models

Original

C. Presilla and M. Ostilli · 2010

Closest in time.

First-Order Phase Transition in the Quantum Adiabatic Algorithm

A. P. Young, S. Knysh, and V. N. Smelyanskiy · 2010

Closest in time.