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 401–500 of 604
Path-integral quantum Monte Carlo simulation with open-boundary conditions
Zhang, J., Smelyanskiy, V., Boixo, S., & Neven, H. (2017) · Physical Review A · doi:10.1103/physreva.96.042330 · Cited by 7
Self-citationIdentification of the spintronic Ni Ga V N center in c- GaN and its qubit applications
Gao, R., Bian, G., Yuan, H., & Wang, H. (2021) · Journal of Physics D Applied Physics · doi:10.1088/1361-6463/ac276d · Cited by 6
A non-algorithmic approach to “programming” quantum computers via machine learning
Thompson, N. L., Steck, J. E., & Behrman, E. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00019 · Cited by 6
“We do not yet know whether there exists any quantum advantage for broad classes of problems [5] [6], much less, what it will be in each case.”
BackgroundApplications of Quantum Annealing in StatisticsPreprint
Foster, R. C., Weaver, B., & Gattiker, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.06819 · Cited by 10
Finding a Hadamard Matrix by Simulated Quantum Annealing
Suksmono, A. B. (2018) · Entropy · doi:10.3390/e20020141 · Cited by 5
“[9] showed how quantum speedup should be defined and measured.”
BackgroundApplications of Quantum Annealing to Music Theory
Arya, A., Botelho, L., Cañete, F., Kapadia, D., & Salehi, Ö. (2022) · Springer eBooks · doi:10.1007/978-3-031-13909-3_15 · Cited by 9
Quantum computing for data science
Sanders, B. C. (2023) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2438/1/012007 · Cited by 5
Why adiabatic quantum annealing is unlikely to yield speed-up
Villanueva, A., Najafi, P., & Kappen, H. J. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad0439 · Cited by 11
“An experimental comparison of SA and QA on the D-Wave [28, 29] QA for random spin glass instances also reported no quantum speed-up [30].”
BackgroundQuantum radio astronomy: Quantum linear solvers for redundant baseline calibration
Renaud, N., Rodríguez-Sánchez, P., Hidding, J., & Broekema, P. C. (2024) · Astronomy and Computing · doi:10.1016/j.ascom.2024.100803 · Cited by 7
“While these claims have drawn significant criticism (Rønnow et al., 2014; Begušić and Chan, 2023), it is crucial to assess how quantum computers can be integrated in scientific computing pipelines and explore the benefit they might provide (Herrmann et al., 2023).”
BackgroundQuantum Computing: A Comprehensive Review
Tamrakar, A., & Sharma, R. (2019) · Türk bilgisayar ve matematik eğitimi dergisi · doi:10.61841/turcomat.v10i3.14623 · Cited by 6
Performance of quantum annealing for 2-satisfiability problems with multiple satisfying assignments
Mehta, V., Raedt, H. A. D., Michielsen, K. F. L., & Jin, F. (2025) · Physical Review A · doi:10.1103/n7r5-s63q · Cited by 5
Diagrammatic description of a system coupled strongly to a bosonic bath
Marthaler, M., & Leppäkangas, J. (2016) · Physical review. B./Physical review. B · doi:10.1103/physrevb.94.144301 · Cited by 5
Okada, S., Ohzeki, M., & Tanaka, K. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.024803 · Cited by 5
Investigating the potential for a limited quantum speedup on protein lattice problems
Outeiral, C., Morris, G. M., Shi, J., Strahm, M., Benjamin, S. C., & Deane, C. M. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac29ff · Cited by 31
Ohkuwa, M., & Nishimori, H. (2017) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.86.114004 · Cited by 11
Quantum Humanities: A First Use Case for Quantum-ML in Media Science
Barzen, J., & Leymann, F. (2019) · Digitale Welt · doi:10.1007/s42354-019-0243-2 · Cited by 5
Understanding the physics of D-Wave annealers: From Schrödinger to Lindblad to Markovian dynamics
Mehta, V., Raedt, H. A. D., Michielsen, K. F. L., & Jin, F. (2025) · Physical Review A · doi:10.1103/3yk8-qn64 · Cited by 8
Propagation of fluctuations in the quantum Ising model
Navez, P., Tsironis, G. P., & Zagoskin, A. M. (2017) · Physical review. B./Physical review. B · doi:10.1103/physrevb.95.064304 · Cited by 5
Kyaw, T. H. (2019) · Springer theses · doi:10.1007/978-3-030-19658-5_7 · Cited by 2
Assessing the Effectiveness of Non-Turing Computing Paradigms
Rocutto, L., Maronese, M., Traversa, F. L., Decherchi, S., & Cavalli, A. (2023) · IEEE Access · doi:10.1109/access.2023.3312990 · Cited by 4
“in [26] and [27] methods are described to evaluate quantum computing performances.”
Machine Learning in the Quantum Era
Khurana, S., & Nene, M. J. (2023) · International Conference on Futuristic Technologies (INCOFT) · doi:10.1109/incoft60753.2023.10425372 · Cited by 5
“This versatility allows quantum computers to simultaneously compute multiple pathways in a singular operation, a feat unattainable by classical devices without introducing greater complexities [2]- [4].”
BackgroundAnalysis of D-Wave Topologies with k-Hop-Based Graph Metrics
Bíró, C., & Kusper, G. (2025) · Quantum Reports · doi:10.3390/quantum7020017 · Cited by 4
Benchmarking D-Wave quantum annealing systems: some challenges
McGeoch, C. C. (2015) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2197731 · Cited by 5
“g [2], [26], [18], [27], [30], [31]), with mixed results, sometimes inconclusive, sometimes seemingly-contradictory.”
BackgroundMachine Learning applied to Programming Quantum Computers
Steck, J. E., & Behrman, E. (2019) · AIAA SciTech Forum · doi:10.2514/6.2019-0956 · Cited by 4
Discriminating nonisomorphic graphs with an experimental quantum annealer
Izquierdo, Z. G., Zhou, R., Markström, K., & Hen, I. (2020) · Physical Review A · doi:10.1103/physreva.102.032622 · Cited by 4
“Whether these machines do or could in principle provide any advantages over their classical analogues—or whether they could even be considered genuine quantum processors [6–10]—is still a topic of much debate [11–14].”
BackgroundSchuld, M., & Petruccione, F. (2021) · Quantum science and technology · doi:10.1007/978-3-030-83098-4_3 · Cited by 5
Anschuetz, E. R., Funcke, L., Komiske, P., Kryhin, S., & Thaler, J. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.106.056008 · Cited by 6
Demonstration of Error-Suppressed Quantum Annealing Via Boundary Cancellation
Munoz-Bauza, H., Venuti, L. C., & Lidar, D. A. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.034095 · Cited by 4
Self-citationA Copositive Framework for Analysis of Hybrid Ising-Classical Algorithms
Brown, R., Bernal, D. E., Venturelli, D., & Pavone, M. (2024) · SIAM Journal on Optimization · doi:10.1137/22m1514581 · Cited by 21
“In particular, we follow [74] and define the time to target with s confidence to be the number of repetitions to find the ground state at least once with probability s multiplied by the time for each annealing cycle, T anneal , i.e., where ˆ p succ is the expected value of the returned solution…”
BackgroundQuantum Computing: An Introduction
Prince, J. D. (2014) · Journal of Electronic Resources in Medical Libraries · doi:10.1080/15424065.2014.939462 · Cited by 4
“In June 2014, a study in Science found that the much ballyhooed D-Wave 2 computer, backed by Google, is no faster than conventional computers.(1) The news seems fairly innocuous to those for whom the term ‘‘quantum computing’’ is a term out of science fiction or is generally meaningless, but the news made waves with o…”
Performance of quantum annealing hardware
Steiger, D. S., Heim, B., Rønnow, T. F., & Troyer, M. (2015) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2202661 · Cited by 6
“We have discussed this in detail in Ref.16 As the system size increases, we see that the speedup slowly becomes a slow down.”
BackgroundSelf-citationGhosh, J., & Sanders, B. C. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/3/033015 · Cited by 4
Expressing multiagent coalition structure problems for optimisation by quantum annealing
Leon, F., & Bǎdicǎ, C. (2018) · Enterprise Information Systems · doi:10.1080/17517575.2018.1552993 · Cited by 4
“The results heavily favour quantum annealing, despite the fact that random problems, such as spin glasses (Rønnow et al. 2014), do not seem to bene fi t signi fi cantly from this approach.”
BackgroundQuantum simulation of Cayley-tree Ising Hamiltonians with three-dimensional Rydberg atoms
Song, Y., Kim, M., Hwang, H., Lee, W., & Ahn, J. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013286 · Cited by 51
Lagrange oscillatory neural networks for constraint satisfaction and optimization
Delacour, C., Haverkort, B. F., Sabo, F., Azémard, N., & Todri‐Sanial, A. (2025) · Neuromorphic Computing and Engineering · doi:10.1088/2634-4386/ae0eab · Cited by 4
“When assessing the TTS scaling with the system size, the runtime needs to be optimized for every size to avoid wrong scaling assessments such as flat curve effects occurring when t max is too large, or overestimation of TTS when t max is too small at a large size [68].”
Improving the efficiency of quantum annealing with controlled diagonal catalysts
Hattori, T., & Tanaka, S. (2026) · Physical Review A · doi:10.1103/vff6-cf7c · Cited by 4
Niedermeier, M., Moulinas, A., Louvet, T., Lado, J. L., & Waintal, X. (2026) · Physical Review Research · doi:10.1103/zwn1-f981 · Cited by 21
“First, it is being realized that many mundane mathematical problems could be put in the framework of the quantum many-body (many qubits) formalism 1–6 .”
Entanglement-assisted variational algorithm for discrete optimization problems
Fioroni, L., & Savona, V. (2025) · Communications Physics · doi:10.1038/s42005-025-02338-0 · Cited by 4
“To this purpose, a variety of techniques have been adopted, mostly relying either on Path Integral Monte Carlo (PIMC) [34–36], or on Variational Monte Carlo (VMC) dynamics.”
Advancing quantum machine learning from conceptual design to practical use
Tera, S. P., Chinthaginjala, R., Zhao, X., & Hamdi, M. (2026) · Expert Systems with Applications · doi:10.1016/j.eswa.2026.132127 · Cited by 5
Inaba, K., Yamada, Y., & Takesue, H. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.044074 · Cited by 5
Zhu, J., Wang, X., Wang, Z., & Xu, Y. (2024) · Structures · doi:10.1016/j.istruc.2024.108086 · Cited by 3
Self-citationConditioned quantum-assisted deep generative surrogate for particle-calorimeter interactions
Toledo-Marín, J. Q., Gonzalez, S., Jia, H., Lu, I., Sogutlu, D., Singh, A., Gay, C., Paquet, E., Melko, R. G., Fox, G., et al. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01040-x · Cited by 13
“Speci fi cally, we use the transformation x i ¼ ln u i = ð 1 (cid:2) u i Þ (cid:2) ln δ = ð 1 (cid:2) δ Þ , where the second term preserves the zero values in the transformed variable, i.e., when the voxel energy is zero, v i = 0, the transformed variable x i = 0.”
Problem hardness of diluted Ising models: Population annealing versus simulated annealing
Martínez-García, F., & Porras, D. (2025) · Physical review. E · doi:10.1103/qtck-85mq · Cited by 5
Solving k–SAT problems with generalized quantum measurement
Zhang, Y., Lewalle, P., & Whaley, K. B. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01069-y · Cited by 10
“114,122 for quantum annealing, to benchmark the scaling of such algorithms in a manner independent of the value of the single-shot running time, one needs to identify an optimal TTS 99% for each system size n and then obtain the scaling parameter λ opt , such that TTS opt (cid:7) λ n opt .”
Quadratic constrained mixed discrete optimization with an adiabatic quantum optimizer
Chandra, R., Jacobson, N. T., Moussa, J. E., Frankel, S. H., & Kais, S. (2014) · Physical Review A · doi:10.1103/physreva.90.012308 · Cited by 3
Automating biostratigraphy in oil and gas exploration: Introducing GeoDAISY
O’Neill, M. A., & Denos, M. (2016) · Journal of Petroleum Science and Engineering · doi:10.1016/j.petrol.2016.11.032 · Cited by 3
Kumar, A. (2022) · Abu Dhabi International Petroleum Exhibition & Conference (ADIPEC) · doi:10.2118/211843-ms · Cited by 3
Quantum Computing-Enabled Machine Learning for an Enhanced Model Training Approach
Soni, J., Prabakar, N., & Upadhyay, H. (2023) · Studies in computational intelligence · doi:10.1007/978-981-19-9530-9_12 · Cited by 3
岳, 天., 吴, 晨., 刘, 熠., 杜, 正., 赵, 娜., 焦, 毅., 徐, 喆., & 史, 文. (2023) · SCIENTIA SINICA Terrae · doi:10.1360/sste-2022-0319 · Cited by 3
Elastic energy driven multivariant selection in martensites via quantum annealing
dos Santos, L. C. P., Hang, T., Sandt, R., Finsterbusch, M., Bouar, Y. L., & Spatschek, R. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023076 · Cited by 4
“Starting point of the annealing process is the initialization of the system in the ground state of a known Hamiltonian H 0 ∼ − i σ xi where σ i denotes the Pauli matrices, i.e. corresponding to a strong transverse magnetic field [17, 41].”
Accelerating Continuous Variable Coherent Ising Machines via Momentum
Brown, R., Venturelli, D., Pavone, M., & Bernal, D. E. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-60597-0_8 · Cited by 11
Determination of optimal chain coupling made by embedding in D-wave quantum annealer
Park, H., & Lee, H. (2024) · AVS Quantum Science · doi:10.1116/5.0205511 · Cited by 4
Cost of emulating a small quantum annealing problem in the circuit model
Gonzalez-Conde, J., Morrell, Z., Vuffray, M., Albash, T., & Coffrin, C. (2025) · Physical Review A · doi:10.1103/physreva.111.062606 · Cited by 6
“This makes programming specifications simpler and can lead to much faster run-times [61, 71, 81].”
On a Quantum Algorithm for the Resolution of Systems of Linear Equations
Sellier, J. M., & Dimov, I. (2015) · Studies in computational intelligence · doi:10.1007/978-3-319-21133-6_3 · Cited by 3
“The question of speedup still remains an open discussion [15], though one should note that calculation times for this very young technology are already comparable to the biggest clusters available (based on a mature technology) [15].”
BackgroundQuasi-Adiabatic Quantum Computing Treated with c-Numbers Using the Local-Field Response
Tomaru, T. (2016) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.85.034802 · Cited by 3
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2018) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.273.1 · Cited by 3
“But performing benchmarks fairly is difficult, especially when there is often debate as to which classical algorithm should be taken for comparison [8–11].”
BackgroundInfluentialBasics and Applications of Quantum Annealing
Tanaka, S., TANAHASHI, K., Motohashi, T., & Takayanagi, S. (2018) · TEION KOGAKU (Journal of Cryogenics and Superconductivity Society of Japan) · doi:10.2221/jcsj.53.287 · Cited by 3
Vitale, V., Filippis, G. D., CANDIA, A. D., Tagliacozzo, A., Cataudella, V., & Lucignano, P. (2019) · Scientific Reports · doi:10.1038/s41598-019-50081-8 · Cited by 4
“C t t ( ) ( ) (11) i j z i z j , (1) (1)”
An anomaly in quantum phases induced by borders
Jing, J., Guidry, M., & Wu, L.-A. (2020) · Scientific Reports · doi:10.1038/s41598-020-63555-x · Cited by 3
Computational quantum-classical boundary of complex and noisy quantum systemsPreprint
Fujii, K., & Tamate, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.6932 · Cited by 3
Unconventional machine learning of genome-wide human cancer dataPreprint
Li, R. Y., Gujja, S., Bajaj, S. R., Gamel, O., Cilfone, N. A., Gulcher, J. R., Lidar, D. A., & Chittenden, T. W. (2019) · arXiv (Cornell University) · Cited by 3
Self-citationAdding color: Visualization of energy landscapes in spin glassesPreprint
Biswas, K., & Katzgraber, H. G. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.12431 · Cited by 6
“[11] T.”
BackgroundSolving the Resource-Constrained Project Scheduling Problem (RCPSP) with Quantum AnnealingPreprint
Armas, L. F. P., Creemers, S., & Deleplanque, S. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4689017 · Cited by 3
Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model
Gonzalez-Conde, J., Morrell, Z., Vuffray, M., Albash, T., & Coffrin, C. (2024) · arXiv · doi:10.48550/arxiv.2402.17667 · Cited by 3
Pelofske, E., Hahn, G., & Djidjev, H. N. (2025) · npj Unconventional Computing · doi:10.1038/s44335-025-00032-6 · Cited by 3
“The TTS is computed as in section “ Measuring the compute time to optimally solve a QUBO: time-to-solution ” .”
Huang, K.-P., Nien, C.-F., Zhang, Y.-T., Lee, C.-K., & Wang, Y.-C. (2024) · IEEE Asia Pacific Conference on Circuits and Systems (APCCAS) · doi:10.1109/apccas62602.2024.10808341 · Cited by 3
Dehn, V., Zaefferer, M., Hellstern, G., Jayadevan, K., Reiter, F., & Wellens, T. (2026) · Physical Review A · doi:10.1103/l5r4-zcqv · Cited by 12
“Furthermore, a more elaborate statistical analysis, not concentrating on the median runtime as we did, but also considering the scaling of different percentiles [40], would provide additional insight.”
Cazals, P., François, A., Henriet, L., Leclerc, L., Marin, M., Naghmouchi, M. Y., Coelho, W. D. S., Sikora, F., Vitale, V., Watrigant, R., et al. (2026) · Physical Review Applied · doi:10.1103/8gjv-ll1f · Cited by 30
The Lie algebra of XY-mixer topologies and warm starting QAOA for constrained optimization
Kordonowy, S., & Leipold, H. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01192-4 · Cited by 15
Bonanni, A., Dietl, T., & Ohno, H. (2021) · Springer eBooks · doi:10.1007/978-3-030-63210-6_21 · Cited by 6
Schuld, M., & Petruccione, F. (2018) · Quantum science and technology · doi:10.1007/978-3-319-96424-9_4 · Cited by 2
Progress and Prospects in the Field of Quantum Computing
Beterov, I. (2024) · Optoelectronics Instrumentation and Data Processing · doi:10.3103/s8756699024700043 · Cited by 1
Dissipation-induced quantum homogenization for temporal information processing
Yosifov, A., Iyer, A., & Vedral, V. (2025) · Physical Review A · doi:10.1103/physreva.111.012622 · Cited by 2
Khurana, S., & Nene, M. J. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00265-5 · Cited by 5
“…and entanglement can be exploited in algorithms to solve certain types of problems much more quickly than classical algorithms, particularly those requiring the exploration of a vast number of possible solutions or configurations (Grover 1997; Khurana and Nene 2023a; Rønnow et al 2014).”
Gradient matching of higher order combinatorial optimization in quadratic Ising machines
Dobrynin, D., Tedeschi, M., Heittmann, A., & Strachan, J. P. (2024) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc64395.2024.10937013 · Cited by 3
“In Appendix B-B we perform hyperparameter optimization of SA to produce best performance for PUBO/QUBO/QUBO-GM at each considered problem size for fair comparison and accurate performance scaling estimation [40].”
An Evolutionary Ising Optimization Framework for Unconstrained Binary Quadratic Programming
Fu, W., Trivedi, A., Chen, G., Gao, Y., Srinivasan, D., & Danner, A. J. (2025) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2025.3566963 · Cited by 2
“Furthermore, while some IMs have shown excellent potential, limitations such as restricted spin number and connectivity [19], [20], [21], scaling issues [22], [23], large physical footprints [15], [24], and substantial problem-embedding overhead [25] remain significant practical hurdles.”
Reliability of Digitized Quantum Annealing and the Decay of Entanglement
Peterson, J. P. S., Sarthour, R. S., Souza, A. M., Oliveira, I. S., Brito, F., & de Melo, F. (2018) · Annalen der Physik · doi:10.1002/andp.201800007 · Cited by 3
2D Material-based Quantum Logic Gate Operating Via Self-Organization of Quantum Dots
Voronov, V. K., Dudareva, O. V., & Gerashchenko, L. A. (2020) · Global Journal of Human Social Science · doi:10.34257/gjsfravol20is8pg13 · Cited by 3
“As for the Orion computers of the Canadian company D-Wave is concerned, this issue requires a special discussion [12,13].”
BackgroundRecursive simulation of quantum annealing
Sowa, A., Everitt, M. J., Samson, J. H., Savel'ev, S. E., Zagoskin, A. M., Heidel, S., & Zúñiga-Anaya, J. C. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/41/415301 · Cited by 2
Performance of the quantum adiabatic algorithm on constraint satisfaction and spin glass problems
Hen, I., & Young, A. P. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02343-3 · Cited by 2
Superposition of Macroscopically Distinct States in Adiabatic Quantum Computation
Yuge, T. (2018) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.87.124002 · Cited by 2
Enhancing Quantum Algorithms for Quadratic Unconstrained Binary Optimization via Integer Programming
Wagner, F., Nüßlein, J., & Liers, F. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3711935 · Cited by 15
“Among those, combinatorial optimization plays a prominent role (cf. e.g., [1]), although clear advantages have not yet been shown [48, 71].”
Boosting and Adiabatic Quantum Computing
Wittek, P. (2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00014-1 · Cited by 2
Three-step implementation of any n×n unitary with a complete graph of n qubits
Katabarwa, A., & Geller, M. R. (2015) · Physical Review A · doi:10.1103/physreva.92.032306 · Cited by 2
Universal computation with quantum fields
Ikeda, K. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02811-5 · Cited by 5
Three Quantum Machine Learning Approaches for Mobile User Indoor-Outdoor Detection
Phillipson, F., Wezeman, R. S., & Chiscop, I. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-70866-5_11 · Cited by 2
EQUAL: Improving the Fidelity of Quantum Annealers by Injecting Controlled PerturbationsPreprint
Ayanzadeh, R., Das, P., Tannu, S., & Qureshi, M. K. (2022) · Research Square · doi:10.21203/rs.3.rs-1343360/v1 · Cited by 5
(2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00020-7 · Cited by 2
Yu, W., Chen, Y., Zhang, C., Chen, Y., Wei, H., Chen, Z., & Zhang, Y. (2023) · Research Square · doi:10.21203/rs.3.rs-3562680/v1 · Cited by 2
Scaling advantage in approximate optimization with quantum annealingPreprint
Lidar, D. A., & Munoz-Bauza, H. (2024) · Research Square · doi:10.21203/rs.3.rs-3860892/v1 · Cited by 2
Self-citationEffect of quantum statistics on computational power of atomic quantum annealers
Luo, Y., & Li, X. (2023) · Physical Review A · doi:10.1103/physreva.107.012608 · Cited by 2
Complex vector gain-based annealer for minimizing X Y Hamiltonians
Cummins, J., & Berloff, N. G. (2026) · Physical Review Applied · doi:10.1103/lpwn-t7sv · Cited by 3
Noise effects on diabatic quantum annealing protocols
Salatino, G., Matzler, M., Scocco, A., Lucignano, P., & Passarelli, G. (2025) · Physical Review A · doi:10.1103/x9hw-xhvj · Cited by 4
GNN-Based Performance Prediction of Quantum Optimization of Maximum Independent Set
Sohrabizadeh, A., Lin, W.-H., Tan, D. B., Cain, M., Wang, S.-T., Lukin, M. D., & Cong, J. (2024) · doi:10.1145/3676536.3697129 · Cited by 4
Direct comparison of stochastic driven nonlinear dynamical systems for combinatorial optimization
Hou, J., Barzegar, A., & Katzgraber, H. G. (2025) · Physical review. E · doi:10.1103/9vbb-h73q · Cited by 5
“It is straightforward to show [59] that where p s ( γ ) gives the success probability, i.e., the chance of finding the ground state in a single run of the algo-rithm.”
Pandya, K., & Maiti, A. (2025) · Information Sciences · doi:10.1016/j.ins.2025.122584 · Cited by 1
Detecting entanglement and nonlocality with minimum observable length
Chen, Z., Shi, F., & Zhao, Q. (2025) · New Journal of Physics · doi:10.1088/1367-2630/adfe0e · Cited by 2
Leveraging Quantum Annealing for Layout Optimization
Nigro, L., Sala, S., Amendola, A., & Prati, E. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500358 · Cited by 1
Kim, M. S., Singh, A. K., Venturelli, D., Kaewell, J., & Jamieson, K. (2025) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/3680207.3723495 · Cited by 15
“We use a commonly accepted metric for QA performance microbench-marks, time-to-solution (TTS) [ 60].”
Noori, M., Valiante, E., Rozada, I., Vaerenbergh, T. V., & Mohseni, M. (2026) · Physical Review Applied · doi:10.1103/2fpj-t663 · Cited by 6
“More recent metrics, such as R 99 [19], time-to-solution (TTS) [20], and energy-to-solution (ETS) [21] have been proposed in the quantum, physics-inspired, and in-memory computing optimization communities, which are essentially special cases of Koza’s computational effort metric.”
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.