Defining and detecting quantum speedup
Open accessThe DOI matches its Crossref record; 37 of the 37 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
Evidence for quantum annealing with more than one hundred qubits
Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2014) · Nature Physics · doi:10.1038/nphys2900 · Cited by 810
Self-citationTheory of Quantum Annealing of an Ising Spin Glass
Santoro, G. E., Martoňák, R., Tosatti, E., & Car, R. (2002) · Science · doi:10.1126/science.1068774 · Cited by 734
Bucket elimination: A unifying framework for reasoning
Dechter, R. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00059-4 · Cited by 583
Quantum Annealing of a Disordered Magnet
Brooke, J., Bitko, D., F., T., Rosenbaum, & Aeppli, G. (1999) · Science · doi:10.1126/science.284.5415.779 · Cited by 518
Exponential improvement in precision for simulating sparse Hamiltonians
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2014) · Proceedings of the forty-sixth annual ACM symposium on Theory of computing · doi:10.1145/2591796.2591854 · Cited by 324
Experimental signature of programmable quantum annealing
Boixo, S., Albash, T., Spedalieri, F. M., Chancellor, N., & Lidar, D. A. (2013) · Nature Communications · doi:10.1038/ncomms3067 · Cited by 293
Self-citationMinor-embedding in adiabatic quantum computation: II. Minor-universal graph design
Choi, V. (2011) · Quantum Information Processing · doi:10.1007/s11128-010-0200-3 · Cited by 278
Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor
Harris, R., Johnson, M. W., Lanting, T., Berkley, A. J., Johansson, J., Bunyk, P., Tolkacheva, E., Ladizinsky, E., Ladizinsky, N., Oh, T., et al. (2010) · Physical Review B · doi:10.1103/physrevb.82.024511 · Cited by 273
Adiabatic Quantum Computation in Open Systems
Sarandy, M. S., & Lidar, D. A. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.250503 · Cited by 219
Self-citationError-corrected quantum annealing with hundreds of qubits
Pudenz, K. L., Albash, T., & Lidar, D. A. (2014) · Nature Communications · doi:10.1038/ncomms4243 · Cited by 198
Self-citationKatzgraber, H. G., Hamze, F., & Andrist, R. S. (2014) · Physical Review X · doi:10.1103/physrevx.4.021008 · Cited by 180
Quantum Speedup by Quantum Annealing
Somma, R. D., Nagaj, D., & Kieferová, M. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.050501 · Cited by 176
Experimental evaluation of an adiabiatic quantum system for combinatorial optimization
McGeoch, C. C., & Wang, C. (2013) · Proceedings of the ACM International Conference on Computing Frontiers · doi:10.1145/2482767.2482797 · Cited by 166
Optimised simulated annealing for Ising spin glasses
Isakov, S., Zintchenko, I., Rønnow, T. F., & Troyer, M. (2014) · Computer Physics Communications · doi:10.1016/j.cpc.2015.02.015 · Cited by 164
Self-citationA scalable control system for a superconducting adiabatic quantum optimization processor
Johnson, M. W., Bunyk, P., Maibaum, F., Tolkacheva, E., Berkley, A. J., Chapple, E. M., Harris, R., Johansson, J., Lanting, T., Perminov, I., et al. (2010) · Superconductor Science and Technology · doi:10.1088/0953-2048/23/6/065004 · Cited by 162
Pomerance, C. B. (2009) · doi:10.1090/dol/034/15 · Cited by 154
Oversimplifying quantum factoring
Smolin, J. A., Smith, G., & Vargo, A. (2013) · Nature · doi:10.1038/nature12290 · Cited by 151
Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model
Martoňák, R., Santoro, G. E., & Tosatti, E. (2002) · Physical review. B, Condensed matter · doi:10.1103/physrevb.66.094203 · Cited by 140
Absence of an Almeida-Thouless Line in Three-Dimensional Spin Glasses
Young, A. P., & Katzgraber, H. G. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.207203 · Cited by 124
A scalable readout system for a superconducting adiabatic quantum optimization system
Berkley, A. J., Johnson, M. W., Bunyk, P., Harris, R., Johansson, J., Lanting, T. M., Ladizinsky, E., Tolkacheva, E., Amin, M. H. S., & Rose, G. (2010) · Superconductor Science and Technology · doi:10.1088/0953-2048/23/10/105014 · Cited by 112
Classical signature of quantum annealing
Smolin, J. A., & Smith, G. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00052 · Cited by 79
A fast algorithm for the Cyber 205 to simulate the 3D Ising model
Bhanot, G., Duke, D. W., & Salvador, R. (1986) · Journal of Statistical Physics · doi:10.1007/bf01011918 · Cited by 65
Max 2-SAT with up to 108 qubits
Santra, S., Quiroz, G., Steeg, G. V., & Lidar, D. A. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/4/045006 · Cited by 61
Self-citationMeasures of quantum computing speedup
Papageorgiou, A., & Traub, J. F. (2013) · Physical Review A · doi:10.1103/physreva.88.022316 · Cited by 28
Heuer, H.-O. (1990) · Computer Physics Communications · doi:10.1016/0010-4655(90)90186-5 · Cited by 26
Comment on: "Classical signature of quantum annealing"
Wang, L., Rønnow, T. F., Boixo, S., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1305.5837 · Cited by 23
Self-citationParallel speedup of sequential machines: a defense of parallel computation thesis
Parberry, I. (1986) · ACM SIGACT News · doi:10.1145/8312.8317 · Cited by 21
Research works printed but not linked: 8
- 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
- S. W. Shin G. Smith J. A. Smolin U. Vazirani http://arxiv.org/abs/1401.7087 (2014). · arXiv
- S. Isakov I. Zintchenko T. Rønnow M. Troyer http://arxiv.org/abs/1401.1084 (2014). · arXiv
- C. C. McGeoch C. Wang in Proceedings of the ACM Conference on Computing Frontiers (ACM New York 2013) pp. XX–XX.
- S. Santra G. Quiroz G. V. Steeg D. A. Lidar http://arxiv.org/abs/1307.3931 (2013). · arXiv
Cited by
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
“But 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].”
BackgroundBiamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
“This is known as a quantum speedup [106].”
Probing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460
“perconducting [13] and optical [14] systems, but these realizations lack either coherence or quantum nonlinearity, which are essential for achieving full quantum speedup.”
BackgroundAlbash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
“Moreover, its role in (Boixo et al., 2016; Denchev et al., 2016) is limited to a prefactor, and does not translate into a scaling advantage, i.e., it does not qualify as a speedup according to the classification of (Rønnow et al., 2014).”
BackgroundMethodSelf-citationSuperconducting 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
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.