The DOI matches its Crossref record; 216 of the 216 references it cites were found in a registry or an index.
Perspectives of quantum annealing: methods and implementations
Open accessAbstract
Quantum annealing is a computing paradigm that has the ambitious goal of efficiently solving large-scale combinatorial optimization problems of practical importance. However, many challenges have yet to be overcome before this goal can be reached. This perspectives article first gives a brief introduction to the concept of quantum annealing, and then highlights new pathways that may clear the way towards feasible and large scale quantum annealing. Moreover, since this field of research is to a strong degree driven by a synergy between experiment and theory, we discuss both in this work. An important focus in this article is on future perspectives, which complements other review articles, and which we hope will motivate further research.
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 source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Adaptations to the standard QA mentioned in Section 2 comprise the utilization of timedependent Hamiltonians [136], non-stoquastic Hamiltonians [62], transverse couplers [136], and counter-diabatic driving terms [111].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [62]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Acomprehensive survey on QA on a conceptual level is provided by Hauke et al. [62], where a strong focus is on future perspectives.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [62]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Suf fi ciently slow evolution from H 0 to Hp enables the quantumsystem to stay at the ground state, which leads to the identi fi cation of the optimal solution of a given combinatorial optimization problem 3,40 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [40]
The cited source says what the claim attributes to it.
In the citing paper
“Optimization problems can be cast as a polynomial unconstrained binary optimization (PUBO) expressed in the form of a k -local interaction with k ≥ 3 over binary variables x i ∈ { 0 , 1 } (Hauke et al. , 2020; Perdomo-Ortiz et al. , 2019).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Hauke et al., 2020
The cited source says what the claim attributes to it.
In the citing paper
“The potential of QA has been studied extensively (Brady and van Dam, 2016; Denchev et al. , 2016; Farhi et al. , 2002; Hastings, 2020; Hauke et al. , 2020).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Hauke et al., 2020
5 more claims about this paper
Create a free account to see every claim other papers make about this one.
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
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
Spin glasses: Experimental facts, theoretical concepts, and open questions
Binder, K., & Young, A. P. (1986) · Reviews of Modern Physics · doi:10.1103/revmodphys.58.801 · Cited by 5,177
Topology of cosmic domains and strings
Kibble, T. W. B. (1976) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/9/8/029 · Cited by 4,545
Strong coupling of a single photon to a superconducting qubit using circuit quantum electrodynamics
Wallraff, A., Schuster, D. I., Blais, A., Frunzio, L., Huang, R. S., Majer, J., Kumar, S., Girvin, S. M., & Schoelkopf, R. J. (2004) · Nature · doi:10.1038/nature02851 · Cited by 3,796
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733
Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications
Mezard, M., Parisi, G., & Virasoro, M. (1986) · World Scientific Lecture Notes in Physics · doi:10.1142/0271 · Cited by 3,653
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
Research works printed but not linked: 18
- Perdomo-Ortiz, 2012, Sci. Rep., 2, 571, 10.1038/srep00571 · DOI · Paper page
- Rønnow, 2014, Science, 345, 420, 10.1126/science.1252319 · DOI · Paper page
- Dickson, 2013, Nat. Commun., 4, 1903, 10.1038/ncomms2920 · DOI · Paper page
- Albash, 2018, Rev. Mod. Phys., 90, 10.1103/revmodphys.90.015002 · DOI · Paper page
- Farhi, 2001, Science, 292, 472, 10.1126/science.1057726 · DOI · Paper page
- Tanaka, 2000, Electron. Commun. Jpn., 83, 84, 10.1002/(sici)1520-6440(200003)83:3<84::aid-ecjc9>3.0.co;2-n · doi:10.1002/(sici)1520-6440(200003)83:3<84::aid-ecjc9>3.0.co;2-n
- Zeng, 2015, J. Phys. A: Math. Theor., 49, 10.1088/1751-8113/49/16/165305 · DOI · Paper page
- Rønnow, 2014, Science, 345, 420, 10.1126/science.1252319 · DOI · Paper page
- Pudenz, 2014, Nat. Commun., 5, 3243, 10.1038/ncomms4243 · DOI · Paper page
- Hukushima, 2003, vol 690, p 200
- Wang, 2015, Phys. Rev. E, 92, 10.1103/physreve.92.063307 · DOI
- Albash, 2015, Eur. Phys. J. Spec. Top., 224, 111, 10.1140/epjst/e2015-02346-0 · DOI · Paper page
- Dziarmaga, 2010, New J. Phys., 12, 10.1088/1367-2630/12/5/055007 · DOI
- Rams, 2016, New J. Phys., 18, 10.1088/1367-2630/aa5079 · DOI
- Berry, 2009, J. Phys. A: Math. Theor., 42, 10.1088/1751-8113/42/36/365303 · DOI · Paper page
- Hartmann, 2018, New J. Phys., 21, 10.1088/1367-2630/ab14a0 · DOI
- Graβ, 2016, Nature Commun.
- Tran, 2016, SOCS
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Superconducting Qubits: Current State of Play
Kjaergaard, M., Schwartz, M. E., Braumüller, J., Krantz, P., Wang, J. I.-J., Gustavsson, S., & Oliver, W. D. (2020) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031119-050605 · Cited by 1,544
Self-citationPractical quantum advantage in quantum simulation
Daley, A. J., Bloch, I., Kokail, C., Flannigan, S., Pearson, N., Troyer, M., & Zoller, P. (2022) · Nature · doi:10.1038/s41586-022-04940-6 · Cited by 669
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
Quantum simulation and computing with Rydberg-interacting qubits
Morgado, M., & Whitlock, S. (2021) · AVS Quantum Science · doi:10.1116/5.0036562 · Cited by 370
Metadata
- Authors
- Hauke, P., Katzgraber, H. G., Lechner, W., Nishimori, H., & Oliver, W. D.
- Affiliations
- University of Trento (IT)
- Microsoft (United States) (US)
- Austrian Academy of Sciences (AT)
- Tokyo Institute of Technology (JP)
- MIT Lincoln Laboratory (US)
- Venue
- Reports on Progress in Physics
- Publisher
- IOP Publishing
- Published
- 2020-05-01
- Volume
- 83
- Issue
- 5
- Pages
- 054401
- ISSN
- 0034-4885 (ISSN-L)
- 1361-6633
- OpenAlex
- W3014405689
- Cited by
- 507
- References
- 215
- Citations by year
- 2026: 53 · 2025: 120 · 2024: 98 · 2023: 85 · 2022: 81 · 2021: 51 · 2020: 16
- FWCI
- 23.00
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- publishingsupport.iopscience.iop.org/iop-standard/v1 (vor, 6 d)
- iopscience.iop.org/info/page/text-and-data-mining (tdm, 6 d)
- Locations
- Reports on Progress in Physics (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Iris (University of Trento) (submittedVersion, cc-by-nc-nd)
- DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc-sa)
- arXiv (Cornell University)
- Funders
- Deutsche Forschungsgemeinschaft (Collaborative Research Center SFB 1225 (ISOQUANT))
- H2020 European Research Council (AdG EntangleGen (Project ID: 694561))
- Intelligence Advanced Research Projects Activity (MIT Lincoln Laboratory Air Force Contract No.∼FA87)
- Hauser-Raspe foundation
- Austrian Science Fund (SFB BeyondC Project No. F7108-N38)
- European Union's Horizon 2020 research and innovation program (grant agreement No.∼817482 PasQuanS)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum annealing, combinatorial optimization, quantum annealing hardware, large-scale optimization
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: Perspectives of quantum annealing: methods and implementations. https://app.cochat.ai/papers/10.1088/1361-6633/ab85b8
- The paper
- Hauke, P., Katzgraber, H. G., Lechner, W., Nishimori, H., & Oliver, W. D. (2020). Perspectives of quantum annealing: methods and implementations. Reports on Progress in Physics. https://doi.org/10.1088/1361-6633/ab85b8
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.