Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Open accessThe DOI matches its Crossref record; 70 of the 70 references it cites were found in a registry or an index.
Abstract
We benchmark the quantum processing units of the largest quantum annealers to date, the $$5000+$$ 5000 + qubit quantum annealer Advantage and its 2000+ qubit predecessor D-Wave 2000Q, using tail assignment and exact cover problems from aircraft scheduling scenarios. The benchmark set contains small, intermediate, and large problems with both sparsely connected and almost fully connected instances. We find that Advantage outperforms D-Wave 2000Q for almost all problems, with a notable increase in success rate and problem size. In particular, Advantage is also able to solve the largest problems with 120 logical qubits that D-Wave 2000Q cannot solve anymore. Furthermore, problems that can still be solved by D-Wave 2000Q are solved faster by Advantage. We find, however, that D-Wave 2000Q can achieve better success rates for sparsely connected problems that do not require the many new couplers present on Advantage, so improving the connectivity of a quantum annealer does not per se improve its performance.
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
“The state-of-the-art QA hardware (D-Wave Advantage System) features more than 5000 qubits, advanced topology to connect qubits, and ef fi cient hybrid algorithms (e.g., Leap Hybrid sampler).”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [23]
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
“Recent advancements in QA with more than 5000 qubits, enhanced qubit connectivity, and the hybrid architecture promise to realize the quantum advantage.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [23]
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
“Several prior studies reported that QA may not be ef fi cient since it cannot effectively handle dense and large QUBOs due to hardware limitations 23,31,32 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [23]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“For example, the recent development (e.g., Pegasus topology) has increased qubit connectivity from 6 to 15 21 -23 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [23]
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2011) · Cited by 2,724
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512 · cited 1×
“(10) and (11)) for λ = 0 (see also [47]).”
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
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
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
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
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789
Born, M., & Fock, V. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01343193 · Cited by 1,494 · cited 1×
“The reason is that for a quantum annealer, the annealing time is a central parameter with an expectable influence on the success rate: from the adiabatic theorem [67], comparably long annealing times are expected to lead to reasonable success rates.”
Background
Research works printed but not linked: 2
- Willsch, M.: Study of quantum annealing by simulating the time evolution of flux qubits, Ph.D. thesis, RWTH Aachen University, Aachen (2020a)
- Willsch, D.: Supercomputer simulations of transmon quantum computers, Ph.D. thesis, RWTH Aachen University, Aachen (2020b)
Cited by
Quantum annealing for industry applications: introduction and review
Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac8c54 · Cited by 341
“[191], the increased connectivity of D-Wave’s Pegasus topology can lead to a reduction in the success probability as compared to the Chimera topology when addressing sparsely connected problems.”
Montañez-Barrera, J. A., Willsch, D., Maldonado-Romo, A., & Michielsen, K. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad35e4 · Cited by 57
“Besides, quantum annealers, using the quantum annealing (QA) principle [11–13], are another quantum technology used to solve combinatorial optimization problems [14–16].”
MethodSelf-citationA Survey on Available Tools and Technologies Enabling Quantum Computing
Singh, P., Dasgupta, R., Singh, A., Pandey, H., Hassija, V., Chamola, V., & Sikdar, B. (2024) · IEEE Access · doi:10.1109/access.2024.3388005 · Cited by 62
“It enables researchers to leverage quantum annealing’s unique properties for solving complex optimization challenges [100].”
BackgroundQuantum annealing for combinatorial optimization: a benchmarking study
Kim, S., Ahn, S.-W., Suh, I.-S., Dowling, A. W., Lee, E., & Luo, T. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01020-1 · Cited by 46
“Several prior studies reported that QA may not be ef fi cient since it cannot effectively handle dense and large QUBOs due to hardware limitations 23,31,32 .”
A Single-Step Multiclass SVM Based on Quantum Annealing for Remote Sensing Data Classification
Delilbasic, A., Saux, B. L., Riedel, M., Michielsen, K. F. L., & Cavallaro, G. (2023) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2023.3336926 · Cited by 53
“Their values are chosen empirically, finding a tradeoff between total run time and quality of the solutions on the small validation set, testing a range of values that have been considered valid in previous work, e.g., in [55].”
BackgroundSelf-citation
Metadata
- Authors
- Willsch, D., Willsch, M., Gonzalez Calaza, C. D., Jin, F., De Raedt, H., Svensson, M., & Michielsen, K.
- Affiliations
- Forschungszentrum Jülich (DE)
- Chalmers University of Technology (SE)
- Corresponding author
- Willsch, Dennis
- ORCID
- Venue
- Quantum Information Processing
- Published
- 2022-04-01
- Volume
- 21
- Issue
- 4
- ISSN
- 1570-0755 (ISSN-L)
- 1573-1332
- OpenAlex
- W3158081750
- Cited by
- 114
- References
- 69
- Citations by year
- 2026: 19 · 2025: 29 · 2024: 33 · 2023: 24 · 2022: 6
- FWCI
- 7.57
- 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
- Quantum Information Processing (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- RWTH Publications (RWTH Aachen) (submittedVersion, other-oa)
- University of Groningen research database (University of Groningen / Centre for Information Technology) (submittedVersion, cc-by)
- Chalmers Research (Chalmers University of Technology) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Bundesministerium für Bildung und Forschung
- Forschungszentrum Jülich
- Horizon2020 (820363)
- Knut och Alice Wallenbergs Stiftelse
- 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 › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- quantum annealing, D-Wave 2000Q, exact cover problem, aircraft scheduling, benchmarking, qubit connectivity, success rate, complete graphs
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: Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems. https://app.cochat.ai/papers/10.1007/s11128-022-03476-y
- The paper
- Willsch, D., Willsch, M., Gonzalez Calaza, C. D., Jin, F., De Raedt, H., Svensson, M., & Michielsen, K. (2022). Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems. Quantum Information Processing. https://doi.org/10.1007/s11128-022-03476-y
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.