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 201–300 of 604
Boosting quantum annealer performance via sample persistence
Karimi, H., & Rosenberg, G. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1615-x · Cited by 28
“For this reason, there has been much recent interest in benchmarking quantum annealers against classical solvers, although conclusive evidence of quantum speedup has not been shown to date [13, 6, 14, 15, 16, 7, 17, 18, 19, 20].”
BackgroundJob, J., & Lidar, D. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aabd9b · Cited by 34
Self-citationThe Power of Adiabatic Quantum Computation with No Sign Problem
Hastings, M. B. (2021) · Quantum · doi:10.22331/q-2021-12-06-597 · Cited by 63
Probing entanglement in adiabatic quantum optimization with trapped ions
Hauke, P., Bonnes, L., Heyl, M., & Lechner, W. (2015) · Frontiers in Physics · doi:10.3389/fphy.2015.00021 · Cited by 34
“Note that the goal of this paper is not to suggest a scalable quantum-annealing device that could compete with system sizes of a D-wave machine [30],”
BackgroundQuantum versus simulated annealing in wireless interference network optimization
Wang, C., Chen, H., & JONCKHEERE, E. A. (2016) · Scientific Reports · doi:10.1038/srep25797 · Cited by 43
Relaxation versus adiabatic quantum steady-state preparation
Venuti, L. C., Albash, T., Marvian, M., Lidar, D. A., & Zanardi, P. (2017) · Physical Review A · doi:10.1103/physreva.95.042302 · Cited by 35
Self-citationQuantum annealing for systems of polynomial equations
Chang, C. C., Gambhir, A. S., Humble, T. S., & Sota, S. (2019) · Scientific Reports · doi:10.1038/s41598-019-46729-0 · Cited by 57
From classical to quantum non-equilibrium dynamics of Rydberg excitations in optical lattices
Mattioli, M., Glaetzle, A. W., & Lechner, W. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/11/113039 · Cited by 39
Algorithm for the solution of the Dirac equation on digital quantum computers
Fillion-Gourdeau, F., MacLean, S., & Laflamme, R. (2017) · Physical Review A · doi:10.1103/physreva.95.042343 · Cited by 33
A Review of Ising Machines Implemented in Conventional and Emerging Technologies
Zhang, T., Tao, Q., Liu, B., Grimaldi, A., Raimondo, E., Jiménez, M., Avedillo, M. J., Núñez, J., Linares-Barranco, B., Serrano‐Gotarredona, T., et al. (2024) · IEEE Transactions on Nanotechnology · doi:10.1109/tnano.2024.3457533 · Cited by 47
From local to global ground states in Ising spin glasses
Zintchenko, I., Hastings, M. B., & Troyer, M. (2015) · Physical Review B · doi:10.1103/physrevb.91.024201 · Cited by 37
Self-citationWang, W., Machta, J. L., & Katzgraber, H. G. (2014) · Physical Review B · doi:10.1103/physrevb.90.184412 · Cited by 37
“To resolve this controversy, the three-dimensional EdwardsAnderson Ising spin glass in thermal boundary conditions is studied numerically using population annealing Monte Carlo.”
Practical engineering of hard spin-glass instances
Marshall, J., Martin-Mayor, V., & Hen, I. (2016) · Physical Review A · doi:10.1103/physreva.94.012320 · Cited by 32
“, in the DW case, running over several different gauges [15]).”
BackgroundInfluentialPassarelli, G., Filippis, G. D., Cataudella, V., & Lucignano, P. (2018) · Physical Review A · doi:10.1103/physreva.97.022319 · Cited by 35
Large-Scale Simulation of Shor’s Quantum Factoring Algorithm
Willsch, D., Willsch, M., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2023) · Mathematics · doi:10.3390/math11194222 · Cited by 50
“5 [12] 6 [15] 7 [18] 8 [21] 9 [24] 10 [27] 11 [30] 12 [33] 13 [36] 14 [39] 15 [42] 16 [45] 17 [48] 18 [51] 19 [54] 20 [57] 21 [60] 22 [63] 23 [66] 24 [69] 25 [72] 26 [75] 27 [78] 28 [81] 29 [84] Number of qubits n required for iterative Shor [conventional Shor] 0 % 25 % 50 % 75 % 100 %”
BackgroundEigenstate tracking in open quantum systems
Jing, J., Sarandy, M. S., Lidar, D. A., Luo, D.-W., & Wu, L.-A. (2016) · Physical Review A · doi:10.1103/physreva.94.042131 · Cited by 31
Self-citationAssessing the quantumness of a damped two-level system
Friedenberger, A., & Lutz, E. (2017) · Physical Review A · doi:10.1103/physreva.95.022101 · Cited by 32
High-Quality Thermal Gibbs Sampling with Quantum Annealing Hardware
Nelson, J., Vuffray, M., Lokhov, A. Y., Albash, T., & Coffrin, C. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.044046 · Cited by 51
“Using gauge transformations is a well-known technique for eliminating these field biases, which can add additional unwanted asymmetries [17, 56, 57].”
Finding Maximum Cliques on a Quantum Annealer
Chapuis, G., Djidjev, H. N., Hahn, G., & Rizk, G. (2017) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/3075564.3075575 · Cited by 39
“However, it is unclear if this potential is realized by the current quantum computing technology, and by the DW computer in particular, and whether DW provides any quantum advantage over the best available classical algorithms [6, 14].”
BackgroundAnalog nature of quantum adiabatic unstructured search
Slutskii, M., Albash, T., Barash, L., & Hen, I. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab51f9 · Cited by 31
Accelerated quantum Monte Carlo with probabilistic computers
Chowdhury, S., Camsari, K. Y., & Datta, S. (2023) · Communications Physics · doi:10.1038/s42005-023-01202-3 · Cited by 40
“In such cases, appropriate care must be taken when comparing the performance of specialized hardware with CPU performance which is usually utilized fully (see [58] for example).”
BackgroundSolving the resource constrained project scheduling problem with quantum annealing
Armas, L. F. P., Creemers, S., & Deleplanque, S. (2024) · Scientific Reports · doi:10.1038/s41598-024-67168-6 · Cited by 53
“Notable among these is “Time-to-Solution” 70 (TTS), which centers on the total time required for a solver to identify a ground state (optimal solution) with a sufficiently high probability.”
BackgroundStability of the quantum Sherrington-Kirkpatrick spin glass model
Young, A. P. (2017) · Physical review. E · doi:10.1103/physreve.96.032112 · Cited by 40
Wishart planted ensemble: A tunably rugged pairwise Ising model with a first-order phase transition
Hamze, F., Raymond, J., Pattison, C. A., Biswas, K., & Katzgraber, H. G. (2020) · Physical review. E · doi:10.1103/physreve.101.052102 · Cited by 36
“Often, it is faster to carry out many short attempts taking run time R with a lower success probability p(R, {φ}) which motivates the definition [79–81]”
BackgroundMethodAn Application of Quantum Annealing Computing to Seismic Inversion
Souza, A. M., Martins, E. O., Roditi, I., Sá, N., Sarthour, R. S., & Oliveira, I. S. (2022) · Frontiers in Physics · doi:10.3389/fphy.2021.748285 · Cited by 38
“Here, it is also important to mention that the advantage of quantum annealers over classical methods is still under debate [18–28].”
BackgroundComparative study of the performance of quantum annealing and simulated annealing
Nishimori, H., Tsuda, J., & Knysh, S. (2015) · Physical Review E · doi:10.1103/physreve.91.012104 · Cited by 40
Benchmarking Digital Quantum Simulations Above Hundreds of Qubits Using Quantum Critical Dynamics
Miessen, A., Egger, D. J., Tavernelli, I., & Mazzola, G. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040320 · Cited by 75
“This effect has been observed in classical path-integral simulations of QA, where an unconverged, finite Trotter step is benefi-cial for tunneling between configurations [52], reconciling earlier expectations of quantum speedup [96] with observations [88].”
Number Partitioning With Grover’s Algorithm in Central Spin Systems
Anikeeva, G., Marković, O., Borish, V., Hines, J., Rajagopal, S., Cooper, E. S., Periwal, A., Safavi‐Naeini, A. H., Davis, E. J., & Schleier-Smith, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020319 · Cited by 37
“[51] by comparing the quantum search with an algorithmically similar classical search.”
ResultYarkoni, S., Plaat, A., & Bäck, T. (2018) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2018.8477865 · Cited by 37
“It is conjectured that, should D-Wave QPUs provide a computational speedup, this may be extended to many important and well-known applications [15], [16].”
BackgroundA Performance Estimator for Quantum Annealers: Gauge selection and Parameter SettingPreprint
Perdomo‐Ortiz, A., Fluegemann, J., Biswas, R., & Smelyanskiy, V. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.01083 · Cited by 46
“To illustrate the procedure, we used a hard-instance out of a pool of random-spin glass instances similar to the ones re-ported elsewhere [10].”
BackgroundMethodInfluentialPelofske, E. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adb029 · Cited by 61
Limitations of error corrected quantum annealing in improving the performance of Boltzmann machines
Li, R. Y., Albash, T., & Lidar, D. A. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab9aab · Cited by 36
“[9] Troels F.”
MethodSelf-citationDegeneracy, degree, and heavy tails in quantum annealing
King, A. D., Hoskinson, E., Lanting, T., Andriyash, E., & Amin, M. H. (2016) · Physical Review A · doi:10.1103/physreva.93.052320 · Cited by 28
Direct comparison of quantum and simulated annealing on a fully connected Ising ferromagnet
Wauters, M. M., Fazio, R., Nishimori, H., & Santoro, G. E. (2017) · Physical Review A · doi:10.1103/physreva.96.022326 · Cited by 34
Simulated-quantum-annealing comparison between all-to-all connectivity schemes
Albash, T., Vinci, W., & Lidar, D. A. (2016) · Physical Review A · doi:10.1103/physreva.94.022327 · Cited by 33
“The observation that such models can also be solved via quantum annealing [3–5] has spurred a great deal of recent interest in building special-purpose analog quantum devices [6, 7] with the hope of realizing quantum speedups [8].”
BackgroundSelf-citationAn investigation of IBM quantum computing device performance on combinatorial optimisation problems
Khumalo, M. T., Chieza, H. A., Prag, K., & Woolway, M. (2022) · Neural Computing and Applications · doi:10.1007/s00521-022-07438-4 · Cited by 47
“A basic search algorithm for optimisation problems has complexity O(2n) on a classical computer while a quantum search algorithm for an NP-Complete problem reduces this to complexity O(√n) [24,38,43].”
An integrated programming and development environment for adiabatic quantum optimization
Humble, T. S., McCaskey, A., Bennink, R. S., Billings, J. J., D'Azevedo, E. F., Sullivan, B. D., Klymko, C., & Seddiqi, H. (2014) · Computational Science & Discovery · doi:10.1088/1749-4680/7/1/015006 · Cited by 30
Optimally Stopped Optimization
Vinci, W., & Lidar, D. A. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.6.054016 · Cited by 27
“Remarkably, these prototype devices achieve a level of performance that is already comparable to modern CPUs [22, 27, 28], despite several decades of continuous technological improvements in classical computation.”
BackgroundInfluentialSelf-citationToward Prediction of Financial Crashes with a D-Wave Quantum Annealer
Ding, Y., Gonzalez-Conde, J., Lamata, L., Martín‐Guerrero, J. D., Lizaso, E., Mugel, S., Chen, X., Orús, R., Solano, E., & Sanz, M. (2023) · Entropy · doi:10.3390/e25020323 · Cited by 46
Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem
Wang, H., & Wu, L.-A. (2016) · Scientific Reports · doi:10.1038/srep22307 · Cited by 30
“ U k e e e ( ) (14) iH k iH iH ( ) (2 ) ( ) k 0 0 2 0 1”
BackgroundBenchmarking Adiabatic Quantum Optimization for Complex Network Analysis
Sandia National Laboratories (SNL), A., Parekh, O., Administration, U. A. S. F. H. R. A., Wendt, J., Shulenburger, L., Landahl, A. J., Moussa, J. E., & Aidun, J. B. (2015) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/1459086 · Cited by 33
“classical heuristics that perform at least as well as D-Wave on the types of instances used by McGeoch and Wang ([19], [20], [25]; we observe this as well in Section 5.”
BackgroundMethodResultInfluentialQuantum annealing algorithm for fault section location in distribution networks
Bi, Z., Yang, X., Wang, B., Zhang, W., Dong, Z., & Zhang, D. (2023) · Applied Soft Computing · doi:10.1016/j.asoc.2023.110973 · Cited by 27
Hamiltonian quantum generative adversarial networks
Kim, L., Lloyd, S., & Marvian, M. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033019 · Cited by 32
SoK: Benchmarking the Performance of a Quantum Computer
Wang, J., Guo, G., & Shan, Z. (2022) · Entropy · doi:10.3390/e24101467 · Cited by 41
“Usually, the quantum speed-up refers to comparing the best available classical algorithm, but not the best possible classical algorithm [44].”
BackgroundGuest Column: Adiabatic Quantum Computing Challenges
Calude, C. S., Calude, E., & Dinneen, M. J. (2015) · ACM SIGACT News · doi:10.1145/2744447.2744459 · Cited by 30
“The questions about whether D-Wave machines perform quantum computation and allow a quantum speed-up have been heatedly debated [8, 53, 55].”
BackgroundParameter setting for quantum annealers
Pudenz, K. L. (2016) · 2016 IEEE High Performance Extreme Computing Conference (HPEC) · doi:10.1109/hpec.2016.7761619 · Cited by 24
“INTRODUCTION AND MOTIVATION At this point in the development of practical quantum annealing devices, there has been a great deal published regarding specialized benchmarking problems designed for existing hardware [1], [2], [3], [4], [5].”
BackgroundQuantum computation and simulation with superconducting qubits*
He, K., Geng, X., Huang, R., Liu, J., & Chen, W. (2021) · Chinese Physics B · doi:10.1088/1674-1056/ac16cf · Cited by 27
Potts model solver based on hybrid physical and digital architecture
Inaba, K., Inagaki, T., Igarashi, K., Utsunomiya, S., Honjo, T., Ikuta, T., Enbutsu, K., Umeki, T., Kasahara, R., Inoue, K., et al. (2022) · Communications Physics · doi:10.1038/s42005-022-00908-0 · Cited by 26
Quantum Robustness Verification: A Hybrid Quantum-Classical Neural Network Certification Algorithm
Franco, N., Wollschläger, T., Gao, N., Lorenz, J. M., & Günnemann, S. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00033 · Cited by 32
“Firstly, due to decoherence of qubits or thermal fluctuations, the discrepancy between quantum simulation and NISQ devices is a known issue impeding results and the ability to detect speed-ups [48, 49].”
Quantum Annealing with Markov Chain Monte Carlo Simulations and D-Wave Quantum Computers
Wang, Y., Wu, S., & Zou, J. (2016) · Statistical Science · doi:10.1214/16-sts560 · Cited by 29
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum AnnealingPreprint
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2018) · ResearchSpace (University of Auckland) · doi:10.48550/arxiv.1803.04340 · Cited by 24
“But performing benchmarks fairly is difficult, especially when there is often debate as to which classical algorithm should be taken for comparison [8–11].”
BackgroundInfluentialDe-Signing Hamiltonians for Quantum Adiabatic Optimization
Crosson, E., Albash, T., Hen, I., & Young, A. P. (2020) · Quantum · doi:10.22331/q-2020-09-24-334 · Cited by 34
“(iv) One may also consider quantum annealing algorithms which do not necessarily satisfy the adiabatic approximation, and for these we show by simulations of Schrödinger time-evolution up to n = 20 qubits that the time-to-solution metric [60] also favors stoquastic Hamiltonians.”
MethodResource estimate for quantum many-body ground-state preparation on a quantum computer
Lemieux, J., Duclos-Cianci, G., Sénéchal, D., & Poulin, D. (2021) · Physical Review A · doi:10.1103/physreva.103.052408 · Cited by 34
Undergraduate computational physics projects on quantum computing
Candela, D. (2015) · American Journal of Physics · doi:10.1119/1.4922296 · Cited by 23
Quantum optics and frontiers of physics: the third quantum revolution
Celi, A., Sanpera, A., Ahufinger, V., & Lewenstein, M. (2016) · Physica Scripta · doi:10.1088/1402-4896/92/1/013003 · Cited by 31
Ising Model Optimization Problems on a FPGA Accelerated Restricted Boltzmann MachinePreprint
Patel, S., Chen, L., Canoza, P., & Salahuddin, S. (2020) · Research Square · doi:10.21203/rs.3.rs-122016/v1 · Cited by 44
Computing architecture to perform approximated simulated annealing for Ising models
Okuyama, T., Yoshimura, C., Hayashi, M., & Yamaoka, M. (2016) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2016.7738673 · Cited by 26
Effects of setting temperatures in the parallel tempering Monte Carlo algorithm
Rozada, I., Aramon, M., Machta, J. L., & Katzgraber, H. G. (2019) · Physical review. E · doi:10.1103/physreve.100.043311 · Cited by 22
“We have used the time-to-solution (TTS) as a performance metric [29] to compare the temperature setting methods.”
MethodA survey of quantum computing hybrid applications with brain-computer interface
Huang, D., Wang, M., Wang, J., & Yan, J. (2022) · Cognitive Robotics · doi:10.1016/j.cogr.2022.07.002 · Cited by 32
Assessment of Quantum Annealing for the Construction of Satisfiability Filters
Azinović, M., Herr, D., Heim, B., Brown, E., & Troyer, M. (2017) · SciPost Physics · doi:10.21468/scipostphys.2.2.013 · Cited by 27
“[26] shows, previous expectations of quantum speedup for QA in two-dimensional spin glasses [23, 24] were due to performing SQA in the non-physical limit, which elegantly explains why such a speed-up could not be observed in experiments [28, 29].”
BackgroundSelf-citationHard combinatorial problems and minor embeddings on lattice graphs
Lucas, A. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2323-5 · Cited by 26
Quantum Machine Learning: Unraveling a New Paradigm in Computational IntelligencePreprint
Khurana, S., & Nene, M. J. (2024) · doi:10.22541/au.171037552.27623320/v1 · Cited by 37
Assessing Solution Quality of 3SAT on a Quantum Annealing Platform
Gabor, T., Zielinski, S., Feld, S., Roch, C., Seidel, C., Neukart, F., Galter, I., Mauerer, W., & Linnhoff-Popien, C. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-14082-3_3 · Cited by 21
How to test the “quantumness” of a quantum computer?
Zagoskin, A. M., Il’ichev, E. V., Grajcar, M., Betouras, J. J., & Nori, F. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00033 · Cited by 22
“…(439 qubits operational) device “D-Wave Two” outperforming at least some classical algorithms [13] and losing to some other classical algorithms [14]; (5) the May 2013 decision by NASA, Google and the Universities Space Research Association to purchase a “D-Wave Two” to be installed at their…”
BackgroundComputational hardness of spin-glass problems with tile-planted solutions
Perera, D., Hamze, F., Raymond, J., Weigel, M., & Katzgraber, H. G. (2020) · Physical review. E · doi:10.1103/physreve.101.023316 · Cited by 35
Nested quantum annealing correction at finite temperature: p -spin models
Matsuura, S., Nishimori, H., Vinci, W., & Lidar, D. A. (2019) · Physical Review A · doi:10.1103/physreva.99.062307 · Cited by 22
Self-citationSimple digital quantum algorithm for symmetric first-order linear hyperbolic systems
Fillion‐Gourdeau, F., & Lorin, E. (2018) · Numerical Algorithms · doi:10.1007/s11075-018-0639-3 · Cited by 26
Solving Set Cover with Pairs Problem using Quantum Annealing
Cao, Y., Jiang, S., Perouli, D., & Kais, S. (2016) · Scientific Reports · doi:10.1038/srep33957 · Cited by 27
“( ) , , ( ) (16) n i i c i c c i c i c t i”
Quantum adiabatic machine learning by zooming into a region of the energy surface
Zlokapa, A., Mott, A., Job, J., Vlimant, J.-R., Lidar, D. A., & Spiropulu, M. (2020) · Physical Review A · doi:10.1103/physreva.102.062405 · Cited by 28
Self-citationQuantum Science and Quantum Technology
Wang, Y., & Song, X. (2020) · Statistical Science · doi:10.1214/19-sts745 · Cited by 27
Computational quantum-classical boundary of noisy commuting quantum circuits
Fujii, K., & Tamate, S. (2016) · Scientific Reports · doi:10.1038/srep25598 · Cited by 37
“That is, for an arbitrary output ν, we have ν ν − < κ − P P ( post) ( ) 2 , (9) FT ideal where the overhead N = poly(n, κ) is polynomial both in the size n and the exponent κ > 0 of the logical error probability.”
BackgroundAdiabatic quantum optimization for associative memory recall
Seddiqi, H., & Humble, T. S. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00079 · Cited by 23
“Recent work to assess the scaling of the spectral gap that determines the minimum AQO annealing time has underscored that the relative height of energy barriers play a fundamental role in determining which Ising Hamiltonians are challenging [27–30].”
BackgroundSimulated quantum annealing of double-well and multiwell potentials
Inack, E. M., & Pilati, S. (2015) · Physical Review E · doi:10.1103/physreve.92.053304 · Cited by 27
Quantum annealing-aided design of an ultrathin-metamaterial optical diode
Kim, S., Park, S.-J., Moon, S., Zhang, Q., Hwang, S., Kim, S.-K., Luo, T., & Lee, E. (2024) · Nano Convergence · doi:10.1186/s40580-024-00425-6 · Cited by 20
Energy landscapes of combinatorial optimization in Ising machines
Dobrynin, D., Renaudineau, A., Hizzani, M., Strukov, D. B., Mohseni, M., & Strachan, J. P. (2024) · Physical review. E · doi:10.1103/physreve.110.045308 · Cited by 37
“Moreover, θ also depends on the algorithm hyperparameters and the problem size N [83].”
BackgroundMethodPractical Verification of Quantum Properties in Quantum-Approximate-Optimization Runs
Alam, M. S., Wudarski, F., Reagor, M. J., Sud, J., Grabbe, S. R., Wang, Z., Hodson, M. J., Lott, P. A., Rieffel, E. G., & Venturelli, D. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.024026 · Cited by 20
Self-citationComputational overhead of locality reduction in binary optimization problems
Valiante, E., Hernandez, M., Barzegar, A., & Katzgraber, H. G. (2021) · Computer Physics Communications · doi:10.1016/j.cpc.2021.108102 · Cited by 38
Sampei, H., Saegusa, K., Chishima, K., Higo, T., Tanaka, S., Yayama, Y., Makoto, N., Kimura, K., & Sekine, Y. (2023) · JACS Au · doi:10.1021/jacsau.3c00018 · Cited by 30
A Fast Quantum Algorithm for Searching the Quasi-Optimal Solutions of Unit Commitment
Zheng, X., Wang, J., & Yue, M. (2024) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2024.3350382 · Cited by 19
“Therefore, the “limited quantum speedup” is achieved [17].”
BackgroundError reduction in quantum annealing using boundary cancellation: Only the end matters
Venuti, L. C., & Lidar, D. A. (2018) · Physical Review A · doi:10.1103/physreva.98.022315 · Cited by 20
Self-citationContinuous quantum error correction for evolution under time-dependent Hamiltonians
Atalaya, J., Zhang, S., Niu, M. Y., Babakhani, A., Chan, C. H. H., Epstein, J. M., & Whaley, K. B. (2021) · Physical Review A · doi:10.1103/physreva.103.042406 · Cited by 26
“[58] T.”
Ferromagnetically Shifting the Power of Pausing
Izquierdo, Z. G., Grabbe, S. R., Hadfield, S., Marshall, J., Wang, Z., & Rieffel, E. G. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.044013 · Cited by 26
“The shortest time allowed by D-Wave, ta = 1 μs, was found to be optimal in terms of TTS for the instance ensembles, agreeing with previous studies for other problems [12, 15, 16].”
ResultSelf-citationSchauß, P. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.09014 · Cited by 27
Coherence in the Ferroelectric A3ClO (A = Li, Na) Family of Electrolytes
Braga, M. H. (2021) · Materials · doi:10.3390/ma14092398 · Cited by 18
Jia, K., Meng, F., & Liang, J. (2024) · Information Sciences · doi:10.1016/j.ins.2024.121543 · Cited by 23
Gyöngyösi, L., & Imre, S. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0006 · Cited by 40
Fast quantum methods for optimization
Boixo, S., Ortíz, G., & Somma, R. D. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02341-5 · Cited by 29
Self-citationUnderstanding quantum tunneling using diffusion Monte Carlo simulations
Inack, E. M., Giudici, G., Parolini, T., Santoro, G. E., & Pilati, S. (2018) · Physical Review A · doi:10.1103/physreva.97.032307 · Cited by 19
Error suppression in adiabatic quantum computing with qubit ensembles
Mohseni, N., Narożniak, M., Pyrkov, A. N., Ivannikov, V., Dowling, J. P., & Byrnes, T. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00405-2 · Cited by 20
High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder
Gao, N., Wilson, M., Vandal, T., Vinci, W., Nemani, R., & Rieffel, E. G. (2020) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3394486.3403138 · Cited by 22
Quantum annealing – foundations and frontiers
Cohen, E., & Tamir, B. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02345-1 · Cited by 20
Fair sampling of ground-state configurations of binary optimization problems
Zhu, Z., Ochoa, A. J., & Katzgraber, H. G. (2019) · Physical Review E · doi:10.1103/physreve.99.063314 · Cited by 17
Guiding Principle for Minor-Embedding in Simulated-Annealing-Based Ising Machines
Shirai, T., Tanaka, S., & Togawa, N. (2020) · IEEE Access · doi:10.1109/access.2020.3040017 · Cited by 20
Efficient low temperature Monte Carlo sampling using quantum annealing
Sandt, R., & Spatschek, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-33828-2 · Cited by 21
Lami, G., Torta, P., Santoro, G. E., & Collura, M. (2023) · SciPost Physics · doi:10.21468/scipostphys.14.5.117 · Cited by 29
“In fact, the quest for quantum speed-ups [16, 17] and the real effectiveness of quantum optimization algorithms should ultimately be tested on real scalable quantum devices, beyond the reach of classical simulations by means of Exact Diagonalization (ED) techniques.”
BackgroundYu, G., Wu, C., Liu, Y., Du, Z., Zhao, N., Jiao, Y., Xu, Z., & Shi, W. (2023) · Science China Earth Sciences · doi:10.1007/s11430-022-1144-7 · Cited by 20
Quantum computers, quantum computing, and quantum thermodynamics
Cleri, F. (2024) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2024.1422257 · Cited by 26
Improving performance of logical qubits by parameter tuning and topology compensation
Raymond, J., Ndiaye, N., Rayaprolu, G., & King, A. D. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00044 · Cited by 30
Mandrà, S., Guerreschi, G. G., & Aspuru‐Guzik, A. (2015) · Physical Review A · doi:10.1103/physreva.92.062320 · Cited by 19
“However, it may be possible that a larger probability of success is achieved if the adiabatic quantum optimizer is used for a shorter evolution time, but in repeated runs [29, 43].”
BackgroundMethodResultInfluentialCombinatorial Clustering Based on an Externally-Defined One-Hot Constraint
Kumagai, M., Komatsu, K., Takano, F., Araki, T., Sato, M., & Kobayashi, H. (2020) · International Symposium on Computing and Networking · doi:10.1109/candar51075.2020.00015 · Cited by 18
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.