Prospects for quantum enhancement with diabatic quantum annealing
Open accessThe DOI matches its Crossref record; 73 of the 73 references it cites were found in a registry or an index.
Abstract
Optimization, sampling and machine learning are topics of broad interest that have inspired significant developments and new approaches in quantum computing. One such approach is quantum annealing (QA). In this Review, we assess the prospects for algorithms within the general framework of QA to achieve a quantum speedup relative to classical state-of-the-art methods. We argue for continued exploration in the QA framework on the basis that improved coherence times and control capabilities will enable the near-term exploration of several heuristic quantum optimization algorithms. These continuous-time Hamiltonian computation algorithms rely on control protocols that are more advanced than those in traditional ground-state QA, while still being considerably simpler than those used in gate-model implementations. The inclusion of coherent diabatic transitions to excited states results in a generalization we refer to collectively as diabatic quantum annealing, which we believe is the most promising route to quantum enhancement within this framework. Other promising variants of traditional QA include reverse annealing, continuous-time quantum walks and analogues of parameterized quantum circuit ansatzes for machine learning. Most of these algorithms have no known efficient classical simulations, making them worthy of further investigation with quantum hardware in the intermediate-scale regime. Quantum annealing is a widely used heuristic algorithm for optimization and sampling, implemented in commercial processors. This Review provides a critical assessment of the field and points to new opportunities for a quantum advantage via recently developed alternative quantum annealing protocols. Quantum annealing (QA) is an optimization and sampling heuristic that has been implemented in the first commercial quantum computing devices featuring the largest number of qubits to date. Despite a decade of effort, evidence of a quantum speedup is lacking, so researchers have turned to alternative, new QA protocols that deviate from the traditional forward-annealing, ground-state paradigm. New QA protocols exhibit promising early signs for possible quantum speedups. Diabatic QA appears particularly promising: it is unlikely to be efficiently classically simulatable, yet, it retains most of the simplicity of the original QA paradigm, while being less demanding than the gate model of quantum computing. Alternative QA protocols can be explored in a state-of-the-art manner by embracing the full range of new out-of-equilibrium quantum dynamics generated by time-dependent effective transverse-field Ising Hamiltonians that can be natively implemented by inductively coupled flux qubits, both existing and projected at application scale. Quantum annealing (QA) is an optimization and sampling heuristic that has been implemented in the first commercial quantum computing devices featuring the largest number of qubits to date. Despite a decade of effort, evidence of a quantum speedup is lacking, so researchers have turned to alternative, new QA protocols that deviate from the traditional forward-annealing, ground-state paradigm. New QA protocols exhibit promising early signs for possible quantum speedups. Diabatic QA appears particularly promising: it is unlikely to be efficiently classically simulatable, yet, it retains most of the simplicity of the original QA paradigm, while being less demanding than the gate model of quantum computing. Alternative QA protocols can be explored in a state-of-the-art manner by embracing the full range of new out-of-equilibrium quantum dynamics generated by time-dependent effective transverse-field Ising Hamiltonians that can be natively implemented by inductively coupled flux qubits, both existing and projected at application scale.
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
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
The Theory of Open Quantum Systems
Breuer, H.-P., & Petruccione, F. (2007) · doi:10.1093/acprof:oso/9780199213900.001.0001 · Cited by 5,938
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Charge-insensitive qubit design derived from the Cooper pair box
Koch, J., Yu, T. M., Gambetta, J., Houck, A. A., Schuster, D. I., Majer, J., Blais, A., Devoret, M. H., Girvin, S. M., & Schoelkopf, R. J. (2007) · Physical Review A · doi:10.1103/physreva.76.042319 · Cited by 3,351
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Probing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891
Cited by
Ising machines as hardware solvers of combinatorial optimization problems
Mohseni, N., McMahon, P. L., & Byrnes, T. (2022) · Nature Reviews Physics · doi:10.1038/s42254-022-00440-8 · Cited by 543
Biology and medicine in the landscape of quantum advantages
Cordier, B. A., Sawaya, N. P. D., Guerreschi, G. G., & McWeeney, S. K. (2022) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0541 · Cited by 87
“Thus, while quantum annealing approaches to optimization may yet bear fruit in the NISQ era [268], a number of barriers remain to be addressed [251].”
BackgroundOn the emerging potential of quantum annealing hardware for combinatorial optimization
Tasseff, B., Albash, T., Morrell, Z., Vuffray, M., Lokhov, A. Y., Misra, S., & Coffrin, C. (2024) · Journal of Heuristics · doi:10.1007/s10732-024-09530-5 · Cited by 42
“This represented the first time that QA could be studied on optimization problems with more than a few dozen decision variables and spurred significant interest in developing a better understanding of the QA computing model [41, 35, 12].”
BackgroundUnconventional quantum annealing methods for difficult trial problems
Tang, Z., & Kapit, E. (2021) · Physical Review A · doi:10.1103/physreva.103.032612 · Cited by 8
Metadata
- Authors
- Crosson, E. J., & Lidar, D. A.
- Venue
- Nature Reviews Physics
- Published
- 2021-05-28
- Volume
- 3
- Issue
- 7
- Pages
- 466-489
- ISSN
- 2522-5820 (ISSN-L)
- OpenAlex
- W3080741966
- Cited by
- 134
- References
- 73
- FWCI
- 2.32
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Prospects for quantum enhancement with diabatic quantum annealing. https://app.cochat.ai/papers/10.1038/s42254-021-00313-6
- The paper
- Crosson, E. J., & Lidar, D. A. (2021). Prospects for quantum enhancement with diabatic quantum annealing. Nature Reviews Physics. https://doi.org/10.1038/s42254-021-00313-6
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.