Quantum annealing: The fastest route to quantum computation?
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 1×
“ter2, capable of eciently solving problems outside the usual domain of Physics. Shor showed that a quantum computer could factor large numbers exponentially faster than any known classical algorithm [60], and Grover showed that it could nd a needle in a haystack provably more e- ciently than any classical search party…”
BackgroundQuantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339 · cited 1×
“[24] in 2000, although the idea of using quantum fluctuations to speed up annealing processes for discovering the ground states of Hamiltonians more efficietly had already been proposed by [40,54] in 1998.”
BackgroundA Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · doi:10.1017/cbo9780511804090 · Cited by 1,690
Classical and Quantum Computation
Kitaev, A., Shen, A., & Vyalyi, M. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/047 · Cited by 1,387
Evidence for quantum annealing with more than one hundred qubits
Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2014) · Nature Physics · doi:10.1038/nphys2900 · Cited by 810
Quantum Computation by Adiabatic Evolution
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000) · arXiv · doi:10.48550/arxiv.quant-ph/0001106 · Cited by 536 · cited 1×
“[24] in 2000, although the idea of using quantum fluctuations to speed up annealing processes for discovering the ground states of Hamiltonians more efficietly had already been proposed by [40,54] in 1998.”
BackgroundAdiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2008) · SIAM Review · doi:10.1137/080734479 · Cited by 395 · cited 1×
“They soon established that adiabatic evolutions could be used to simulate the evolution of quantum circuits (and vice versa) and thus that a suitably generalized QAA constitutes a completely universal model for quantum computation [2].”
BackgroundThe quantum adiabatic optimization algorithm and local minima
Reichardt, B. W. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007428 · Cited by 110 · cited 1×
“tic derivation of its dire consequences for the QAA. In disordered, geometrically local optimization problems in 1D, Griths-like effects may arise in which large local regions order before the whole [56,27]. It is unlikely that such Griths eects play an important role in higher dimensions or on long-range interaction…”
BackgroundEfficient algorithm for a quantum analogue of 2-SAT
Bravyi, S. (2011) · Contemporary Mathematics · doi:10.1090/conm/536/10552 · Cited by 98
How "Quantum" is the D-Wave Machine?
Shin, S. W., Smith, G., Smolin, J. A., & Vazirani, U. (2014) · arXiv · doi:10.48550/arxiv.1401.7087 · Cited by 89
HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
FARHI, E., GOLDSTONE, J., GUTMANN, S., & NAGAJ, D. (2008) · International Journal of Quantum Information · doi:10.1142/s021974990800358x · Cited by 81
Cited by
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
“…and Semerjian, 2012; Dusuel and Vidal, 2005; Jörg et al., 2008, 2010a; Knysh and Smelyanskiy, 2006)], counterexamples wherein a first order quantum phase transition is associated with a polynomially small gap are known (Cabrera and Jullien, 1987; Laumann et al., 2012, 2015; Tsuda et al., 2013).”
BackgroundLocal integrals of motion in many‐body localized systems
Imbrie, J. Z., Ros, V., & Scardicchio, A. (2017) · Annalen der Physik · doi:10.1002/andp.201600278 · Cited by 232
“For instance, it may be interesting to re-consider the implications of MBL on well known protocols in quantum computation (such as the quantum adiabatic algorithm [6, 63]) in view of this characterization in terms of the emergent integrability.”
BackgroundSelf-citationLienhard, V., de Léséleuc, S., Barredo, D., Lahaye, T., Browaeys, A., Schuler, M., Henry, L.-P., & Läuchli, A. M. (2018) · Physical Review X · doi:10.1103/physrevx.8.021070 · Cited by 209
Nested quantum annealing correction
Vinci, W., Albash, T., & Lidar, D. A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.17 · Cited by 57
Metadata
- Authors
- Laumann, C. R., Moessner, R., Scardicchio, A., & Sondhi, S. L.
- Venue
- The European Physical Journal Special Topics
- Published
- 2015-02
- Volume
- 224
- Issue
- 1
- Pages
- 75-88
- ISSN
- 1951-6355 (ISSN-L)
- 1951-6401
- OpenAlex
- W1977085333
- Cited by
- 54
- References
- 13
- FWCI
- 6.26
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.