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 101–200 of 604
Zero-temperature quantum annealing bottlenecks in the spin-glass phase
Knysh, S. (2016) · Nature Communications · doi:10.1038/ncomms12370 · Cited by 79
“Benchmarking of a hardware implementation of QA, courtesy of D-Wave Systems, shows no improvement in the scaling of the performance 13,14 .”
MethodSalathé, Y., Kurpiers, P., Karg, T. M., Lang, C., Andersen, C. K., Akın, A., Krinner, S., Eichler, C., & Wallraff, A. J. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.9.034011 · Cited by 103
Scaling and Diabatic Effects in Quantum Annealing with a D-Wave Device
Weinberg, P., Tylutki, M., Rönkkö, J. M., Westerholm, J., Åström, J. A., Manninen, P., Törmä, P., & Sandvik, A. W. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090502 · Cited by 77
Geometric quantum speed limits: a case for Wigner phase space
Deffner, S. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa83dc · Cited by 78
“However, the working principles of quantum computers and classical computers are fundamentally different, which makes it not immediately clear how to quantify the “quantum speed-up” [3].”
BackgroundBenchmarking a quantum annealing processor with the time-to-target metric
King, J., Yarkoni, S., Nevisi, M. M., Hilton, J. P., & McGeoch, C. C. (2015) · arXiv · doi:10.48550/arxiv.1508.05087 · Cited by 77
“[13] searched for “limited quantum speedup” by looking for differentiation in scaling trends between the performance of a D-Wave Vesuvius chip and the performance of a classical analog—a theoretical thermal annealer with free parallelism (i.”
BackgroundMethodInfluentialApplying quantum algorithms to constraint satisfaction problems
Campbell, E., Khurana, A., & Montanaro, A. (2019) · Quantum · doi:10.22331/q-2019-07-18-167 · Cited by 76
“[85]) or the quantum approximate optimisation algorithm [49].”
BackgroundNISQ Computers: A Path to Quantum Supremacy
AbuGhanem, M., & Eleuch, H. (2024) · IEEE Access · doi:10.1109/access.2024.3432330 · Cited by 116
“The computational performance of these algorithms has been examined both theoretically [188, 192–197] and experimentally [198–200], mostly in small quantum systems with shallow quantum circuits or systems lacking the presumed many-body coherence essential for achieving quantum advantage [201, 202].”
MethodDynamics of reverse annealing for the fully connected p -spin model
Yamashiro, Y., Ohkuwa, M., Nishimori, H., & Lidar, D. A. (2019) · Physical Review A · doi:10.1103/physreva.100.052321 · Cited by 93
Self-citationMultiple query optimization on the D-Wave 2X adiabatic quantum computer
Trummer, I., & Koch, C. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/2947618.2947621 · Cited by 75
A quantum annealing approach for fault detection and diagnosis of graph-based systems
Perdomo-Ortiz, A., Fluegemann, J., Narasimhan, S., Biswas, R., & Smelyanskiy, V. N. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02347-y · Cited by 75
“[15]; we believe it is related to calibration errors in the D-wave machine [37] that can go up to 5% in the specification of the programmable parameters, hi’s and Jij ’s.”
BackgroundInfluentialZhu, Z., Ochoa, A. J., Schnabel, S., Hamze, F., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.93.012317 · Cited by 76
“as well as uniform range-k disorder with k = 4 [21, 26]”
BackgroundRecent Progress in Quantum Simulation Using Superconducting Circuits
Paraoanu, G. S. (2014) · Journal of Low Temperature Physics · doi:10.1007/s10909-014-1175-8 · Cited by 87
A hybrid quantum–classical neural network with deep residual learning
Liang, Y., Peng, W., Zheng, Z., Sílven, O., & Zhao, G. (2021) · Neural Networks · doi:10.1016/j.neunet.2021.05.028 · Cited by 81
Synthetic Hilbert Space Engineering of Molecular Qudits: Isotopologue Chemistry
Wernsdorfer, W., & Ruben, M. (2019) · Advanced Materials · doi:10.1002/adma.201806687 · Cited by 80
Finding Maximum Cliques on the D-Wave Quantum Annealer
Chapuis, G., Djidjev, H., Hahn, G., & Rizk, G. (2019) · Journal of Signal Processing Systems · doi:10.1007/s11265-018-1357-8 · Cited by 70
Analog errors in quantum annealing: doom and hope
Pearson, A., Mishra, A., Hen, I., & Lidar, D. A. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0210-7 · Cited by 71
Self-citationTheory versus practice in annealing-based quantum computing
McGeoch, C. C. (2020) · Theoretical Computer Science · doi:10.1016/j.tcs.2020.01.024 · Cited by 83
Quantum computing for chemical and biomolecular product design
Andersson, M. P., Jones, M. N., Mikkelsen, K. V., You, F., & Mansouri, S. S. (2022) · Current Opinion in Chemical Engineering · doi:10.1016/j.coche.2021.100754 · Cited by 66
“Furthermore, it is currently believed that quantum computers cannot offer an exponential speedup to NP-complete and harder problems [41], although they can offer scaling advantages that have been known in the literature as ‘limited quantum speedup’ [41].”
BackgroundBlockchained Post-Quantum Signatures
Chalkias, K., Brown, J., Hearn, M., Lillehagen, T., Nitto, I., & Schroeter, T. (2018) · 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData) · doi:10.1109/cybermatics_2018.2018.00213 · Cited by 69
“tics [7]; however, there are reports that D-Wave’s quantum speedup analysis is debatable [8].”
BackgroundDeploying a quantum annealing processor to detect tree cover in aerial imagery of California
Boyda, E., Basu, S., Ganguly, S., Michaelis, A., Mukhopadhyay, S., & Nemani, R. (2017) · PLoS ONE · doi:10.1371/journal.pone.0172505 · Cited by 72
Unconstrained binary models of the travelling salesman problem variants for quantum optimization
Salehi, Ö., Glos, A., & Miszczak, J. A. (2022) · Quantum Information Processing · doi:10.1007/s11128-021-03405-5 · Cited by 96
“How to detect quantum speedup is a question of interest on its own [15], and various metrics have been proposed.”
BackgroundTemperature Scaling Law for Quantum Annealing Optimizers
Albash, T., Martin-Mayor, V., & Hen, I. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.110502 · Cited by 65
Geometric quantum speed limits: a case for Wigner phase space
Deffner, S. (2017) · Maryland Shared Open Access Repository (USMAI Consortium) · doi:10.13016/m2p9xl-fqvv · Cited by 65
Efficiency of quantum vs. classical annealing in nonconvex learning problems
Baldassi, C., & Zecchina, R. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1711456115 · Cited by 64
“More positive results have been found for ad hoc energy functions in which global minima are planted in such a way that tunneling cascades can become more efficient than thermal fluctuations (4, 15).”
BackgroundGenome assembly using quantum and quantum-inspired annealing
Boev, A. S., Rakitko, A. S., Usmanov, S. R., Kobzeva, A. N., Popov, I. V., Ilinsky, V. V., Kiktenko, E. O., & Fedorov, A. K. (2021) · Scientific Reports · doi:10.1038/s41598-021-88321-5 · Cited by 63
“One of the examples of available hardware for quantum annealing is the devices by D-Wave System [29–31]; however, their ability to demonstrate computation speed-up is still a subject of debates [31–36].”
MethodEngineering Reflective Metasurfaces With Ising Hamiltonian and Quantum Annealing
Ross, C., Gradoni, G., Lim, Q. J., & Peng, Z. (2021) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2021.3137424 · Cited by 71
“There are several attempts to compare performance of these classical heuristic solvers to quantum annealing algorithms [52]–[54].”
BackgroundA transmon quantum annealer: decomposing many-body Ising constraints into pair interactions
Leib, M., Zoller, P., & Lechner, W. (2016) · Quantum Science and Technology · doi:10.1088/2058-9565/1/1/015008 · Cited by 63
“Adiabatic quantum computing [5] has recently gained considerable attention because of the prospect to solve problems that can be mapped to classical optimizations [6, 7, 8, 9] efficiently [10, 11, 12, 13, 14, 15, 16].”
BackgroundTowards practical applications in quantum computational biology
Fedorov, A. K., & Gelfand, M. S. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00024-z · Cited by 62
Optimization Applications as Quantum Performance Benchmarks
Lubinski, T., Coffrin, C., McGeoch, C., Sathe, P., Apanavicius, J., Bernal Neira, D., & Quantum Economic Development Consortium(QED-C) Collaboration (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3678184 · Cited by 59
Readiness of Quantum Optimization Machines for Industrial Applications
Perdomo-Ortiz, A., Feldman, A., Ozaeta, A., Isakov, S. V., Zhu, Z., O’Gorman, B., Katzgraber, H. G., Diedrich, A., Neven, H., de Kleer, J., et al. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.014004 · Cited by 62
“This algorithm was also used in previous benchmark studies of the D-Wave devices [12, 13].”
BackgroundMethodResultInfluentialSelf-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
Unraveling Quantum Annealers using Classical Hardness
Martin-Mayor, V., & Hen, I. (2015) · Scientific Reports · doi:10.1038/srep15324 · Cited by 61
Quantum machine learning algorithms for anomaly detection: A review
Corli, S., Moro, L., Dragoni, D., Dispenza, M., & Prati, E. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.107632 · Cited by 106
Global Warming: Temperature Estimation in Annealers
Raymond, J., Yarkoni, S., & Andriyash, E. (2016) · Frontiers in ICT · doi:10.3389/fict.2016.00023 · Cited by 55
“54 is not too dissimilar to the value (β = 3) that had been previously used for optimization applications (Rønnow et al., 2014; Isakov et al., 2015; King et al., 2015).”
BackgroundMethodInfluentialDissipation in adiabatic quantum computers: lessons from an exactly solvable model
Keck, M., Montangero, S., Santoro, G. E., Fazio, R., & Rossini, D. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa8cef · Cited by 72
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
Quantum annealing of the p -spin model under inhomogeneous transverse field driving
Susa, Y., Yamashiro, Y., Yamamoto, M., Hen, I., Lidar, D. A., & Nishimori, H. (2018) · Physical Review A · doi:10.1103/physreva.98.042326 · Cited by 58
Self-citationUnraveling Quantum Annealers using Classical Hardness
Martín Mayor, V., & Hen, I. (2015) · Library Open Repository (Universidad Complutense Madrid) · Cited by 58
On Complexity of the Quantum Ising Model
Bravyi, S. B., & Hastings, M. B. (2016) · Communications in Mathematical Physics · doi:10.1007/s00220-016-2787-4 · Cited by 110
A Leap among Quantum Computing and Quantum Neural Networks: A Survey
Massoli, F. V., Vadicamo, L., Amato, G. M., & Falchi, F. (2022) · ACM Computing Surveys · doi:10.1145/3529756 · Cited by 94
“Theoretical aspects of ML using quantum computers are also discussed in Reference [15].”
MethodInfluentialDemonstration of Algorithmic Quantum Speedup
Pokharel, B., & Lidar, D. A. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.210602 · Cited by 80
“However, this argument is insufficient for establishing a quantum speedup, which must be based on the scaling with n of a time-based metric such as the TTS [6] or related metrics [58–60].”
BackgroundMethodSelf-citationWang, Z., & Wang, X. (2025) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.70073 · Cited by 57
“…method for finding the ground state of an Ising model; however, current annealers are limited to QUBO or Ising formulations and often produce non-unique, low-energy solutions due to quantum fluctuations and thermal noise, which reduces modeling flexibility and solution reliability [40, 41].”
Self-citationEfficient Quantum Walk Circuits for Metropolis-Hastings Algorithm
Lemieux, J., Heim, B., Poulin, D., Svore, K., & Troyer, M. (2020) · Quantum · doi:10.22331/q-2020-06-29-287 · Cited by 53
“We first recall the concept of total time to solution [24] which we use to benchmark and compare different heuristics.”
MethodSelf-citationBoundaries of quantum supremacy via random circuit sampling
Zlokapa, A., Villalonga, B., Boixo, S., & Lidar, D. A. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00703-x · Cited by 50
“[56] Troels F.”
BackgroundSelf-citationBoundaries of quantum supremacy via random circuit sampling
Zlokapa, A., Boixo, S., & Lidar, D. (2020) · arXiv · doi:10.48550/arxiv.2005.02464 · Cited by 55
Self-citationProgrammable Quantum Annealing Architectures with Ising Quantum Wires
Qiu, X., Zoller, P., & Li, X. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020311 · Cited by 62
Advances in quantum machine learning
Adcock, J. C., Allen, E. J., Day, M., Frick, S., Hinchliff, J. J., Johnson, M., Morley-Short, S., Pallister, S., Price, A. B., & Stanisic, S. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.02900 · Cited by 33
A quantum annealer with fully programmable all-to-all coupling via Floquet engineering
Onodera, T., Ng, E., & McMahon, P. L. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0279-z · Cited by 61
3-regular three-XORSAT planted solutions benchmark of classical and quantum heuristic optimizers
Kowalsky, M., Albash, T., Hen, I., & Lidar, D. A. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac4d1b · Cited by 78
“This optimization is essential for avoiding the trap of feigned scaling [21], and without it an extracted scaling exponent can only be trusted as a lower bound on the true value [22].”
Self-citationBenchmarking Neural Networks For Quantum Computations
Nguyen, N. H., Behrman, E., Moustafa, M. A., & Steck, J. E. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2933394 · Cited by 67
“Other researchers have found a quantum advantage to be “elusive” [6].”
BackgroundScaling analysis and instantons for thermally assisted tunneling and quantum Monte Carlo simulations
Jiang, Z., Smelyanskiy, V. N., Isakov, S. V., Boixo, S., Mazzola, G., Troyer, M., & Neven, H. (2017) · Physical Review A · doi:10.1103/physreva.95.012322 · Cited by 49
Self-citationQuantum versus classical generative modelling in finance
Coyle, B., Henderson, M., Le, J. C. J., Kumar, N., Paini, M., & Kashefi, E. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abd3db · Cited by 87
Challenges of variational quantum optimization with measurement shot noise
Scriva, G., Astrakhantsev, N., Pilati, S., & Mazzola, G. (2024) · Physical Review A · doi:10.1103/physreva.109.032408 · Cited by 81
“This procedure is standard in benchmarking quantum devices, such as quantum annealers, versus classical optimizers [6, 7, 9].”
BackgroundInfluentialNon-stoquastic Hamiltonians in quantum annealing via geometric phases
Vinci, W., & Lidar, D. A. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0037-z · Cited by 48
Self-citationImproving quantum annealing of the ferromagnetic p -spin model through pausing
Passarelli, G., Cataudella, V., & Lucignano, P. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.024302 · Cited by 52
Building an iterative heuristic solver for a quantum annealer
Rosenberg, G., Vazifeh, M., Woods, B., & Haber, E. (2016) · Computational Optimization and Applications · doi:10.1007/s10589-016-9844-y · Cited by 49
Maximum-Entropy Inference with a Programmable Annealer
Chancellor, N., Szoke, S., Vinci, W., Aeppli, G., & Warburton, P. A. (2016) · Scientific Reports · doi:10.1038/srep22318 · Cited by 46
“The facts that the D-Wave chip operates at finite temperature and that the dynamics at the end of the annealing process are fully classical have led to a debate about the extent to which quantum mechanics plays any role in its computational output [36, 37, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52].”
Stabilizers as a design tool for new forms of the Lechner-Hauke-Zoller annealer
Rocchetto, A., Benjamin, S. C., & Li, Y. (2016) · Science Advances · doi:10.1126/sciadv.1601246 · Cited by 47
An Ising Computer Based on Simulated Quantum Annealing by Path Integral Monte Carlo Method
Okuyama, T., Hayashi, M., & Yamaoka, M. (2017) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2017.8123652 · Cited by 57
“and the total time to obtain the solution whose accuracy is equal to or greater than q is formulated as follows [19].”
BackgroundUncertain fate of fair sampling in quantum annealing
Könz, M. S., Mazzola, G., Ochoa, A. J., Katzgraber, H. G., & Troyer, M. (2019) · Physical Review A · doi:10.1103/physreva.100.030303 · Cited by 69
Self-citationJiang, J., & Chu, C.-W. (2023) · IEEE Access · doi:10.1109/access.2023.3318206 · Cited by 66
“However, as mentioned in [26], there are ongoing scientific debates [27], [28], [29], [30] arguing whether quantum annealers can provide better problem solving capabilities than classical computers.”
BackgroundQubit-efficient encoding schemes for binary optimisation problems
Tan, B., Lemonde, M.-A., Thanasilp, S., Tangpanitanon, J., & Angelakis, D. G. (2021) · Quantum · doi:10.22331/q-2021-05-04-454 · Cited by 68
“While a formal proof of any quantum advantages these algorithms might bring has yet to be found [43], applications of NISQ devices to real-world problems are already being explored in chemistry [32] and unconstrained binary optimisation (QUBO) problems [18].”
BackgroundQuantum processor-inspired machine learning in the biomedical sciences
Li, R. Y., Gujja, S., Bajaj, S. R., Gamel, O., Cilfone, N. A., Gulcher, J. R., Lidar, D. A., & Chittenden, T. W. (2021) · Patterns · doi:10.1016/j.patter.2021.100246 · Cited by 57
Self-citationQuantum annealing for the number-partitioning problem using a tunable spin glass of ions
Graß, T., Raventós, D., Juliá-Díaz, B., Gogolin, C., & Lewenstein, M. (2016) · Nature Communications · doi:10.1038/ncomms11524 · Cited by 54
“The ionic system may be used to benchmark quantum annealing, which has become a subject of very lively and controversial debate since the launch of the D-Wave computers [7, 8].”
BackgroundPredicting quantum advantage by quantum walk with convolutional neural networks
Melnikov, A. A., Fedichkin, L. E., & Alodjants, A. P. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab5c5e · Cited by 57
Determination and correction of persistent biases in quantum annealers
Perdomo-Ortiz, A., O’Gorman, B., Fluegemann, J., Biswas, R., & Smelyanskiy, V. N. (2016) · Scientific Reports · doi:10.1038/srep18628 · Cited by 43
Thermalization, Freeze-out, and Noise: Deciphering Experimental Quantum Annealers
Marshall, J., Rieffel, E. G., & Hen, I. (2017) · Physical Review Applied · doi:10.1103/physrevapplied.8.064025 · Cited by 55
“This knowledge circumvents the need to verify the ground state energy using exact (provable) solvers, which rapidly become too expensive computationally as the number of variables grows, and which were employed in earlier benchmarking studies [33, 34].”
MethodAdame, J. I., & McMahon, P. L. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab935a · Cited by 42
“[22, 23], and we present results from experiments performed on the D-Wave 2000Q (DW2000Q) QA [24] hosted at NASA Ames in which we show how this AO strategy improves the performance of the annealer across a range of benchmark problems that have previously been studied in the quantum-annealing literature [5, 7, 9, 25, 2…”
BackgroundMethodQuantum Computation in Robotic Science and Applications
Petschnigg, C., Brandstötter, M., Pichler, H., Hofbaur, M., & Dieber, B. (2019) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2019.8793768 · Cited by 52
“More interesting are exponentially growing problems where classical computers fail and, moreover, those that can be directly described by the combination of quantum gates [17].”
BackgroundTraining an Ising machine with equilibrium propagation
Laydevant, J., Marković, D., & Grollier, J. (2024) · Nature Communications · doi:10.1038/s41467-024-46879-4 · Cited by 87
Enhancing quantum annealing performance for the molecular similarity problem
Hernandez, M., & Aramon, M. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1586-y · Cited by 43
“[38], it was suggested that the annealing time must be optimized for each problem size.”
BackgroundExperimental characterization of the energetics of quantum logic gates
Cimini, V., Gherardini, S., Barbieri, M., Gianani, I., Sbroscia, M., Buffoni, L., Paternostro, M., & Caruso, F. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00325-7 · Cited by 50
“reproducible manner [1, 3], little work has been devoted to the characterization of the energetic footprint of such potentially disruptive quantum technologies [6].”
BackgroundWhy and When Pausing is Beneficial in Quantum Annealing
Chen, H., & Lidar, D. A. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.014100 · Cited by 48
“[5] Troels F.”
BackgroundSelf-citationQuantum Speedup for Aeroscience and Engineering
Givi, P., Daley, A. J., Mavriplis, D. J., & Malik, M. R. (2020) · AIAA Journal · doi:10.2514/1.j059183 · Cited by 56
On the emerging potential of quantum annealing hardware for combinatorial optimization
Tasseff, B., Albash, T., Morrell, Z., Vuffray, M., Lokhov, A. Y., Misra, S., & Coffrin, C. (2024) · Journal of Heuristics · doi:10.1007/s10732-024-09530-5 · Cited by 42
From near to eternity: Spin-glass planting, tiling puzzles, and constraint-satisfaction problems
Hamze, F., Jacob, D. C., Ochoa, A. J., Perera, D., Wang, W., & Katzgraber, H. G. (2018) · Physical review. E · doi:10.1103/physreve.97.043303 · Cited by 55
NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
Au-Yeung, R., Chancellor, N., & Halffmann, P. (2023) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2023.1128576 · Cited by 74
“Only with more thorough benchmarking can we accurately assess the capabilities and speed-ups of quantum computers [77].”
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
“QC[2], a computational paradigm based on the postulates and laws of quantum mechanics, has proved the potential to reach an exponential algorithmic speedup with respect to classical computation under certain assumptions [3], [4].”
BackgroundFujii, K., & Nakajima, K. (2021) · Natural computing series · doi:10.1007/978-981-13-1687-6_18 · Cited by 107
Quantum-enhanced greedy combinatorial optimization solver
Dupont, M., Evert, B., Hodson, M. J., Sundar, B., Jeffrey, S., Yamaguchi, Y., Feng, D., Maciejewski, F. B., Hadfield, S., Alam, M. S., et al. (2023) · Science Advances · doi:10.1126/sciadv.adi0487 · Cited by 77
Self-citationHibat-Allah, M., Mauri, M., Carrasquilla, J., & Perdomo‐Ortiz, A. (2024) · Communications Physics · doi:10.1038/s42005-024-01552-6 · Cited by 73
“[32] is that, for the PQA case, we do not require a scaling advantage as a function of the problem size.”
An approach to quantum-computational hydrologic inverse analysis
O’Malley, D. (2018) · Scientific Reports · doi:10.1038/s41598-018-25206-0 · Cited by 40
Charged particle tracking with quantum annealing optimization
Zlokapa, A., Anand, A., Vlimant, J.-R., Duarte, J. M., Job, J., Lidar, D. A., & Spiropulu, M. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00054-w · Cited by 54
“To test the effect of the annealing time (which in principle must be optimized in order to extract the true time to solution (Albash and Lidar 2018; Rønnow et al. 2014)), we compare runs from 5 to 800 μs.”
BackgroundMethodInfluentialSelf-citationEmbedding Overhead Scaling of Optimization Problems in Quantum Annealing
Könz, M. S., Lechner, W., Katzgraber, H. G., & Troyer, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040322 · Cited by 67
“While this space overhead (which, incidentally, can sometimes be used for error-correction schemes [4, 19]) has been well studied, here we demonstrate that there is an even more significant time overhead in time to solution [8, 24].”
BackgroundMethodSelf-citationConstructing SAT Filters with a Quantum Annealer
Douglass, A., King, A. D., & Raymond, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24318-4_9 · Cited by 57
“To this point, finding such instances has been a challenge [15,31,35].”
BackgroundBetter-than-classical Grover search via quantum error detection and suppression
Pokharel, B., & Lidar, D. A. (2024) · npj Quantum Information · doi:10.1038/s41534-023-00794-6 · Cited by 65
Self-citationQuantum interval neural network for uncertain structural static analysis
Zhu, J., Wang, X., Cao, G., Xu, L., & Cao, Y. H. (2025) · International Journal of Mechanical Sciences · doi:10.1016/j.ijmecsci.2025.110646 · Cited by 52
Quantum-assisted associative adversarial network: applying quantum annealing in deep learning
Wilson, M., Vandal, T., Hogg, T., & Rieffel, E. G. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00047-9 · Cited by 52
Chaos in spin glasses revealed through thermal boundary conditions
Wang, W., Machta, J. L., & Katzgraber, H. G. (2015) · Physical Review B · doi:10.1103/physrevb.92.094410 · Cited by 43
“[39–44]).”
Heavy Tails in the Distribution of Time to Solution for Classical and Quantum Annealing
Steiger, D. S., Rønnow, T. F., & Troyer, M. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.230501 · Cited by 39
Self-citationAn FPGA-Based Quantum Computing Emulation Framework Based on Serial-Parallel Architecture
Lee, Y. H., Khalil-Hani, M., & Marsono, M. N. (2016) · International Journal of Reconfigurable Computing · doi:10.1155/2016/5718124 · Cited by 45
Solving the optimal trading trajectory problem using a quantum annealer
Rosenberg, G., Haghnegahdar, P., Goddard, P., Carr, P., Wu, K. J., & de Prado, M. L. (2015) · High Performance Computational Finance · doi:10.1145/2830556.2830563 · Cited by 52
“There is an ongoing debate on how to define quantum speedup, and on which problems a noisy quantum annealer would be expected to show such a speedup [30]–[32].”
Performance of two different quantum annealing correction codes
Mishra, A., Albash, T., & Lidar, D. A. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1201-z · Cited by 36
Self-citationKarimi, H., Rosenberg, G., & Katzgraber, H. G. (2017) · Physical Review E · doi:10.1103/physreve.96.043312 · Cited by 37
Efficient verification of boson sampling
Chabaud, U., Grosshans, F., Kashefi, E., & Markham, D. (2021) · Quantum · doi:10.22331/q-2021-11-15-578 · Cited by 37
“The ability of quantum computers to greatly outperform their classical counterparts is referred to as “quantum computational supremacy” [6, 7], or quantum speedup [8].”
BackgroundMean Field Analysis of Quantum Annealing Correction
Matsuura, S., Nishimori, H., Albash, T., & Lidar, D. A. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.220501 · Cited by 48
Self-citationMonte Carlo simulation of stoquastic Hamiltonians
Bravyi, S. B. (2015) · Quantum Information and Computation · doi:10.26421/qic15.13-14-3 · Cited by 104
The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again)
Mandrà, S., Katzgraber, H. G., & Thomas, C. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa7877 · Cited by 35
“As such, it is desirable to find classes of problems for benchmarking that ideally use the complete set of variables on the chip, while not being a trivial optimization problem [1].”
BackgroundSatpathy, S. K., Vibhu, V., Behera, B. K., Al-Kuwari, S. M., Mumtaz, S., & Farouk, A. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3300577 · Cited by 40
“Indeed, quantum algorithms can solve some problems with lower time complexity than classical algorithms [2], [3], which have been realized by several quantum supremacies [4] (the demonstration of quantum computers solving problems that no classical computers can perform in a feasible time).”
BackgroundScaling Advantage in Approximate Optimization with Quantum Annealing
Munoz-Bauza, H., & Lidar, D. A. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.160601 · Cited by 97
“99) log(1 − p ) is the expected number of runs [8].”
InfluentialSelf-citation
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.