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 501–600 of 604
Hizzani, M., Heittmann, A., & Strachan, J. P. (2025) · IEEE Interregional NEWCAS Conference (NEWCAS) · doi:10.1109/newcas64648.2025.11107024 · Cited by 1
Limits of quantum run-time advantage
Tuziemski, J., Pawłowski, J., Tarasiuk, P., Pawela, Ł., & Gardas, B. (2026) · Physical Review Applied · doi:10.1103/gpsf-pn1x · Cited by 9
“Again, a proper metric in this context is TT ε , with all the necessary time components included, and optimization performed [39].”
Exploring quantum annealing for coarse-grained protein folding
Scheiber, T., Heller, M., & Giebel, A. (2026) · Scientific Reports · doi:10.1038/s41598-026-46916-w · Cited by 2
“The TTS is calculated by multiplying the average runtime τ for a single iteration of the algorithm by the expected number of runs As has been stated in different works [46, 55], the TTS suffers from one major drawback.”
Thermodynamic significance of QUBO encoding on quantum annealers
Doucet, E., Mzaouali, Z., Robertson, R., Gardas, B., Deffner, S., & Domino, K. (2026) · New Journal of Physics · doi:10.1088/1367-2630/ae6e98 · Cited by 1
“This does not diminish the scientific value of QA as a controllable many-body open quantum system, but it motivates broadening the notion of “performance” beyond time-to-solution alone [16].”
Quantum Computing Applications in Engineering: Current Status and Future Prospects
Rukmanikanthan, S., Dullah, H., Teoh, Y. X., & Ahmed, A. N. (2026) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-026-10569-9 · Cited by 1
Quantum Computing Meets the Real World
Pudenz, K. L. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21819-9_4 · Cited by 1
Balu, R., Shires, D. R., & Namburu, R. R. (2016) · The Journal of Defense Modeling and Simulation Applications Methodology Technology · doi:10.1177/1548512916648232 · Cited by 2
“, who define the measures of quantum speedup in quantum devices and D-Wave technology in particular for a critical review on D-Wave based solutions.(14) The motivation for our study is based on the observation that AQC implements a process that keeps the system at equilibrium throughout the evolution of the system.”
BackgroundImpact of Future Technologies on Architecture
Mudge, T., Chong, F. T., Markov, I. L., Sendag, R., Yi, J. J., & Chiou, D. (2016) · IEEE Micro · doi:10.1109/mm.2016.71 · Cited by 2
Generalized Quantum Deutsch-Jozsa Algorithm
Arodź, T. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-50433-5_36 · Cited by 1
“The key promise of quantum computing is to achieve speedup compared to classical computers [10], leading to faster algorithms in many domains, including linear algebra [5], database search [4], or machine learning [1,3,9].”
Optimization and benchmarking of the thermal cycling algorithm
Barzegar, A., Kankani, A., Mandrà, S., & Katzgraber, H. G. (2021) · Physical review. E · doi:10.1103/physreve.104.035302 · Cited by 1
“As the measure of performance, we use the TTS [33,34] that is defined in the following way: TTS(α) = n(α) τrun, (2) where n(α) is the number of times that the algorithm must be repeated, for a given parameter set α, to find the ground state at least once with a desired probability of pd . τrun is the average run time,…”
BackgroundMethodInfluentialBonanni, A., Dietl, T., & Ohno, H. (2021) · Springer eBooks · doi:10.1007/978-3-030-63101-7_21-1 · Cited by 2
COMPUTATIONAL TURBULENT COMBUSTION IN THE AGE OF ARTIFICIAL INTELLIGENCE AND QUANTUM INFORMATION
Givi, P. (2021) · International Journal of Mathematics and Physics · doi:10.26577/ijmph.2021.v12.i1.01 · Cited by 1
Quantum Approaches for WCET-Related Optimization Problems
Bettonte, G., Gilbert, V., Vert, D., Louise, S., & Sirdey, R. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-08760-8_18 · Cited by 5
“Only some classes of problems can be solved by quantum computing, with a definite efficiency increase compared to classical computing [19].”
BackgroundReus, B. (2016) · Undergraduate topics in computer science · doi:10.1007/978-3-319-27889-6_23 · Cited by 1
Quantum-inspired tempering for ground state approximation using artificial neural networks
Albash, T., Smith, C., Campbell, Q., & Baczewski, A. (2023) · SciPost Physics · doi:10.21468/scipostphys.14.5.121 · Cited by 2
“To determine whether QPT can provide practical advantages over its standard counterpart, we use the time-to-epsilon (TT (cid:15) ) metric [44, 45], which is the time required to find a solution below a target relative error (cid:15) at least once with probability 0.99.”
MethodInfluentialКвантовые компьютеры и ультрахолодные атомы, "Природа"
Beterov, I. I. (2023) · Priroda · doi:10.7868/s0032874x23040014 · Cited by 1
Portfolio optimization based on quantum linear algorithm
Guo, Z., Song, T., & Lin, G. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad5c1d · Cited by 1
Subsampling factorization machine annealing
Hama, Y., & Kadowaki, T. (2025) · Physical Review Research · doi:10.1103/qgpq-6dmr · Cited by 4
Trojan Threats in Quantum Computing Hardware: SFQ Control and Readout Vulnerabilities
Adedokun, A., Mustafa, Y., & Köse, S. (2025) · IEEE International Conference on Secure IoT, Assured and Trusted Computing (SATC) · doi:10.1109/satc65530.2025.11137191 · Cited by 3
Relation of classical non-equilibrium dynamics and quantum annealing
Nishimori, H. (2015) · Journal of Physics Conference Series · doi:10.1088/1742-6596/638/1/012016 · Cited by 2
Das, A., & Suzuki, S. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02337-1 · Cited by 3
Classical Simulated Annealing Using Quantum Analogues
Cour, B. R. L., Troupe, J. E., & Mark, H. M. (2016) · Journal of Statistical Physics · doi:10.1007/s10955-016-1570-4 · Cited by 1
Experimental progress of quantum machine learning based on spin systems
Tian, Y. P., Lin, Z., Wang, X., Che, L., & Lu, D. (2021) · Acta Physica Sinica · doi:10.7498/aps.70.20210684 · Cited by 2
Experimental demonstration of a quantum anomaly induced by borders
Wang, Y., Lu, Y., Gao, J., Wu, L.-A., & Jin, X. (2021) · Physical Review A · doi:10.1103/physreva.104.022419 · Cited by 1
Solving a puzzle with atomic qubits
Schleier-Smith, M. (2022) · Science · doi:10.1126/science.abq3754 · Cited by 1
Altschuler, E. L., & Williams, T. J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.03136 · Cited by 1
Hard combinatorial problems and minor embeddings on lattice graphsPreprint
Lucas, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.01789 · Cited by 1
Open-system modeling of quantum annealing: theory and applications
Yip, K.-W. (2021) · arXiv (Cornell University) · doi:10.25549/usctheses-c89-443939 · Cited by 3
Mohseni, M., Rams, M. M., Isakov, S. V., Eppens, D., Pielawa, S., Strümpfer, J., Boixo, S., & Neven, H. (2021) · arXiv (Cornell University) · Cited by 1
Self-citationQuantum annealing for microstructure equilibration with long-range elastic interactionsPreprint
Sandt, R., Bouar, Y. L., & Spatschek, R. (2023) · Research Square · doi:10.21203/rs.3.rs-2509830/v1 · Cited by 1
Efficient low temperature Monte Carlo sampling using quantum annealingPreprint
Sandt, R., & Spatschek, R. (2023) · Research Square · doi:10.21203/rs.3.rs-2624280/v1 · Cited by 1
Large-Scale Simulation of Shor's Quantum Factoring AlgorithmPreprint
Willsch, D., Willsch, M., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2308.05047 · Cited by 1
“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 %”
BackgroundKinematics variables of Higgs and background data
Zlokapa, A. (2020) · CaltechDATA · doi:10.22002/d1.1335 · Cited by 1
Introduction and Essential Physics
Shadbolt, P. (2015) · Springer theses · doi:10.1007/978-3-319-21518-1_1
Numerical Studies of the Quantum Adiabatic Algorithm
Young, A. P., & Hen, I. (2015) · Journal of Physics Conference Series · doi:10.1088/1742-6596/640/1/012038
“Thus one can compare the running time of real quantum hardware with that of numerical simulations, both classical and simulated quantum annealing, for non-trivial optimization problems [11, 17].”
BackgroundZhu, Z., Ochoa, A. J., & Katzgraber, H. G. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.174425 · Cited by 1
2D implementation of quantum annealing algorisms for fourth order binary optimization problemsPreprint
Tang, Y., & Miao, G. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.03887
“equal to (2,4) (1,3) z z and (2,3) (1,4) z z .”
BackgroundInfluentialCOMPILING PROGRAMS FOR AN ADIABATIC QUANTUM COMPUTER
Snow-Kropla, E. (2014) · DalSpace (Dalhousie University)
Topological phenomena explored in a programmable quantum simulation
Troyer, M. (2018) · Nature · doi:10.1038/d41586-018-05979-0
Self-citationQuantum Computing for Training
Schuld, M., & Petruccione, F. (2018) · Quantum science and technology · doi:10.1007/978-3-319-96424-9_7
Recent Developments in Quantum Computers and Quantum Annealing Machines
Kawabata, S. (2018) · TEION KOGAKU (Journal of Cryogenics and Superconductivity Society of Japan) · doi:10.2221/jcsj.53.271
Exact diagonalization studies of quantum simulators
Raventós, D. (2019) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-132776
“The first commercially accessible quantum annealers are in the market [223, 244, 245].”
BackgroundHashizume, T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.11537
“It is suggested that quantum simulators can be used for solving computationally hard optimisation problems and performing quantum chemistry simulations [63, 64].”
BackgroundQuantum-inspired Search Method for Low-energy States of Classical Ising Hamiltonians
Ueda, H., Otsuka, Y., & Yunoki, S. (2022) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.91.044005
Statistical Analysis of Quantum AnnealingPreprint
Song, X., Wang, Y., Wu, S., & Kim, D. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.06854
Approaches Based on the Ising Model
Schuld, M., & Petruccione, F. (2021) · Quantum science and technology · doi:10.1007/978-3-030-83098-4_8
Breakdown of the weak coupling limit in experimental quantum annealing.Preprint
Bando, Y., Yip, K.-W., Chen, H., Lidar, D. A., & Nishimori, H. (2021) · arXiv (Cornell University)
Self-citationA Quantum Annealing Approach to Reduce Covid-19 Spread on College CampusesPreprint
Sud, J., & Li, V. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.01220
“However, the investigation of quantum speedups over more general problem instance sets has led to more inconclusive or instance-dependent results [28], [29].”
A Quantum Future: Preparing Canada for the Potential Impacts of Quantum Computing
Shoja, S. (2021) · doi:10.32920/ryerson.14661315.v1 · Cited by 1
(2016) · SciPost Physics · doi:10.21468/scipost.report.47
(2017) · SciPost Physics · doi:10.21468/scipost.report.88
(2016) · SciPost Physics · doi:10.21468/scipost.report.40
The $$\langle $$Im|Possibility$$\rangle $$ of Quantum Annealing for Maximum Likelihood Estimation
Yoon, Y. J. (2022) · Studies in systems, decision and control · doi:10.1007/978-3-030-97273-8_31
Implementation Issues and Future Developments
Sheremet, I. A. (2022) · Springer eBooks · doi:10.1007/978-3-031-13858-4_12
Battleship, tomography and quantum annealing
Casper, W. R., & Grimes, T. (2023) · European Journal of Applied Mathematics · doi:10.1017/s0956792522000377
Optimization of Coulomb glass system using extremal optimization at small disorder.
Sharma, N., & Malik, V. (2023) · Chinese Journal of Physics · doi:10.1016/j.cjph.2023.02.002
Khumalo, M. T., Prag, K., & Nixon, K. J. (2022) · International Conference on Soft Computing & Machine Intelligence (ISCMI) · doi:10.1109/iscmi56532.2022.10068445 · Cited by 2
“There is a quantum search algorithm for NP -complete problems with O ( √ N ) showing that quantum computing could be more efficient at finding solutions to optimisation problems than classical computers [25], [26].”
Background(2022) · SciPost Physics · doi:10.21468/scipost.report.6207
(2022) · SciPost Physics · doi:10.21468/scipost.report.6306
Albash, T., Smith, C. C., Campbell, Q., et al. (2022) · SciPost Physics · doi:10.21468/scipost.report.6362
Albash, T., Smith, C., Campbell, Q., et al. (2022) · SciPost Physics · doi:10.21468/scipost.report.6328
Computational Algorithm Design in Quantum Systems
Kaswan, K. S., Dhatterwal, J. S., Baliyan, A., & Rani, S. (2023) · Wiley eBooks · doi:10.1002/9781394157846.ch5
Vision Towards Quantum Humanities: An Architecture of a Holistic QML Environment
Barzen, J. (2023) · Congress in Computer Science, Computer Engineering, and Applied Computing (CSCE) · doi:10.1109/csce60160.2023.00270
Chinnusamy, T. R., Raja, V. L., Gopalakrishnan, T., & Manikandan, R. (2024) · Research Square · doi:10.21203/rs.3.rs-5439496/v1
Cohesive Quantum Circuit Layer Construction with Reinforcement Learning
Zorn, M., Stein, J., Altmann, P. J., Kölle, M., Linnhoff–Popien, C., & Gabor, T. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00201 · Cited by 2
“…grow, even with the limitations of recent noisy intermediate scale quantum (NISQ) hardware [2], concepts and ideas for utilizing the potential computing speedup of quantum computing [3] have been furthered and influenced by the latest advances in classical computing, machine learning in particular.”
Generation of Fixed Margin Binary Matrices Using Quantum Annealing
Bergerault, A., Fortunato, D., & Abreu, R. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10277
Interplay of resources for universal continuous-variable quantum computing
Upreti, V., & Chabaud, U. (2026) · Physical Review Research · doi:10.1103/2str-dhrg · Cited by 13
Quantum Amplitude‐Phase Judgment Circuits for Full Quantization Algorithms
Dong, Z., Wang, H., Zeng, Y., & Chang, S. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202400596
The Fundamental Theorem for Eco-Environmental Surface Modelling
Yu, G., Zhao, N., Shi, W., & Fan, Z. (2025) · Springer eBooks · doi:10.1007/978-981-96-1977-1_2
Quantum‐Enhanced Simulated Annealing Using Rydberg Atoms
Jeong, S., Park, J., & Ahn, J. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500070 · Cited by 6
“[42–45] At the end of this evolution, measuring the atoms yields a result corresponding to a low-energy state of H MIS , which provides an approximate solution to the MIS problem.”
Reflective Metasurfaces with Quantum Annealing Algorithms
Zhang, S.-H., Zhou, P.-Y., He, Z., Wang, Y., Ma, Y., & Ding, D. (2025) · IEEE MTT-S International Conference on Numerical Electromagnetic and Multiphysics Modeling and Optimization · doi:10.1109/nemo62710.2025.11215581
Adaptive quantum optimization algorithms for programmable atom-cavity systems
Luo, Y., Li, X., & Lin, J. H. (2025) · Physical Review A · doi:10.1103/515w-htjp · Cited by 2
Machine learning for quantum control and information processing in trapped-ion systems
JiaChong, L., Ding, G., Quan, Y., MingZhe, Y., & Mang, F. (2025) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma-2025-0278
“这些特性赋予量子计算 机强大的并行运算能力 , 能够提供经典计算机不 具备的计算资源 , 可用来实现对于算法的加速 , 也被称为量子加速 [136] , 有望解决经典计算机难 以或无法解决的问题 .”
Quantum annealing and condensed matter physics
Kendon, V. M., & Chancellor, N. (2026) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/ae5906 · Cited by 5
“These categories can further be determined based on behaviour at low temperature and transverse field, as explained in. Figure adapted from figure 5 of, which also uses this system to analyse frozen-in fluctuations on a superconducting flux-qubit quantum annealer operating in the quasistatic regime.”
A quantum genetic algorithm with application to cosmological parameters estimation
Sarracino, G., Cardone, V. F., Scaramella, R., Riccio, G., Bulgarelli, A. A., Burigana, C., Cappelli, L., Cavuoti, S., Farsian, F., Graziotti, I., et al. (2026) · Astronomy and Computing · doi:10.1016/j.ascom.2026.101078 · Cited by 3
“…been followed for a variety of applications (Lucas, 2014; Or´us et al., 2019), but it has also faced di ff erent challenges related to the hardware implementations of algorithms, even if potential improvements on the classical results have been found (Rønnow et al., 2014; Tasse ff et al., 2024).”
A Hybrid Population PDHG Heuristic for Feasibility Recovery in Mixed-Integer ProgrammingPreprint
Cao, J. X. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6393594
Bamboria, S., Dodiya, K. R., & Kumar, K. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-4347-1.ch013
PulseCIM: A Preconditioned Lookahead Simulated Coherent IsingMachinePreprint
Bonici, M. M., & Salloum, H. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6446548
Dynamical study of diatomics : applications to astrochemistry, quantum control and quantum computing
Vranckx, S. (2014) · theses.fr (ABES) · doi:10.70675/2731ecabzdce4z4ef8z887az492f71137b44 · Cited by 1
“] housed inside a cryogenics system within a 10 square meter shielded room” [266], skeptics such as Massachusetts Institute of Technology professor Scott Aaronson have tempered these assertions [267] and a team led by Matthias Troyer from ETH Zurich‡ recently found no conclusive evidence of quantum speedup during a co…”
BackgroundMapping of fermionic lattice models for Ising solvers
Nagpal, L., Kumar, A., & Hassan, S. R. (2026) · Scientific Reports · doi:10.1038/s41598-026-44886-7 · Cited by 1
Étude des performances des machines à recuit quantique pour la résolution de problèmes combinatoires
Vert, D. (2021) · theses.fr (ABES) · doi:10.70675/785ae50cz79e3z4923zb9a6zfd30be202ce4 · Cited by 1
Quantum algorithms for energy management optimization problems
Veshchezerova, M. (2022) · theses.fr (ABES) · doi:10.70675/f0d70a66z3066z4c81z8aa7zf9e72830f940 · Cited by 6
Supervised learning in binary dynamical physical systems through energy minimization
Laydevant, J. (2022) · theses.fr (ABES) · doi:10.70675/efd1c35czdc85z40bdzb5d3zd973c7dde220
Quantum approaches for Worst-Case Execution-Times analysis of programs
Bettonte, G. (2023) · theses.fr (ABES) · doi:10.70675/d34d7258z6ae2z430bzbab6zfc3ca093b036 · Cited by 1
Performance evaluation and control improvements for solving optimization problems on NISQ platforms
Gilbert, V. (2024) · theses.fr (ABES) · doi:10.70675/81f9c638z5867z40e4zaed8ze9824ff5a163 · Cited by 1
Optical computing implementation of Shor's factorization algorithm
Chen, S., Chen, H., Tang, X., Sun, Y., & Zhang, X. (2026) · Physical Review A · doi:10.1103/4sc8-5gmk
Curato, G., Ponzi, M., Chiatello, E., & Giorgetti, R. (2026) · APS Open Science · doi:10.1103/hj46-qw5t
Simulated Quantum Annealing of the Wishart Planted Ensemble
Burlakov, E. V., & Yarygin, M. A. (2026) · Wave Electronics and its Application in Information and Telecommunication Systems (WECONF) · doi:10.1109/weconf69969.2026.11553816
“For both quantum devices and classical methods, the lack of representative benchmarks remains a central challenge: test instances must enable objective comparison and assess the practical advantage of quantum resources [22].”
Network-based prediction of drug combinations with quantum annealing
Ramos, D., Coutinho, B. C., & Magano, D. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00411-7 · Cited by 1
Evaluating the Solution Performance of the Augmented Lagrangian Function on Ising Machines
Awai, S., Itoh, T., Takahashi, K., Tanahashi, K., & Tanaka, S. (2026) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.95.094004
Quantum annealing: optimisation, sampling, and many-body dynamics
Abel, S. A., Constantin, A., & Nutricati, L. A. (2026) · Contemporary Physics · doi:10.1080/00107514.2026.2675146 · Cited by 1
“The standard performance metric in this regime is the time-to-solution (TTS), defined as the expected time required to observe at least one optimal configuration with a chosen target success probability p [23].”
InfluentialBarati, C. N., Croitoru, A., Gore, R. J., Jarret, M., Kennedy, W. G., Maciejunes, A., Malikov, M., & Mendelson, S. S. (2026) · SIMULATION · doi:10.1177/00375497261467053
SATIC: An Optimizing Ising Compiler for SAT(isfiability)
Efe, A., Cılasun, H., Kumar, A., Prova, N. S., Zeng, Z., Islam, T., Yin, R. S., Li, C., Kreye, P., Kim, C. H., et al. (2026) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca66397.2026.00165 · Cited by 1
Hybrid artificial intelligence and quantum annealing as an optimization layer in drug discovery
Ou, C., Liao, J.-C., Huang, C., & Lee, O. K. (2026) · Patterns · doi:10.1016/j.patter.2026.101634
“62 Operational considerations such as cost, accessibility, and integration effort are also critical.”
InfluentialA comprehensive survey of quantum computing approaches for portfolio optimization in FinTech
Chiv, K., Nayyar, A., & Kim, T.-K. (2026) · ICT Express · doi:10.1016/j.icte.2026.07.025
Quantum Annealing Applications for Power Grid Modernization
Christeson, T. (2025) · Digital Commons - DU (University of Denver) · doi:10.56902/etdcrp.2025.223
Ma, Y., & Zheng, X. (2026) · IEEE International Symposium on the Application of Artificial Intelligence in Electrical Engineering (AAIEE) · doi:10.1109/aaiee69872.2026.11649868
Quantum Computing-Driven Optimization of Machine Learning Algorithms for Embedded Systems
Mańkowski, M., Zwoliński, B., Lewandowski, A., Stępień, A., Grzymkowski, Ł., & Stefański, T. P. (2026) · International Conference on Methods and Models in Automation and Robotics · doi:10.1109/mmar70562.2026.11667844
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.