Defining and detecting quantum speedup
Open accessThe DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Abstract
How to benchmark a quantum computer: Quantum machines offer the possibility of performing certain computations much faster than their classical counterparts. However, how to define and measure quantum speedup is a topic of debate. Rønnow et al. describe methods for fairly evaluating the difference in computational power between classical and quantum processors. They define various types of quantum speedup and consider quantum processors that are designed to solve a specific class of problems. Science , this issue p. 420
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
“as of now we don't have a convincing theoretical argument or persuasive experimental evidence indicating that quantum annealers can really speed up the time to solution compared to the best classical hardware running the best algorithms for the same problems [28, 29].”
From Quantum Computing in the NISQ era and beyond (2018) · cites this paper as [28]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“although the speedup (or otherwise) seems to have a rather subtle dependence on the problem instance, classical solver compared, and measure of comparison. 38,39”
From Quantum algorithms: an overview (2016) · cites this paper as [39]
In the citing paper
“Furthermore, it is currently believed that quantum computers cannot offer an exponential speedup to NP-complete and harder problems [207], although they can offer scaling advantages that have been known in the literature as “limited quantum speedup” [208].”
From The prospects of quantum computing in computational molecular biology (2021) · cites this paper as [208]
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
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
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
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
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
Research works printed but not linked: 5
- P. W. Shor in Proceedings 35th Annual Symposium on Foundations of Computer Science (IEEE New York 1994) pp. 124–134.
- S. Boixo T. Albash F. M. Spedalieri N. Chancellor D. A. Lidar http://arxiv.org/abs/1212.1739 (2012). · arXiv
- W. Vinci T. Albash A. Mishra P. A. Warburton D. A. Lidar http://arxiv.org/abs/1403.4228 (2014). · arXiv
- J. A. Smolin G. Smith http://arxiv.org/abs/1305.4904 (2013). · arXiv
- C. C. McGeoch C. Wang in Proceedings of the ACM Conference on Computing Frontiers (ACM New York 2013) pp. XX–XX.
Cited by
Items 601–604 of 604
Dependence-aware design of typhoon-resilient offshore methanol platformsPreprint
Li, X., Luo, S., Li, X., Wang, G., & Ding, G. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7438751
Engineered Diabatic Transition under Arbitrarily Slow Evolution via Phase-Difference Manipulation
Anonymous, Jiang, Z., Shi, J., Dai, Q., Guan, C., & Zhang, S. (2026) · Physical Review Letters · doi:10.1103/ntgm-dshb
Esrafilian, V., Ravan, B. A., Javadi, A., & Daniali, H. (2026) · International Journal of Theoretical Physics · doi:10.1007/s10773-026-06497-w
Device‐to‐System Perspectives on Scalable Ising Machines for Physics‐Driven Computing
Youn, S., Hwang, H., Lee, J., 서희수, & Kim, S. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70519
“Subsequent experimental investigations provided strong evidence supporting the quantum nature of the system, including observations of quantum effects in multi-qubit dynamics and quantum correlations [ 30, 31 ].”
Metadata
- Authors
- Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M.
- Affiliations
- ETH Zurich (CH)
- University of Southern California (US)
- Google (Switzerland) (CH)
- Microsoft (United States) (US)
- University of California, Santa Barbara (US)
- Corresponding author
- Troyer, Matthias
- Venue
- Science
- Published
- 2014-07-25
- Volume
- 345
- Issue
- 6195
- Pages
- 420-424
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2028918948
- Semantic Scholar
- d4836804ee59c483943cc8f5e1eb88b58e4f52fc
- Cited by
- 601
- References
- 37
- Citations by year
- 2026: 35 · 2025: 50 · 2024: 47 · 2023: 50 · 2022: 45 · 2021: 54 · 2020: 47 · 2019: 54 · 2018: 45 · 2017: 44 · 2016: 55 · 2015: 51 · 2014: 24
- FWCI
- 57.83
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- 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 advantage, quantum annealing, superconducting qubits
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
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.