The DOI matches its Crossref record; 77 of the 77 references it cites were found in a registry or an index.
On the emerging potential of quantum annealing hardware for combinatorial optimization
Open accessAbstract
Over the past decade, the usefulness of quantum annealing hardware for combinatorial optimization has been the subject of much debate. Thus far, experimental benchmarking studies have indicated that quantum annealing hardware does not provide an irrefutable performance gain over state-of-the-art optimization methods. However, as this hardware continues to evolve, each new iteration brings improved performance and warrants further benchmarking. To that end, this work conducts an optimization performance assessment of D-Wave Systems’ Advantage Performance Update computer, which can natively solve sparse unconstrained quadratic optimization problems with over 5,000 binary decision variables and 40,000 quadratic terms. We demonstrate that classes of contrived problems exist where this quantum annealer can provide run time benefits over a collection of established classical solution methods that represent the current state-of-the-art for benchmarking quantum annealing hardware. Although this work does not present strong evidence of an irrefutable performance benefit for this emerging optimization technology, it does exhibit encouraging progress, signaling the potential impacts on practical optimization tasks in the future.
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
“However,duetothelimitednumberofqubitsandtheirconnectivity, the QAhardwaredidnot show such an advantage over classical methods in past benchmarking studies.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [18]
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
“Similarly, Tasseff et al. 18 highlighted the potential advantages of QA compared to classical methods (such as simulated annealing, integer programming, and Markov chain Monte Carlo) for sparse optimization problems containing up to 5000 decision variables and 40,000 quadratic terms.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [18]
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
“Whilepreviousbenchmarkingstudiesshowedsomeadvantages of QA, most used low-dimensional or the sparse con fi gurations of QUBO matrices due to the lack of available qubits in the QA hardware and poor topology to connect qubits 17 -19 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [18]
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
“We measure the computational time dedicated solely to solving given problems, excluding problem reading time, queue time, or communication time between the local computer and quantum annealer. This is consistent with other benchmarking studies 17,18 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [18]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Consequently, these benchmarking studies show that QA methods and their classical counterparts can exhibit similar solution quality and time complexity.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [18]
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 3×
“In a parallel tempering update, the spin configurations (or equivalently the temperatures) of two replicas are swapped according to the Metropolis-Hastings probability ([61, 34]), where β r and E ( σ r ) denote the inverse temperature and energy of the spin configuration of replica r , respectively.”
BackgroundMethodSimulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Time-Dependent Statistics of the Ising Model
Glauber, R. J. (1963) · Journal of Mathematical Physics · doi:10.1063/1.1703954 · Cited by 3,619 · cited 1×
“Glauber dynamics is often used as a method for producing samples from Ising models at finite temperatures [30].”
MethodIsing formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512 · cited 1×
“However, the optimization literature on quadratic unconstrained binary optimization (QUBO), which is equivalent to minimization of an Ising model’s energy function, indicates how this model can encode a wide range of practical optimization problems [51, 54].”
BackgroundExchange Monte Carlo Method and Application to Spin Glass Simulations
Hukushima, K., & Nemoto, K. (1996) · Journal of the Physical Society of Japan · doi:10.1143/jpsj.65.1604 · Cited by 2,475 · cited 1×
“Markov chain Monte Carlo (MCMC) algorithms are a class of methods to generate samples from complex probability distributions.”
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 · cited 3×
“The annealing process in QA provides a method for steering a quantum system into the a priori unknown eigenvector that minimizes Equation (4) [44, 24].”
A 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 · cited 2×
“The release of D-Wave Systems’ QA hardware platform also generated expectations that this new technology would quickly outperform state-of-the-art classical methods for solving well-suited combinatorial optimization problems [23, 22, 71].”
BackgroundMethodReplica Monte Carlo Simulation of Spin-Glasses
Swendsen, R. H., & Wang, J.-S. (1986) · Physical Review Letters · doi:10.1103/physrevlett.57.2607 · Cited by 2,031 · cited 10×
“Markov chain Monte Carlo (MCMC) algorithms are a class of methods to generate samples from complex probability distributions.”
InfluentialInformation, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Research works printed but not linked: 1
- Geyer, C.J. (1991). Parallel tempering. In: Keramidas, E.M., Kaufman, S.M. (eds) Computing Science and Statistics Proceedings of the 23rd Symposium on the Interface. American Statistical Association, New York, p 156
Cited by
Challenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201
“However, QAA may be an effective heuristic in non-adiabatic implementations 44,168,169,174,230–233 .”
Self-citationOptimization Applications as Quantum Performance Benchmarks
Lubinski, T., Coffrin, C., McGeoch, C. C., Sathe, P., Apanavicius, J., Bernal, D. E., & Quantum Economic Development Consortium Collaboration (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3678184 · Cited by 117
“While these two methods characterize quantum circuit execution quality and scale, neither provides information about the time it takes a program to run, which is a critical factor in evaluating the total cost of any computing solution.”
Self-citationShort-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
Quantum Optimization: Potential, Challenges, and the Path Forward
Abbas, A., (NNSA), U. N. N. S. A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D., et al. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2229681 · Cited by 67
Self-citationOptimization Applications as Quantum Performance Benchmarks
Lubinski, T., Coffrin, C., McGeoch, C., Sathe, P., Apanavicius, J., & Neira, D. E. B. (2023) · arXiv · doi:10.48550/arxiv.2302.02278 · Cited by 62
“While these two methods characterize quantum circuit execution quality and scale, neither provides information about the time it takes a program to run, which is a critical factor in evaluating the total cost of any computing solution.”
Self-citation
Metadata
- Authors
- Tasseff, B., Albash, T., Morrell, Z., Vuffray, M., Lokhov, A. Y., Misra, S., & Coffrin, C.
- Affiliations
- Los Alamos National Laboratory (US)
- University of New Mexico (US)
- Corresponding author
- Coffrin, Carleton
- ORCID
- Venue
- Journal of Heuristics
- Published
- 2024-08-02
- Volume
- 30
- Issue
- 5-6
- Pages
- 325-358
- ISSN
- 1381-1231 (ISSN-L)
- 1572-9397
- OpenAlex
- W4401243790
- Semantic Scholar
- c29b9506fae7ca2d1e7903ea13f633e4d01e4b4e
- Cited by
- 42
- References
- 76
- Citations by year
- 2026: 17 · 2025: 20 · 2024: 5
- FWCI
- 6.22
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Journal of Heuristics (publishedVersion, cc-by)
- RePEc: Research Papers in Economics (submittedVersion)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- Funders
- Los Alamos National Laboratory (20210114ER)
- National Science Foundation (2037755)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Keywords
- quantum annealing, combinatorial optimization, D-Wave Advantage, binary variables
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: On the emerging potential of quantum annealing hardware for combinatorial optimization. https://app.cochat.ai/papers/10.1007/s10732-024-09530-5
- The paper
- Tasseff, B., Albash, T., Morrell, Z., Vuffray, M., Lokhov, A. Y., Misra, S., & Coffrin, C. (2024). On the emerging potential of quantum annealing hardware for combinatorial optimization. Journal of Heuristics. https://doi.org/10.1007/s10732-024-09530-5
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.