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 301–400 of 604
Solving the Optimal Trading Trajectory Problem Using a Quantum AnnealerPreprint
Rosenberg, G., Haghnegahdar, P., Goddard, P., Carr, P., Wu, K. J., & de Prado, M. L. (2015) · SSRN Electronic Journal · doi:10.2139/ssrn.2649376 · Cited by 17
Accessible coherence in open quantum system dynamics
Díaz, M. G., Desef, B., Rosati, M., Egloff, D., Calsamiglia, J., Smirne, A., Skotiniotis, M., & Huelga, S. F. (2020) · Quantum · doi:10.22331/q-2020-04-02-249 · Cited by 20
A Quantum Algorithm for Model-Independent Searches for New Physics
Matchev, K. T., Shyamsundar, P., & Smolinsky, J. (2023) · Letters in High Energy Physics · doi:10.31526/lhep.2023.301 · Cited by 20
Dynamics of the quantum search and quench-induced first-order phase transitions
Coulamy, I., Saguia, A., & Sarandy, M. S. (2017) · Physical review. E · doi:10.1103/physreve.95.022127 · Cited by 22
Quantum humanities: a vision for quantum computing in digital humanities
Barzen, J., & Leymann, F. (2019) · SICS Software-Intensive Cyber-Physical Systems · doi:10.1007/s00450-019-00419-4 · Cited by 17
Quantum Artificial Intelligence Scalability in the NISQ Era: Pathways to Quantum Utility
Moreau, G. S., Pisani, L., Profir, M., Podda, C., Leoni, L., & Cao, G. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202400716 · Cited by 27
Minimizing minor embedding energy: an application in quantum annealing
Fang, Y.-L., & Warburton, P. A. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02681-x · Cited by 25
Quantum Computing in a Statistical Context
Wang, Y., & Liu, H. (2022) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-042720-024040 · Cited by 22
Breakdown of the Weak-Coupling Limit in Quantum Annealing
Bando, Y., Yip, K.-W., Chen, H., Lidar, D. A., & Nishimori, H. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.054033 · Cited by 21
Self-citationSpanning Tree Calculations on D-Wave 2 Machines
Novotny, M. A., Hobl, Q. L., Hall, J. S., & Michielsen, K. F. L. (2016) · Journal of Physics Conference Series · doi:10.1088/1742-6596/681/1/012005 · Cited by 16
“There is still work to do to quantify whether the conclusions based on defining and attempting to detect quantum speedup in a D-Wave machine with 503 qubits [27] hold when applied to a 1000 qubit D-Wave 2X.”
BackgroundLodewijks, B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.08043 · Cited by 35
“Quantum Annealing (QA) devices which implement the AQO technique, which is based on the adiabatic principle of quantum mechanics [7], have been developed and some experimental results seem to provide evidence that shows a speed-up compared to the existing techniques [9, 14], though there are theoretical arguments that…”
BackgroundLukishova, S. G., Liapis, A. C., Bissell, L. J., Gehring, G. M., & Boyd, R. W. (2014) · Liquid Crystals Reviews · doi:10.1080/21680396.2014.954015 · Cited by 14
Diabatic quantum annealing for the frustrated ring model
Côté, J., Sauvage, F., Larocca, M., Jonsson, M., Cincio, Ł., & Albash, T. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acfbaa · Cited by 21
Optimum-preserving QUBO parameter compression
Mücke, S., Gerlach, T., & Piatkowski, N. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00219-3 · Cited by 25
“Despite the promise of quantum speedup, currently available devices that claim to perform AQC could not be proven to be faster than classical computing resources yet (Rønnow et al. 2014).”
Ollivier-Ricci curvature and fast approximation to tree-width in embeddability of QUBO problems
Wang, C., JONCKHEERE, E. A., & Brun, T. A. (2014) · International Symposium on Communications, Control and Signal Processing · doi:10.1109/isccsp.2014.6877946 · Cited by 19
“There is some evidence that the D-Wave quantum computer gives a modest speed-up over classical solvers for QUBO problems, and may provide a large speed-up for some instances of QUBO problems [2].”
BackgroundMinimal constraints in the parity formulation of optimization problems
Lanthaler, M., & Lechner, W. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac1897 · Cited by 21
From Digital Humanities to Quantum Humanities: Potentials and Applications
Barzen, J. (2022) · Springer eBooks · doi:10.1007/978-3-030-95538-0_1 · Cited by 24
Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
Passarelli, G., Yip, K.-W., Lidar, D. A., & Lucignano, P. (2022) · Physical Review A · doi:10.1103/physreva.105.032431 · Cited by 17
Self-citationMüller, M. M., Gherardini, S., Calarco, T., Montangero, S., & Caruso, F. (2022) · Scientific Reports · doi:10.1038/s41598-022-25770-6 · Cited by 21
“, by means of quantum estimation methods [16], is going to play a key role to enhance the performance of quantum technology devices [17].”
MethodViewing vanilla quantum annealing through spin glasses
Katzgraber, H. G. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab6ba · Cited by 20
Quantum Optimization Algorithms in Operations Research: Methods, Applications, and ImplicationsPreprint
Klug, F. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4854668 · Cited by 25
Counterdiabatic reverse annealing
Passarelli, G., & Lucignano, P. (2023) · Physical Review A · doi:10.1103/physreva.107.022607 · Cited by 20
Quantum computing for space applications: a selective review and perspectives
Torta, P., Casati, R., Bruni, S., Mandarino, A., & Prati, E. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00369-8 · Cited by 20
Quantum computation and quantum simulation
Heng, F. (2018) · Acta Physica Sinica · doi:10.7498/aps.67.20180710 · Cited by 13
Optimization of quantum computing models inspired by D-wave quantum annealing
Wang, B., Hu, F., & Wang, C. (2020) · Tsinghua Science & Technology · doi:10.26599/tst.2019.9010030 · Cited by 14
Characterization of QUBO reformulations for the maximum k-colorable subgraph problem
Quintero, R. A., Bernal, D. E., Terlaky, T., & Zuluaga, L. F. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03421-z · Cited by 20
“, [56]) when performing the quantum annealing.”
Yu, S., & Nabil, T. (2021) · Frontiers in Physics · doi:10.3389/fphy.2021.730685 · Cited by 19
“Indeed, the notion of quantum speed-up itself has been proven to be elusive, and varies from provable to limited speed-ups, depending on the question that is investigated [14 – 16].”
BackgroundMethodPatch-planting spin-glass solution for benchmarking
Wang, W., Mandrà, S., & Katzgraber, H. G. (2017) · Physical review. E · doi:10.1103/physreve.96.023312 · Cited by 20
A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2019) · International Journal of Quantum Information · doi:10.1142/s0219749919500424 · Cited by 21
Template-Based Minor Embedding for Adiabatic Quantum Optimization
Serra, T., Huang, T., Raghunathan, A. U., & Bergman, D. (2021) · INFORMS journal on computing · doi:10.1287/ijoc.2021.1065 · Cited by 18
Four-qubit variational algorithms in silicon photonics with integrated entangled photon sources
Baldazzi, A., Sanna, M., Borghi, M., Azzini, S., & Pavesi, L. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01061-6 · Cited by 21
From Ansätze to Z-Gates: A NASA View of Quantum Computing
Rieffel, E. G., Hadfield, S., Hogg, T., Mandrà, S., Marshall, J., Mossi, G., O’Gorman, B., Plamadeala, E., Tubman, N. M., Venturelli, D., et al. (2019) · Advances in parallel computing · doi:10.3233/apc190010 · Cited by 19
Frustrated Ising Model on D-wave Quantum Annealing Machine
Park, H., & Lee, H. (2022) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.91.074001 · Cited by 18
Deep learning optimal quantum annealing schedules for random Ising models
Hegde, P. R., Passarelli, G., Cantele, G., & Lucignano, P. (2023) · New Journal of Physics · doi:10.1088/1367-2630/ace547 · Cited by 17
Cluster state generation in one-dimensional Kitaev honeycomb model via shortcut to adiabaticity
Kyaw, T. H., & Kwek, L. C. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aab315 · Cited by 12
Wang, C., & JONCKHEERE, E. A. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2117-1 · Cited by 17
Principles and Guidelines for Quantum Performance Analysis
McGeoch, C. C. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-14082-3_4 · Cited by 11
Quantum-enhanced learning of rotations about an unknown direction
Mo, Y., & Chiribella, G. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab4d9a · Cited by 13
Mehta, V., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2022) · Physical Review A · doi:10.1103/physreva.105.062406 · Cited by 14
“de; Corresponding author algorithms [20, 33, 40].”
Implementing Arbitrary Ising Models with a Trapped-Ion Quantum Processor
Lu, Y., Chen, W., Zhang, S., Zhang, K., Zhang, J., Zhang, J.-N., & Kim, K. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.050602 · Cited by 28
“It has not yet clearly shown the possibility of surpassing classical computational power with the quantum processors in the NISQ regime [1, 3, 13].”
Solving the Shipment Rerouting Problem with Quantum Optimization Techniques
Yarkoni, S., Huck, A., Schülldorf, H., Speitkamp, B., Tabrizi, M. S., Leib, M., Bäck, T., & Neukart, F. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-87672-2_33 · Cited by 17
Generalization metrics for practical quantum advantage in generative models
Gili, K., Mauri, M., & Perdomo‐Ortiz, A. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.044032 · Cited by 53
“As long as the superiority is demonstrated in the real-world setting, under the real constrains and problem size of interest, one can waive the need for demonstrating an asymptotic scaling with problem size, which is the usual emphasis in algorithmic quantum speedup [10].”
BackgroundMathematical Methods for a Quantum Annealing Computer
Warren, R. H. (2018) · Journal of Advances in Applied Mathematics · doi:10.22606/jaam.2018.33002 · Cited by 10
“The design and fabrication of several generations of quantum annealing computers (QACs) to solve hard optimization problems has aroused interest in their expected speedup [8, 14, 26], real-world applications [1, 2, 4, 9, 21, 22, 25], and benchmarks [14 - 16].”
BackgroundDynamics of simulated quantum annealing in random Ising chains
Mbeng, G. B., Privitera, L., Arceci, L., & Santoro, G. E. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.99.064201 · Cited by 15
Disorder-assisted graph coloring on quantum annealers
Więckowski, A., Deffner, S., & Gardas, B. (2019) · Physical Review A · doi:10.1103/physreva.100.062304 · Cited by 11
Improved QUBO Formulation of the Graph Isomorphism Problem
Hua, R., & Dinneen, M. J. (2019) · SN Computer Science · doi:10.1007/s42979-019-0020-1 · Cited by 14
Expanding the horizon of automated metamaterials discovery via quantum annealingPreprint
Kitai, K., Guo, J., Ju, S., Tanaka, S., Tsuda, K., Shiomi, J., & Tamura, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.06573 · Cited by 11
Negotiating a Quantum Computation Network: Mechanics, Machines, Mindsets
Noon, D. (2017) · Carleton University's Institutional Repository (MacOdrum Library, Carleton University) · doi:10.22215/etd/2017-11829 · Cited by 11
ReAIM: A ReRAM-based Adaptive Ising Machine for Solving Combinatorial Optimization Problems
Chiang, H.-W., Nien, C.-F., Cheng, H.-Y., & Huang, K.-P. (2024) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca59077.2024.00015 · Cited by 15
“…using the time-to-solution (TTS) metric, which is commonly used to balance between solution accuracy and computation speed for annealer research [10], [45], [48], [64], [73], defined as follows: where P a ( t a ) shows the probability of obtaining a near-optimal solution within computing time t a .”
MethodComparative Analysis of a Quantum SVM With an Optimized Kernel Versus Classical SVMs
Hidalgo, M. C. (2025) · IEEE Access · doi:10.1109/access.2025.3567352 · Cited by 11
“A prominent area of study in quantum computing is quantum speedup [3], where researchers investigate types of algorithms in which quantum computers perform faster than their classical counterparts.”
Advantage of Pausing: Parameter Setting for Quantum Annealers
Izquierdo, Z. G., Grabbe, S. R., Idris, H., Wang, Z., Marshall, J., & Rieffel, E. G. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.054056 · Cited by 12
“Yet, the much sought-after speedup for solving optimization problems with these devices has remained elusive [14–18].”
BackgroundSelf-citationQuantum approximate optimization algorithm applied to the binary perceptron
Torta, P., Mbeng, G. B., Baldassi, C., Zecchina, R., & Santoro, G. E. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.094202 · Cited by 20
Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem
Singkanipa, P., Kasatkin, V., Zhou, Z., Quiroz, G., & Lidar, D. A. (2025) · Physical Review X · doi:10.1103/physrevx.15.021082 · Cited by 24
Self-citationImproving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping
Maciejewski, F. B., Biamonte, J., Hadfield, S., & Venturelli, D. (2025) · Quantum · doi:10.22331/q-2025-11-06-1906 · Cited by 10
“We construct the estimators from three quantiles of the total distribution over samples (for the best trial), corresponding to averaging only a subset of all AR outputs [43] after sorting them in descending order (1, 100, and 1000 samples, which constitute the top 0 .”
Differential geometric treewidth estimation in adiabatic quantum computation
Wang, C., JONCKHEERE, E. A., & Brun, T. A. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1394-9 · Cited by 14
A Method for Reducing Time-to-Solution in Quantum Annealing Through Pausing
Zielewski, M. R., & Takizawa, H. (2022) · International Conference on High Performance Computing in Asia-Pacific Region (HPC Asia) · doi:10.1145/3492805.3492815 · Cited by 12
“The baseline schedule we select is forward annealing with minimum possible annealing time, which has previously been shown to lead to a solution in the shortest time [6, 28].”
MethodSupervised learning of random quantum circuits via scalable neural networks
Cantori, S., Vitali, D., & Pilati, S. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acc4e2 · Cited by 14
“fied only when the targeted computational task cannot be completed by any classical algorithm in a comparable computation time [3].”
BackgroundQuantum annealing for microstructure equilibration with long-range elastic interactions
Sandt, R., Bouar, Y. L., & Spatschek, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-33232-w · Cited by 11
On quantum computing for artificial superintelligence
Grabowska, A., & Gunia, A. (2024) · European Journal for Philosophy of Science · doi:10.1007/s13194-024-00584-7 · Cited by 18
“Taking advantage of quantum effects, quantum algorithms support the simulation of systems where quantum phenomena play an important role (Rønnow et al., 2014); for quantum problems, they can provide more efficient (quantum) solutions compared to classical algorithms.”
Quantum error mitigation in quantum annealing
Raymond, J., Amin, M. H. S., King, A. D., Harris, R., Bernoudy, W., Berkley, A. J., Boothby, K., Smirnov, A. Y., Altomare, F., Babcock, M. C., et al. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00977-3 · Cited by 36
“We expand the schedule near the critical point as (B10) Expanding g ( s ) near s c , we obtain On the other hand Comparing with (B8), we obtain where is a time scale that only depends on the annealing schedule.”
Architectural patterns for designing quantum artificial intelligence systems
Klymenko, M. V., Hoang, T., Xu, X., Xing, Z., Usman, M., Lu, Q., & Zhu, L. (2025) · Journal of Systems and Software · doi:10.1016/j.jss.2025.112456 · Cited by 27
Accurate solution of the Index Tracking problem with a hybrid simulated annealing algorithm
Rubio-García, Á., Fernández-Lorenzo, S., García‐Ripoll, J. J., & Porras, D. (2024) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2024.129637 · Cited by 9
“Finally, we fix the temperature schedule as the one for which the ratio of optimal TE found was highest and run a Time-To-Solution (TTS) computation [21] with this schedule to determine the optimal choice of steps N and copies n.”
MethodThompson, N. L., Nguyen, N. H., Behrman, E., & Steck, J. E. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02877-1 · Cited by 10
Schmidt, S. (2016) · Physica Scripta · doi:10.1088/0031-8949/91/7/073006 · Cited by 12
Tunneling in projective quantum Monte Carlo simulations with guiding wave functions
Parolini, T., Inack, E. M., Giudici, G., & Pilati, S. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.214303 · Cited by 9
“[14] T.”
Experimental Quantum‐Enhanced Machine Learning in Spin‐Based Systems
Wang, X., Lin, Z., Che, L., Chen, H.-Y., & Lu, D. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202200005 · Cited by 10
Graph Coloring with Quantum AnnealingPreprint
Kwok, J., & Pudenz, K. L. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.04470 · Cited by 9
Beyond quantum annealing: optimal control solutions to maxcut problems
Pecci, G., Wang, R., Torta, P., Mbeng, G. B., & Santoro, G. E. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad60f2 · Cited by 16
Endo, K., Matsuda, Y., Tanaka, S., & Muramatsu, M. (2024) · PLoS ONE · doi:10.1371/journal.pone.0304594 · Cited by 13
Quantum Algorithms for the Physical Layer: Potential Applications to Physical Layer Security
Matsumine, T., Ochiai, H., & Shikata, J. (2025) · IEEE Access · doi:10.1109/access.2025.3528443 · Cited by 14
“A substantial number of proof-of-principle demonstrations have been conducted [43], [45], [46], [47], [48], [49], [50], [51], and currently, the D-Wave quantum annealer has over 5,000 qubits [52].”
Sampling diverse near-optimal solutions via algorithmic quantum annealing
Mohseni, M., Rams, M. M., Isakov, S. V., Eppens, D., Pielawa, S., Strümpfer, J., Boixo, S., & Neven, H. (2023) · Physical review. E · doi:10.1103/physreve.108.065303 · Cited by 17
Self-citationComputability and Complexity of Unconventional Computing Devices
Broersma, H. J., Stepney, S., & Wendin, G. P. (2018) · Natural computing series · doi:10.1007/978-3-319-65826-1_11 · Cited by 9
Dejen, A., & Ridwan, M. (2022) · International Journal of Mathematical Sciences and Computing · doi:10.5815/ijmsc.2022.04.05 · Cited by 8
Improving quantum-to-classical data decoding using optimized quantum wavelet transform
Jeng, M., Islam, I., Levy, D., Riachi, A., Chaudhary, M., Nobel, A., Kneidel, D., Jha, V., Bauer, J., Maurya, A., et al. (2023) · The Journal of Supercomputing · doi:10.1007/s11227-023-05433-7 · Cited by 8
Semiclassical approach to finite-temperature quantum annealing with trapped ions
Raventós, D., Graß, T., Juliá-Díaz, B., & Lewenstein, M. (2018) · Physical Review A · doi:10.1103/physreva.97.052310 · Cited by 9
How quantum is the speedup in adiabatic unstructured search?
Hen, I. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2281-y · Cited by 9
“[10] Troels F.”
MethodEfficient Quantum and Simulated Annealing of Potts Models Using a Half-hot Constraint
Okada, S., Ohzeki, M., & Tanaka, K. (2020) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.89.094801 · Cited by 10
Multiagent Coalition Structure Optimization by Quantum Annealing
Leon, F., Lupu, A., & Bǎdicǎ, C. (2017) · International Conference on Computational Collective Intelligence · doi:10.1007/978-3-319-67074-4_32 · Cited by 7
Multiple Query Optimization on the D-Wave 2X Adiabatic Quantum ComputerPreprint
Trummer, I., & Koch, C. E. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.06437 · Cited by 8
“ction whether quantum eects play indeed a signicant role during the optimization process [2, 6, 7, 25, 37, 40] and whether the performance is signicantly better than the one of classical computers [19, 23, 22, 33]. Recent publications seem to answer the rst question positively [2, 7, 25]. The answer to the second ques…”
BackgroundInfluentialUnraveling reverse annealing: A study of D-Wave quantum annealers
Mehta, V., Raedt, H. A. D., Michielsen, K. F. L., & Jin, F. (2025) · Physical Review A · doi:10.1103/vfxh-gjgy · Cited by 12
Quantum Computing for Genomics: Conceptual Challenges and Practical Perspectives
Maurizio, A., & Mazzola, G. (2025) · PRX Life · doi:10.1103/h49j-bsc6 · Cited by 23
“[111] which represents a key work, providing a cautious and thorough assessment of the potential quantum advantage of annealers over classical heuristics such as simulated annealing (SA) [144].”
Influential23Na relaxometry: An overview of theory and applications
Song, Y., Yin, Y., Chen, Q., Marchetti, A., & Kong, X. (2023) · Magnetic Resonance Letters · doi:10.1016/j.mrl.2023.04.001 · Cited by 9
Quantum Advancements in Securing Networking Infrastructures
Salloum, H., Alawir, M., Alatasi, M. A., Asekrea, S., Mazzara, M., & Bahrami, M. (2024) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-031-57942-4_34 · Cited by 10
Benchmarking quantum annealing with maximum cardinality matching problems
Vert, D., Willsch, M., Yenilen, B., Sirdey, R., Louise, S., & Michielsen, K. F. L. (2024) · Frontiers in Computer Science · doi:10.3389/fcomp.2024.1286057 · Cited by 10
Quantum Monte Carlo annealing with multi-spin dynamics
Mazzola, G., & Troyer, M. (2017) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/aa6de1 · Cited by 10
Self-citationReview of quantum simulation based on Rydberg many-body system
Zhang, Z.-Y., Ding, D.-S., & Shi, B. (2020) · Chinese Physics B · doi:10.1088/1674-1056/abd744 · Cited by 9
Matching Point Sets with Quantum Circuit Learning
Noormandipour, M., & Wang, H. (2022) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp43922.2022.9746800 · Cited by 8
Quantum Robotics: A Primer on Current Science and Future Perspectives
Tandon, P., Lam, S., Shih, B., Mehta, T., Mitev, A., & Ong, Z. (2017) · Synthesis lectures on quantum computing · doi:10.2200/s00746ed1v01y201612qmc010 · Cited by 11
Reconstructing the ideal results of a perturbed analog quantum simulator
Schwenk, I., Reiner, J.-M., Zanker, S., Tian, L., Leppäkangas, J., & Marthaler, M. (2018) · Physical Review A · doi:10.1103/physreva.97.042310 · Cited by 7
Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization
Schrock, J., McCaskey, A., Hamilton, K. E., Humble, T. S., & Imam, N. (2017) · Entropy · doi:10.3390/e19090500 · Cited by 15
“Thus, there is an outstanding need to find broad classes of applications for which the current hardware offers improvements [22,23].”
BackgroundFinding Hadamard Matrices by a Quantum Annealing Machine
Suksmono, A. B., & Minato, Y. (2019) · Scientific Reports · doi:10.1038/s41598-019-50473-w · Cited by 11
“[33] T.”
Quantum optics with artificial atoms
Kockum, A. F. (2018) · Physics Subject Headings (PhySH) · doi:10.29172/5ba9ba41-67e3-4588-86b5-6cc8052e0847 · Cited by 7
Wittek, P. (2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00001-3 · Cited by 7
Milestones on the Quantum Utility Highway: Quantum Annealing Case Study
McGeoch, C. C., & Farré, P. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3625307 · Cited by 14
“• Several papers consider a performance metric known as quantum speedup [5, 27, 38, 39, 49, 50, 70].”
BackgroundA numerical approach for calculating exact non-adiabatic terms in quantum dynamics
Lawrence, E. D. C., Schmid, S. F. J., Čepaitė, I., Kirton, P., & Duncan, C. W. (2025) · SciPost Physics · doi:10.21468/scipostphys.18.1.014 · Cited by 10
From quantum-enhanced to quantum-inspired Monte Carlo
Christmann, J., Ivashkov, P., Chiurco, M., & Mazzola, G. (2025) · Physical Review A · doi:10.1103/physreva.111.042615 · Cited by 14
Okada, S., Ohzeki, M., & Tanaka, K. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.024802 · Cited by 6
Implementation of a Multiple Target Tracking Filter on an Adiabatic Quantum Computer
McCormick, T. M., Osborn, B. R., Angle, R. B., & Streit, R. L. (2022) · IEEE Aerospace Conference (AERO) · doi:10.1109/aero53065.2022.9843451 · Cited by 6
The roles of Kerr nonlinearity in a bosonic quantum neural network
Xu, H., Krisnanda, T., Bao, R., & Liew, T. C. H. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acbc43 · Cited by 9
A Study of Spanning Trees on a D-Wave Quantum Computer
Hall, J. S., Novotny, M. A., Neuhaus, T., & Michielsen, K. F. L. (2015) · Physics Procedia · doi:10.1016/j.phpro.2015.07.109 · Cited by 6
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.