The DOI matches its Crossref record; 189 of the 189 references it cites were found in a registry or an index.
Quantum annealing for industry applications: introduction and review
Open accessAbstract
Quantum annealing (QA) is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems. In recent years, advances in quantum technologies have enabled the development of small- and intermediate-scale quantum processors that implement the QA algorithm for programmable use. Specifically, QA processors produced by D-Wave systems have been studied and tested extensively in both research and industrial settings across different disciplines. In this paper we provide a literature review of the theoretical motivations for QA as a heuristic quantum optimization algorithm, the software and hardware that is required to use such quantum processors, and the state-of-the-art applications and proofs-of-concepts that have been demonstrated using them. The goal of our review is to provide a centralized and condensed source regarding applications of QA technology. We identify the advantages, limitations, and potential of QA for both researchers and practitioners from various fields.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“This enhancement allows the quantum annealer to increase the potential for fi nding high-quality solutions 24,25 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [24]
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
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 · cited 3×
“More recently, industrial efforts to build commercially-available QCs have emerged around the world, with vendors such as IBM [125], Google [13], Rigetti [155], D-Wave systems [90], IonQ [45, 190] and others offering QC services via cloud-based access.”
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 1×
“In some cases this can even result in exponentially faster algorithms, such as Shor’s algorithm for factoring [150] and the quantum Fourier transform algorithm [37].”
Exploring Network Structure, Dynamics, and Function Using NetworkX
Hagberg, A. A., Schult, D. A., & Swart, P. J. (2008) · Proceedings of the Python in Science Conference · doi:10.25080/tcwv9851 · Cited by 7,477 · cited 3×
“An extension of the graph construction and visualization tool NetworkX [65], is available through Ocean (dwave-networkx).”
Markowitz, H. (1952) · The Journal of Finance · doi:10.1111/j.1540-6261.1952.tb01525.x · Cited by 5,641
Solvable Model of a Spin-Glass
Sherrington, D., & Kirkpatrick, S. (1975) · Physical Review Letters · doi:10.1103/physrevlett.35.1792 · Cited by 4,265 · cited 1×
“In the context of perturbed problem Hamiltonians, Ven-turelli et al [180] compared QA and simulated thermal annealing to measure the effects of disorder in ground state distributions on the Sherrington–Kirkpatrick model (SKM) with couplings randomized from a bimodal distribution of values ± 1 [162].”
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001 · cited 1×
“The first such hybrid algorithm that utilized QA processors was qbsolv [21], which used an outer classical loop of Tabu search [66] and a D-Wave QPU in its inner loop to flip the clusters of variables found by Tabu.”
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512 · cited 3×
“The Ising model can be easily transformed into various other forms, such as the unconstrained binary quadratic program [65], the undirected graphical model [114], and the QUBO problem [113].”
Research works printed but not linked: 1
- Kwon, 1994, Comparative evaluation of adaptive and neural-network exit demand prediction for freeway control, Transp. Res. Rec., 1446, 66
Cited by
NISQ computing: where are we and where do we go?
Lau, J. W. Z., Lim, K. H., Shrotriya, H., & Kwek, L. C. (2022) · AAPPS Bulletin · doi:10.1007/s43673-022-00058-z · Cited by 173
“More technical details about QA can be found in [98, 103].”
BackgroundHybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
Callison, A., & Chancellor, N. (2022) · Physical Review A · doi:10.1103/physreva.106.010101 · Cited by 205
“[48] Sheir Yarkoni, Elena Raponi, Sebastian Schmitt, and Thomas Bäck.”
Introduction to theoretical and experimental aspects of quantum optimal control
Ansel, Q., Dionis, E., Arrouas, F., Peaudecerf, B., Guérin, S., Guéry-Odelin, D., & Sugny, D. (2024) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/ad46a5 · Cited by 105
“We focus here on the experimental implementation of the control in a real system, namely the experimental setup at LCAR in Toulouse, the manipulation of the full quantum state of the BEC in the lattice, and a realization of an optimal control in an effective two-level quantum system.”
MethodOpportunities for quantum computing within net-zero power system optimization
Morstyn, T., & Wang, X. (2024) · Joule · doi:10.1016/j.joule.2024.03.020 · Cited by 71
Short-depth QAOA circuits and quantum annealing on higher-order ising models
Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00825-w · Cited by 97
Metadata
- Authors
- Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S.
- Affiliations
- Leiden University (NL)
- Honda (Germany) (DE)
- Venue
- Reports on Progress in Physics
- Publisher
- IOP Publishing
- Published
- 2022-09-21
- Volume
- 85
- Issue
- 10
- Pages
- 104001
- ISSN
- 0034-4885 (ISSN-L)
- 1361-6633
- OpenAlex
- W4200630323
- Cited by
- 341
- References
- 180
- Citations by year
- 2026: 62 · 2025: 113 · 2024: 104 · 2023: 54 · 2022: 7
- FWCI
- 4.84
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- publishingsupport.iopscience.iop.org/iop-standard/v1 (vor)
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- Locations
- Reports on Progress in Physics (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Leiden Repository (Leiden University) (submittedVersion)
- Data Archiving and Networked Services (DANS) (submittedVersion)
- arXiv (Cornell University) (cc-by)
- Funders
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek (DACCOMPLI 628.011.002)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum annealing, combinatorial optimization, quantum annealing hardware, industrial applications
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: Quantum annealing for industry applications: introduction and review. https://app.cochat.ai/papers/10.1088/1361-6633/ac8c54
- The paper
- Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022). Quantum annealing for industry applications: introduction and review. Reports on Progress in Physics. https://doi.org/10.1088/1361-6633/ac8c54
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.