Mathematical foundation of quantum annealing
Open accessThe DOI matches its Crossref record; 49 of the 50 references it cites were found in a registry or an index.
Abstract
Quantum annealing is a generic name of quantum algorithms that use quantum-mechanical fluctuations to search for the solution of an optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum computation. The present paper reviews the mathematical and theoretical foundations of quantum annealing. In particular, theorems are presented for convergence conditions of quantum annealing to the target optimal state after an infinite-time evolution following the Schrödinger or stochastic (Monte Carlo) dynamics. It is proved that the same asymptotic behavior of the control parameter guarantees convergence for both the Schrödinger dynamics and the stochastic dynamics in spite of the essential difference of these two types of dynamics. Also described are the prescriptions to reduce errors in the final approximate solution obtained after a long but finite dynamical evolution of quantum annealing. It is shown there that we can reduce errors significantly by an ingenious choice of annealing schedule (time dependence of the control parameter) without compromising computational complexity qualitatively. A review is given on the derivation of the convergence condition for classical simulated annealing from the view point of quantum adiabaticity using a classical-quantum mapping.
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 cited source doesn’t support the claim as written.
In the citing paper
“The adiabatic theorem of quantum mechanics ensures that QA identi fi es the optimal solution regardless of the size and landscape of the combinatorial parametric space, highlighting QA as a powerful and practical solver 11 -14 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [14]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measured
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
(1979) · Cited by 43,841
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Messiah, A. (1961) · Cited by 16,012
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · Cited by 15,411
Ground State of the Electron Gas by a Stochastic Method
Ceperley, D. M., & Alder, B. J. (1980) · Physical Review Letters · doi:10.1103/physrevlett.45.566 · Cited by 14,384
Doob, J. L., & Doob, J. L. (1953) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,053
Non-adiabatic crossing of energy levels
Zener, C. (1932) · Proceedings of the Royal Society of London Series A Containing Papers of a Mathematical and Physical Character · doi:10.1098/rspa.1932.0165 · Cited by 4,572
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
Non-negative Matrices and Markov Chains
Seneta, E. (1981) · Springer Series in Statistics · doi:10.1007/0-387-32792-4 · Cited by 2,807 · cited 1×
“The condition Γ(t) < Γ0 (t > t0) is unnecessary here because the off-diagonal element χ can always be chosen smaller than the diagonal elements by adding a positive constant to the diagonal.”
Background
Research works printed but not linked: 7
- T. Kadowaki , “Study of optimization problems by quantum annealing,” PhD thesis, Tokyo Institute of Technology, 1999;
- A. Das and B. K.Chakrabarti , e-print arXiv:0801.2193; · arXiv
- Quantum Annealing and Analog Quantum Computation
- 2006, J. Stat. Mech.: Theory Exp., P01008
- E. Farhi, J. Goldstone, S. Gutomann, and M. Sipser, e-print arXiv:quant-ph/0001106. · arXiv
- 1976, Quantum Mechanics
- 1963, J. Math. Mech., 12, 683
Cited by
Items 301–379 of 379
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
Graph Theoretic Algorithms Adaptable to Quantum Computing
Srivastava, S. (2021) · Deep Blue (University of Michigan) · doi:10.7302/1543 · Cited by 1
Quantum-Enhanced Policy Iteration on the Example of a Mountain CarPreprint
Nuzhin, E. E., & Yudin, D. I. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4582850 · Cited by 2
Optimization by Use of Nature in Physics Beyond Classical Simulated Annealing
Ohzeki, M. (2012) · InTech eBooks · doi:10.5772/50636
“Similarly to SA, the convergence into the optimal solution of QAC (the ground state) is also guaranteed by a mathematical proof [15].”
BackgroundMethodRe'class'ification of 'quant'ified classical simulated annealing
Tanaka, T. (2009) · Journal of Physics Conference Series · doi:10.1088/1742-6596/143/1/012020
Zhu, Z., Ochoa, A. J., & Katzgraber, H. G. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.174425 · Cited by 1
Statistical Mechanical Models of Integer Factorization Problem
Nakajima, C. H., & Ohzeki, M. (2016) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.86.014001
Quantum Annealing for Ising Anyonic Syatems
Sato, M. (2016)
Nanosilicon for quantum information
Rotta, D., & Prati, E. (2017) · CRC Press eBooks · doi:10.4324/9781315153551-32
A useful fundamental speed limit for the imaginary-time Schrodinger equationPreprint
Okuyama, M., & Ohzeki, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.09040 · Cited by 2
“Thus, the imaginary time adiabatic theorem [36, 37] does not give the optimal schedule [35].”
BackgroundNumerical Engineering of Adiabatic Quantum Operations
Tabatabaei, S. S. (2020) · UWSpace (University of Waterloo)
On the Theory of Modern Quantum Algorithms.Preprint
Biamonte, J. (2020) · arXiv (Cornell University)
Quantum-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
Generation of all-to-all connections in a two-dimensional qubit array with two-body interactions
Tanamoto, T. (2021) · Journal of Applied Physics · doi:10.1063/5.0033173
Statistical Analysis of Quantum AnnealingPreprint
Song, X., Wang, Y., Wu, S., & Kim, D. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.06854
“…derived under the unique ground state condition in an asymptotic sense, that is, we obtain some expressions or bounds for the leading terms of the ground state success probability by taking tf to go to infinity (Aharonov et al., 2008; Born and Fock, 1928; McGeoch, 2014; Morita and Nishimori, 2008).”
BackgroundInfluentialProperty of Quantum Decoding for Sourlas Codes of Which Tuples Are Randomly Decimated
Lee, S., Iwata, K., & Mimura, K. (2020) · International Symposium on Information Theory and its Applications
Hidden symmetries, spin and charge of artificial magnetic monopoles
Nesterov, A. I., & Berman, G. P. (2021) · Quantum Studies Mathematics and Foundations · doi:10.1007/s40509-021-00254-w
Benchmarks and Controls for Optimization with Quantum Annealing
Grant, E. (2020) · Cited by 2
Ichiki, A., & Ohzeki, M. (2026) · Journal of the Physical Society of Japan · doi:10.48550/arxiv.2107.01792
“where |ψ0(t)〉 and |ψ1(t)〉 denote the ground and the first excited states for the Hamiltonian Ĥ(t) at time t, respectively, and ∆t is the energy gap between these two states [25].”
BackgroundYan, B., & Sinitsyn, N. A. (2021) · arXiv (Cornell University)
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-citationMatsuzaki, Y., Imoto, T., & Susa, Y. (2022) · Research Square · doi:10.21203/rs.3.rs-1383320/v1 · Cited by 1
Nanosilicon for quantum information
Rotta, D., & Prati, E. (2017) · Series in materials science and engineering · doi:10.1201/9781315153551-33
Suzuki, S., Inoue, J., & Chakrabarti, B. K. (2012) · Lecture notes in physics · doi:10.1007/978-3-642-33039-1_9
Tokuhira, K., Nakamura, M., Kinjo, M., et al. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-031-19958-5_77
A quantum annealing approach to solve max-cover problem
Uyen, N. T., An, N. C., Trang, D. M., & Sang, T. X. (2022) · Vinh University Journal of Science · doi:10.56824/vujs.2022nt29
Automatic Generation of Evaluation Courses for Car Navigation Systems Via Combinatorial Optimization
Tomita, K., Kojima, K., Saito, S., Iwami, T., Matsumoto, R., Haba, R., & Ohzeki, M. (2023) · SAE technical papers on CD-ROM/SAE technical paper series · doi:10.4271/2023-01-0589
Effects of T-Factor on Quantum Annealing Algorithms for Integer Factoring Problem
Liu, Z., Zheng, S., Yan, X., Ping, P., & Wang, L. (2023) · Journal of quantum computing · doi:10.32604/jqc.2023.045572
Rajak, A., & Chakrabarti, B. K. (2024) · Indian Journal of Physics · doi:10.1007/s12648-023-03041-y
Optimization of credit scoring models combination based on quantum annealing
Zheng, X., Ma, Y., & Song, Z. (2023) · International Conference on Machine Learning and Computer Application (ICMLCA) · doi:10.1145/3650215.3650227
“Both theoretical studies [3] and numerical investigations [4] indicate that QA outperforms SA and other Monte Carlo methods under certain conditions.”
BackgroundApplication of quantum computing techniques in particle tracking at LHC
Chan, W. Y., Akiyama, D., Arakawa, K., et al. (2024) · EPJ Web of Conferences · doi:10.1051/epjconf/202429512001
“Quantum annealing is an optimization process to find the global energy minimum of a given Hamiltonian using quantum fluctuations [5].”
BackgroundSaida, D. (2024) · TEION KOGAKU (Journal of Cryogenics and Superconductivity Society of Japan) · doi:10.2221/jcsj.59.228
Fukada, K., Shirai, T., & Togawa, N. (2024) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2024vlp0008
“(1) [26].”
He, Z., Kemper, A. F., & Freericks, J. K. (2026) · APL Quantum · doi:10.1063/5.0293153
The Possible Impact of Quantum Annealing on Cybersecurity
Leśniak, M., Wroński, M., & Burek, E. (2024) · Safety & Defense · doi:10.37105/sd.216
“Quantum annealing, described in detail by Morita & Nishimori (2008), is a concept derived from the physical process used in metalworking, which involves heating the metal to a high temperature and then allowing it to cool slowly.”
Architectures for Quantum Information Processing
Upadhyay, S., Alam, M., & Ghosh, S. (2024) · Springer eBooks · doi:10.1007/978-981-97-9314-3_64
Optimization of conveyance of quantum particles by moving potential well
Morita, S., Teranishi, Y., & Miyashita, S. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043329
Self-citationQuantum 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
Kuji, H., Shingu, Y., Nikuni, T., Imoto, T., Sugisaki, K., & Matsuzaki, Y. (2025) · Physical Review A · doi:10.1103/physreva.111.042618
Relaxation-assisted reverse annealing on nonnegative/binary matrix factorization
Haba, R., Ohzeki, M., & Tanaka, K. (2025) · PLoS ONE · doi:10.1371/journal.pone.0323232 · Cited by 3
Future Use of Quantum Artificial Intelligence in Military Domains
Bureš, M., & Františ, P. (2025) · International Conference on Military Technologies · doi:10.1109/icmt65201.2025.11061344
“Note that in the mentioned approach, gates are not used, but qubits are arranged in such a way that when the algorithm is run, they reach the most energetically favourable state for them, as is common in nature [7].”
Network Vulnerability Analysis via Quantum Computing
Kennedy, A. P., Dinh, T. N., & Thai, M. T. (2024) · International Conference on Meta Computing (ICMC) · doi:10.1109/icmc60390.2024.00024
“Quantum Annealing is an approach to solving optimization problems via the use of the adiabatic theorem [33].”
Unveiling Privacy Risks in Quantum Optimization Services
Leśniak, M., Wroński, M., Syta, E., & Kutyłowski, M. (2025) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/3708821.3736213
Nakazawa, Y., Iwamoto, M., Watanabe, R., et al. (2025) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra55743.2025.11127290
“The Digital Annealer is a technology designed to solve complex combinatorial optimization problems at high speed, inspired by quantum phenomena and implemented through digital circuit design [13], [14].”
Kamijima, Y., & Sakai, A. (2025) · Mathematical Physics Analysis and Geometry · doi:10.1007/s11040-025-09525-z
“It has also become popular in the field of computer science, due to its application to combinatorial optimization problems using quantum annealing (e.g., [29, 30, 31]).”
Quantum Machine Learning: Applications in Electrical Engineering
Rajalakshmi, A., Sajan, M. R., & Krishna, K. (2025) · IFIP advances in information and communication technology · doi:10.1007/978-3-031-98364-1_28
Quantum speedup for solving the one-dimensional Hubbard model using quantum annealing
Vyas, K., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2026) · Physical Review Research · doi:10.1103/bj6c-t252 · Cited by 2
Comparing gate and annealing-based quantum computing for configuration-based design tasks
Schiffmann, O., Gopsill, J., & Hicks, B. J. (2025) · Design Science · doi:10.1017/dsj.2025.10028 · Cited by 1
““ Quantum tunnelling between different classical states replaces thermal hopping in SA ” (Morita & Nishimori 2008).”
Magnetic hysteresis experiments performed on quantum annealers
Pelofske, E., Barrows, F. P., Sathe, P., & Nisoli, C. (2026) · Science Advances · doi:10.1126/sciadv.aeb5192 · Cited by 7
Investigating the Usage and Evaluation of Quantum Computing Technologies for Information Access
Pasin, A. (2025) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3746252.3761656
“Whereas the gate model applies discrete sequences of gates, quantum annealing exploits the adiabatic theorem to steer a system towards the ground state of a problem Hamiltonian [12].”
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
Q-CHOP: Quantum constrained Hamiltonian optimization
Perlin, M. A., Shaydulin, R., Hall, B., Minssen, P., Li, C., Dubey, K., Rines, R., Anschuetz, E. R., Pistoia, M., & Gokhale, P. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3778864 · Cited by 6
Local techniques in quadratic optimization and Satisfiability, and their applications
Wang, C. (2014) · Summit (Simon Fraser University)
Additional file 1 of Quantum annealing-aided design of an ultrathin-metamaterial optical diode
Kim, S., Park, S.-J., Moon, S., Zhang, Q., Hwang, S., Kim, S.-K., Luo, T., & Lee, E. (2024) · Figshare · doi:10.6084/m9.figshare.25792797
Endo, S., Kawakatsu, S., Matsuyama, H., Suzuki, K., & Matsuzaki, Y. (2025) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/ae2cd3
Digitized Adiabatic Bayesian Update via Quantum Approximate Optimization Algorithm
Bunk, N., & Govaers, F. (2025) · Sensor Data Fusion: Trends, Solutions, Applications (SDF) · doi:10.1109/sdf67080.2025.11330688
“…T ) and a nonva-nishing minimum energy gap between the ground and first excited state, the adiabatic theorem keeps the state near the instantaneous ground state of H ( t ) ; moderate nonadiabaticity yields Gibbs-like statistics concentrated on low energies [13]. a) Cost from the Bayesian quadratic.”
InfluentialNetwork separation modeling and quantum computing for developing wildfire fuelbreak strategy
Dent, S., Stoddard, K., Smith, M., Strelzoff, A., Cummings, C. L., Cegan, J. C., & Linkov, I. (2026) · Communications Engineering · doi:10.1038/s44172-026-00585-9
“For the quantum computing method, D-Wave uses quantum annealing, which shares similarities withits classical counterpart, simulated annealing, although it is often more ef fi cient 22,23 .”
Approximating Ground States of Quantum Hamiltonians with Snapshot-QAOA
Tate, R., Langfitt, Q., Pelofske, E., Kirmani, A. A., Bärtschi, A., Golden, J. K., & Eidenbenz, S. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00035 · Cited by 1
Alawir, M., Alatasi, M. A., Salloum, H., & Mazzara, M. (2025) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-032-00914-2_21
Maruyama, N., Ohzeki, M., & Tanaka, K. (2026) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.95.034001 · Cited by 1
Quantum algorithms for scheduling problems: a survey
Werner, T., & Ullinger, F. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00494-y · Cited by 6
Modeling of deformation twinning in BCC metals via quantum annealing
dos Santos, L. C. P., Dollmann, A., Greiner, C., Grüner, D., Bouar, Y. L., & Spatschek, R. (2026) · Discover Materials · doi:10.1007/s43939-026-00612-8
É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
Multi-tasking through quantum annealing
Artag, J., Awaya, K., Kanezashi, T., Tsukayama, D., Shimada, M., & Shirakashi, J. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00504-z
“Quantum annealing has emerged as a promising approach for solving complex combinatorial optimization problems by leveraging the quantum mechanical properties to explore extensive solution spaces[1, 2].”
Quantum algorithms for energy management optimization problems
Veshchezerova, M. (2022) · theses.fr (ABES) · doi:10.70675/f0d70a66z3066z4c81z8aa7zf9e72830f940 · Cited by 6
Analog Quantum Computing for NP-Hard Combinatorial Graph Problems
Braida, A. (2024) · theses.fr (ABES) · doi:10.70675/ddc8a4b2z9f68z49d3z91e1zc1d6664298b1 · Cited by 2
3‐D Hybrid Full Waveform Inversion of Earthquake Data for the Crustal Velocity Estimation
Zhang, S., Zhao, Z., Sen, M. K., et al. (2026) · Journal of Geophysical Research Solid Earth · doi:10.1029/2025jb032987
“Compared to the local optimization strategies, traditional global optimization methods often require much more computations to comprehensively explore the model space (Chakraborty & Kar, 2017; Earl & Deem, 2005; Morita & Nishimori, 2008).”
Curato, G., Ponzi, M., Chiatello, E., & Giorgetti, R. (2026) · APS Open Science · doi:10.1103/hj46-qw5t
High-Speed Simulated Quantum Annealing Based on Edge-Mapped/Iterative Hamiltonian Updating for TSP
Tian, B., Onizawa, N., & Hanyu, T. (2026) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl68998.2026.00033
Abe, T., Hino, K., & Tanaka, S. (2026) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.95.074003
Extending the computational reach of quantum annealing using reverse annealing
Menger, L. J., Lippert, T., & Jattana, M. S. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00562-3
“The mixing Hamiltonian H M describes the application of a uniform transverse field on all qubits enabling tunneling between local minima and exploration of the solution space [15, 16].”
Beyond optimization: Harnessing quantum annealer dynamics for machine learning
Anonymous, Hayashi, A., MATSUMORI, T., Kaji, D., Kadowaki, T., & Nemoto, K. (2026) · Physical Review Research · doi:10.1103/dcvc-blqy · Cited by 1
Computing the Molecular Ground State Energy in a Restricted Active Space Using Quantum Annealing
Bruni, S., & Prati, E. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70368
“Quantum annealing (QA) is an heuristic optimization technique that exploits quantum fluctuations to search for the ground state of a problem Hamiltonian [ 21 ].”
QUANG, T. N., Matsuyama, K., Shimizu, K., Sugano, H., Kurimoto, E., Suzuki, J., Chen, Z., Waidyasooriya, H. M., Kosei, N., Hariyama, M., et al. (2026) · IEEE Access · doi:10.1109/access.2026.3717906 · Cited by 1
“Its theoretical foundation is based on the quantum adiabatic theorem [20], [21], and it has shown potential advantages over SA in certain problem classes [17], [22], [23].”
Boltzmann sampling of frustrated J 1 − J 2 Ising models with programmable quantum annealers
Anonymous (2026) · Physical Review Research · doi:10.1103/2xc3-815x · Cited by 1
Quantum Annealing Applications for Power Grid Modernization
Christeson, T. (2025) · Digital Commons - DU (University of Denver) · doi:10.56902/etdcrp.2025.223
Nonlinear Model Predictive Control for Spacecraft Rendezvous via Quantum Optimization
Marchioli, V., Boggio, M., Volpe, D., Barbara, C., & Novara, C. (2026) · IEEE International Conference on Quantum Control, Computing and Learning (qCCL) · doi:10.1109/qccl70331.2026.11668577
Metadata
- Authors
- Morita, S., & Nishimori, H.
- Affiliations
- Scuola Internazionale Superiore di Studi Avanzati (IT)
- Tokyo Institute of Technology (JP)
- Venue
- Journal of Mathematical Physics
- Publisher
- AIP Publishing
- Published
- 2008-12-01
- Volume
- 49
- Issue
- 12
- ISSN
- 0022-2488 (ISSN-L)
- 1089-7658
- OpenAlex
- W2019013791
- Semantic Scholar
- 32053071882c8ec7ee89adb5d06b19ca7d13ab84
- Cited by
- 381
- References
- 50
- Citations by year
- 2026: 24 · 2025: 61 · 2024: 55 · 2023: 43 · 2022: 36 · 2021: 32 · 2020: 18 · 2019: 22 · 2018: 15 · 2017: 14 · 2016: 11 · 2015: 17 · 2014: 6 · 2013: 5 · 2012: 8
- FWCI
- 7.39
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Journal of Mathematical Physics (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 Mechanics and Applications
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum annealing, quantum adiabatic evolution, optimization problems, convergence conditions, Schrödinger dynamics, stochastic dynamics, Monte Carlo dynamics, annealing schedule, error reduction, simulated annealing
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.