Quantum annealing: The fastest route to quantum computation?

C. R. Laumann, R. Moessner, A. Scardicchio, Shivaji Lal Sondhi

Research output: Contribution to journalReview articlepeer-review

25 Scopus citations

Abstract

In this review we consider the performance of the quantum adiabatic algorithm for the solution of decision problems. We divide the possible failure mechanisms into two sets: small gaps due to quantum phase transitions and small gaps due to avoided crossings inside a phase. We argue that the thermodynamic order of the phase transitions is not predictive of the scaling of the gap with the system size. On the contrary, we also argue that, if the phase surrounding the problem Hamiltonian is a Many-Body Localized (MBL) phase, the gaps are going to be typically exponentially small and that this follows naturally from the existence of local integrals of motion in the MBL phase.

Original languageEnglish (US)
Pages (from-to)75-88
Number of pages14
JournalEuropean Physical Journal: Special Topics
Volume224
Issue number1
DOIs
StatePublished - Feb 1 2015

All Science Journal Classification (ASJC) codes

  • Materials Science(all)
  • Physics and Astronomy(all)
  • Physical and Theoretical Chemistry

Fingerprint Dive into the research topics of 'Quantum annealing: The fastest route to quantum computation?'. Together they form a unique fingerprint.

Cite this