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
Programmable Quantum Simulations of Spin Systems with Trapped Ions
Monroe, C., Campbell, W. C., Duan, L. M., Gong, Z. X., Gorshkov, A. V., Hess, P., Islam, R., Kim, K., Linke, N., Pagano, G., et al. (2019) · arXiv · doi:10.48550/arxiv.1912.07845 · Cited by 806
Programmable quantum simulations of spin systems with trapped ions
Monroe, C., Campbell, W. C., Duan, L.-M., Gong, Z.-X., Gorshkov, A. V., Hess, P. W., Islam, R., Kim, K., Linke, N. M., Pagano, G., et al. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.025001 · Cited by 802
Quantum annealing for industry applications: introduction and review
Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac8c54 · Cited by 341
“An approach closely related to AQC is QA [44, 81, 122, 126, 172], proposed in 1988 by Apolloni et al [10].”
Experimental signature of programmable quantum annealing
Boixo, S., Albash, T., Spedalieri, F. M., Chancellor, N., & Lidar, D. A. (2013) · Nature Communications · doi:10.1038/ncomms3067 · Cited by 293
Quantum Optimization of Fully Connected Spin Glasses
Venturelli, D., Mandrà, S., Knysh, S., O’Gorman, B., Biswas, R., & Smelyanskiy, V. (2015) · Physical Review X · doi:10.1103/physrevx.5.031040 · Cited by 209
“While the founding principles of the technique have been investigated numerically [3], analytically [4,5], and experimentally [6] in the past decade, the disordered, interacting, time-dependent, and open nature of the many-body problem makes it very hard to draw universal conclusions about the power of the technique […”
BackgroundError-corrected quantum annealing with hundreds of qubits
Pudenz, K. L., Albash, T., & Lidar, D. A. (2014) · Nature Communications · doi:10.1038/ncomms4243 · Cited by 198
“The functions A and B are the ones appearing in equations (2) and (5).”
BackgroundMethodEfficient partition of integer optimization problems with one-hot encoding
Okada, S., Ohzeki, M., & Taguchi, S. (2019) · Scientific Reports · doi:10.1038/s41598-019-49539-6 · Cited by 190
Quantum annealing: an overview
Rajak, A., Suzuki, S., Dutta, A., & Chakrabarti, B. K. (2023) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2021.0417 · Cited by 166
Exotic freezing of response in a quantum many-body system
Das, A. (2010) · Physical Review B · doi:10.1103/physrevb.82.172402 · Cited by 163
Decoherence in adiabatic quantum computation
Albash, T., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.91.062320 · Cited by 151
“(57) In this setting adiabatic quantum computing is also known as quantum annealing [41, 73].”
BackgroundAdiabatic Quantum Computation and Quantum Annealing: Theory and Practice
McGeoch, C. C. (2014) · Synthesis lectures on quantum computing · doi:10.2200/s00585ed1v01y201407qmc008 · Cited by 340
Katzgraber, H. G., Hamze, F., & Andrist, R. S. (2014) · Physical Review X · doi:10.1103/physrevx.4.021008 · Cited by 140
“Although it has been shown theoretically [17], as well as with numerical experiments [8] that quantum annealing should, in principle, outperform classical (thermal) optimization algorithms (such as simulated annealing [2]) on an algorithmic level, when applied to a class of random edge-weight…”
BackgroundQuantum annealing with antiferromagnetic fluctuations
Seki, Y., & Nishimori, H. (2012) · Physical Review E · doi:10.1103/physreve.85.051112 · Cited by 131
Self-citationConsistency tests of classical and quantum models for a quantum annealer
Albash, T., Vinci, W., Mishra, A., Warburton, P. A., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.91.042314 · Cited by 131
Bapst, V., Foini, L., Krzakala, F., Semerjian, G., & Zamponi, F. (2013) · Physics Reports · doi:10.1016/j.physrep.2012.10.002 · Cited by 127
“The relevant gap is in the latter case the one of the quantum Hamiltonian Ĥ , while in the former case it is the one of the Fokker-Planck generator of the PIMC dynamics on the space of path configurations; we refer to [24, 246] for further analysis of this PIMC annealing.”
BackgroundMethodInfluentialReverse annealing for the fully connected p -spin model
Ohkuwa, M., Nishimori, H., & Lidar, D. A. (2018) · Physical Review A · doi:10.1103/physreva.98.022314 · Cited by 111
Self-citationMandrà, S., Zhu, Z., Wang, W., Perdomo-Ortiz, A., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.94.022337 · Cited by 111
Quantum annealing of the graph coloring problem
Titiloye, O., & Crispin, A. J. (2011) · Discrete Optimization · doi:10.1016/j.disopt.2010.12.001 · Cited by 109
Bapst, V., Foini, L., Krząkała, F., Semerjian, G., & Zamponi, F. (2012) · HAL · Cited by 123
Control of Automated Guided Vehicles Without Collision by Quantum Annealer and Digital Devices
Ohzeki, M., Miki, A., Miyama, M. J., & Terabe, M. (2019) · Frontiers in Computer Science · doi:10.3389/fcomp.2019.00009 · Cited by 102
“When the protocol of QA follows the quantum adiabatic condition, the ground state can be efficiently attained (Suzuki and Okada, 2005; Morita and Nishimori, 2008; Ohzeki and Nishimori, 2011b).”
MethodQuantum annealing correction for random Ising problems
Pudenz, K. L., Albash, T., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.91.042302 · Cited by 101
Albash, T., Rønnow, T. F., Troyer, M., & Lidar, D. A. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02346-0 · Cited by 96
Exponential Enhancement of the Efficiency of Quantum Annealing by Non-Stoquastic Hamiltonians
Nishimori, H., & Takada, K. (2017) · Frontiers in ICT · doi:10.3389/fict.2017.00002 · Cited by 81
Self-citationSeeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
Katzgraber, H. G., Hamze, F., Zhu, Z., Ochoa, A. J., & Munoz-Bauza, H. (2015) · Physical Review X · doi:10.1103/physrevx.5.031026 · Cited by 88
“The advantage of such an approach lies in having to compare only the performance hit felt by a given algorithm and/or architecture when the instance complexity is increased.”
BackgroundImproving solutions by embedding larger subproblems in a D-Wave quantum annealer
Okada, S., Ohzeki, M., Terabe, M., & Taguchi, S. (2019) · Scientific Reports · doi:10.1038/s41598-018-38388-4 · Cited by 92
“ments are forbidden. The computational time Tprop for the proposed algorithm and the number Nbreadth of the shortest paths searched by the breadth-first search are given by Tprop ∼O(NbreadthTbreadth), (13) Nbreadth ∼|Ep|. (14) The computationaltime Tbreadth for the breadth-firstsearch is given by Tbreadth ∼O |eq| , (15)…”
MethodBenchmarking Quantum Annealing Controls with Portfolio Optimization
Grant, E., Humble, T. S., & Stump, B. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.014012 · Cited by 90
“[5] Satoshi Morita and Hidetoshi Nishimori.”
BackgroundSeeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
Katzgraber, H. G., Hamze, F., Zhu, Z., Ochoa, A. J., & Munoz-Bauza, H. (2015) · OakTrust (Texas A&M University Libraries) · Cited by 86
A deceptive step towards quantum speedup detection
Mandrà, S., & Katzgraber, H. G. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aac8b2 · Cited by 82
Scaling and Diabatic Effects in Quantum Annealing with a D-Wave Device
Weinberg, P., Tylutki, M., Rönkkö, J. M., Westerholm, J., Åström, J. A., Manninen, P., Törmä, P., & Sandvik, A. W. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090502 · Cited by 77
Multivariable optimization: Quantum annealing and computation
Mukherjee, S., & Chakrabarti, B. K. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02339-y · Cited by 99
“alization of the wave functions while penetrating energy barriers, as the phases of the transmitted waves are completely random. However several recent theoretical and experimental studies (see e.g., [9,10,11,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32]) seem to have cleared almost all such doubts. Recent…”
BackgroundMethodDynamics of reverse annealing for the fully connected p -spin model
Yamashiro, Y., Ohkuwa, M., Nishimori, H., & Lidar, D. A. (2019) · Physical Review A · doi:10.1103/physreva.100.052321 · Cited by 93
Self-citationQuantum Volume in Practice: What Users Can Expect From NISQ Devices
Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3184764 · Cited by 75
“Lastly, the QV metric is designed specifically for gate model (i.e. universal) quantum computation devices; however there are restricted quantum computational devices in the NISQ-era including Quantum Annealers [19, 29, 44, 35, 13, 31] and Boson Samplers [24, 6, 48, 1].”
Zhu, Z., Ochoa, A. J., Schnabel, S., Hamze, F., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.93.012317 · Cited by 76
“The fact that different numerical studies [9, 10, 13, 34] demonstrated that QA might outperform SA in certain problems—especially those with rough energy landscapes— has motivated the authors of Refs.”
BackgroundGround-state statistics from annealing algorithms: quantum versus classical approaches
Matsuda, Y., Nishimori, H., & Katzgraber, H. G. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/7/073021 · Cited by 74
Self-citationMandrà, S., Zhu, Z., & Katzgraber, H. G. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.070502 · Cited by 72
Breaking limitation of quantum annealer in solving optimization problems under constraints
Ohzeki, M. (2020) · Scientific Reports · doi:10.1038/s41598-020-60022-5 · Cited by 64
Quantum annealing with antiferromagnetic transverse interactions for the Hopfield model
Seki, Y., & Nishimori, H. (2015) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/48/33/335301 · Cited by 62
Self-citationQuantum machine learning algorithms for anomaly detection: A review
Corli, S., Moro, L., Dragoni, D., Dispenza, M., & Prati, E. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.107632 · Cited by 105
Feature selection on quantum computers
Mücke, S., Heese, R., Müller, S., Wolter, M., & Piatkowski, N. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00099-z · Cited by 86
“Two common approaches are the Variational Quantum Eigensolver (VQE) (Peruzzo et al, 2014), which is suitable for quantum gate computers, and Quantum Annealing (QA) (Kad-owaki and Nishimori, 1998; Morita and Nishimori, 2008), which is suitable for quantum annealers.”
BackgroundMethodMax 2-SAT with up to 108 qubits
Santra, S., Quiroz, G., Ver Steeg, G., & Lidar, D. A. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/4/045006 · Cited by 60
Quantum Optimization: Potential, Challenges, and the Path Forward
Abbas, A., (NNSA), U. N. N. S. A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D., et al. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2229681 · Cited by 67
Quantum annealing of the p -spin model under inhomogeneous transverse field driving
Susa, Y., Yamashiro, Y., Yamamoto, M., Hen, I., Lidar, D. A., & Nishimori, H. (2018) · Physical Review A · doi:10.1103/physreva.98.042326 · Cited by 58
Self-citationNested quantum annealing correction
Vinci, W., Albash, T., & Lidar, D. A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.17 · Cited by 57
A Review of Machine Learning Classification Using Quantum Annealing for Real-World Applications
Nath, R. K., Thapliyal, H., & Humble, T. S. (2021) · SN Computer Science · doi:10.1007/s42979-021-00751-0 · Cited by 52
Quantum mapping algorithm for structural non-probabilistic reliability optimization
Xu, Y., Wang, X., & Wang, Z. (2025) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-025-04085-w · Cited by 55
“Representative studies include the Quantum Annealing Algorithm (QA) (Morita and Nishimori 2008) and the Multi-scale Quantum Harmonic Oscillator Algorithm (MQHOA) (Mu et al. 2020).”
Quantum pattern recognition with liquid-state nuclear magnetic resonance
Neigovzen, R., Neves, J. L., Sollacher, R., & Glaser, S. J. (2009) · Physical Review A · doi:10.1103/physreva.79.042321 · Cited by 50
Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2023) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-32041-5_13 · Cited by 47
A Pattern Recognition Algorithm for Quantum Annealers
Bapst, F., Bhimji, W., Calafiura, P., et al. (2019) · Computing and Software for Big Science · doi:10.1007/s41781-019-0032-5 · Cited by 49
Quantum Semantic Learning by Reverse Annealing of an Adiabatic Quantum Computer
Rocutto, L., Destri, C., & Prati, E. (2020) · Advanced Quantum Technologies · doi:10.1002/qute.202000133 · Cited by 49
Uncertain fate of fair sampling in quantum annealing
Könz, M. S., Mazzola, G., Ochoa, A. J., Katzgraber, H. G., & Troyer, M. (2019) · Physical Review A · doi:10.1103/physreva.100.030303 · Cited by 69
Dalyac, C., Henriet, L., Jeandel, E., Lechner, W., Perdrix, S., Porcheron, M., & Veshchezerova, M. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00100-3 · Cited by 46
“Quantum Annealing [9], the Quantum Adiabatic Algorithm [10], and the Quantum Ap-”
MethodInfluentialShort-depth QAOA circuits and quantum annealing on higher-order ising models
Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00825-w · Cited by 97
Liu, Y., Singh, S., Smith, K. C., Crane, E., Martyn, J. M., Eickbusch, A., Schuckert, A., Li, R. D., Sinanan-Singh, J., Soley, M. B., et al. (2026) · PRX Quantum · doi:10.1103/4rf7-9tfx · Cited by 169
Quantum annealing for combinatorial optimization: a benchmarking study
Kim, S., Ahn, S.-W., Suh, I.-S., Dowling, A. W., Lee, E., & Luo, T. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01020-1 · Cited by 46
“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 .”
An introduction to quantum annealing
de Falco, D., & Tamascelli, D. (2011) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita/2011013 · Cited by 64
Travel time optimization on multi-AGV routing by reverse annealing
Haba, R., Ohzeki, M., & Tanaka, K. (2022) · Scientific Reports · doi:10.1038/s41598-022-22704-0 · Cited by 43
Embedding Overhead Scaling of Optimization Problems in Quantum Annealing
Könz, M. S., Lechner, W., Katzgraber, H. G., & Troyer, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040322 · Cited by 67
Two-parameter counter-diabatic driving in quantum annealing
Prielinger, L., Hartmann, A., Yamashiro, Y., Nishimura, K., Lechner, W., & Nishimori, H. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013227 · Cited by 39
“[6] S.”
BackgroundSelf-citationBenchmark Test of Black-box Optimization Using D-Wave Quantum Annealer
Koshikawa, A. S., Ohzeki, M., Kadowaki, T., & Tanaka, K. (2021) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.90.064001 · Cited by 43
Contucci, P., & Giardinà, C. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9781139049306 · Cited by 41
Constant-adiabaticity radiofrequency pulses for generating long-lived singlet spin states in NMR
Rodin, B. A., Федорович, Ш. К., Kiryutin, A. S., Hill-Cousins, J. T., Brown, L. J., Brown, R. C. D., Jamain, B., Zimmermann, H. W., Зиннурович, С. Р., Yurkovskaya, A. V., et al. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5079436 · Cited by 36
Quantum annealing learning search for solving QUBO problems
Pastorello, D., & Blanzieri, E. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2418-z · Cited by 35
Mean field analysis of reverse annealing for code-division multiple-access multiuser detection
Arai, S., Ohzeki, M., & Tanaka, K. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033006 · Cited by 44
Quantum computing for fusion energy science applications
Joseph, I., Shi, Y., Porter, M. D., Castelli, A. R., Geyko, V., Graziani, F. R., Libby, S. B., & DuBois, J. L. (2023) · Physics of Plasmas · doi:10.1063/5.0123765 · Cited by 53
“Popular models include the digital circuit model , 5–7 the quantum walk model , 66,67 the adiabatic model , 68 the quantum annealing model , 69,70 and the measurement-based model .”
MethodQuantum‐inspired algorithm for radiotherapy planning optimization
Pakela, J. M., Tseng, H., Matuszak, M. M., Haken, R. K. T., McShan, D. L., & Naqa, I. E. (2019) · Medical Physics · doi:10.1002/mp.13840 · Cited by 38
Quantum Annealing via Environment-Mediated Quantum Diffusion
Smelyanskiy, V., Venturelli, D., Perdomo‐Ortiz, A., Knysh, S., & Dykman, M. I. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.066802 · Cited by 44
Fair Sampling by Simulated Annealing on Quantum Annealer
Yamamoto, M., Ohzeki, M., & Tanaka, K. (2020) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.89.025002 · Cited by 37
Quantum Annealing with the Jarzynski Equality
Ohzeki, M., & Nishimori, H. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.050401 · Cited by 33
Self-citationSusa, Y., Jadebeck, J. F., & Nishimori, H. (2017) · Physical Review A · doi:10.1103/physreva.95.042321 · Cited by 37
Self-citationHybrid quantum annealing via molecular dynamics
Irie, H., Liang, H., Doi, T., Gongyo, S., & Hatsuda, T. (2021) · Scientific Reports · doi:10.1038/s41598-021-87676-z · Cited by 32
“The quantum annealing with a transverse-field Ising model [2,3] as well as the adiabatic quantum computation [4,5] provide metaheuristic quantum algorithms for such difficult combinatorial optimizations.”
MethodOptimization of neural networks via finite-value quantum fluctuations
Ohzeki, M., Okada, S., Terabe, M., & Taguchi, S. (2018) · Scientific Reports · doi:10.1038/s41598-018-28212-4 · Cited by 32
“{ } s s w V t t s T N w w w w w ( 1) ( ) ( ) ( )( ( ) ( )) 2 (0, 1) (13) q”
Simulated quantum annealing as a simulator of nonequilibrium quantum dynamics
Bando, Y., & Nishimori, H. (2021) · Physical Review A · doi:10.1103/physreva.104.022607 · Cited by 37
“It is also known that the convergence condition of SQA in the long-time limit has a very similar expression to that of quantum annealing [8, 50].”
BackgroundSelf-citationSolving larger maximum clique problems using parallel quantum annealing
Pelofske, E., Hahn, G., & Djidjev, H. N. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03962-x · Cited by 44
Comparative study of the performance of quantum annealing and simulated annealing
Nishimori, H., Tsuda, J., & Knysh, S. (2015) · Physical Review E · doi:10.1103/physreve.91.012104 · Cited by 40
Self-citationBenchmarking Digital Quantum Simulations Above Hundreds of Qubits Using Quantum Critical Dynamics
Miessen, A., Egger, D. J., Tavernelli, I., & Mazzola, G. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040320 · Cited by 73
“[58,59], for adiabati-cally slow anneals, i.e., even larger t f , the scaling reads where a is a constant that depends on the derivatives of the annealing schedules [58].”
Maronese, M., Moro, L. D., Rocutto, L., & Prati, E. (2022) · Springer eBooks · doi:10.1007/978-3-030-89746-8_2 · Cited by 51
Quantum Machine Learning in Prediction of Breast Cancer
Prajapati, J. B., Paliwal, H., Prajapati, B. G., Saikia, S., & Pandey, R. (2023) · Studies in computational intelligence · doi:10.1007/978-981-19-9530-9_19 · Cited by 41
Pelofske, E. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adb029 · Cited by 61
Assessment of image generation by quantum annealer
Sato, T., Ohzeki, M., & Tanaka, K. (2021) · Scientific Reports · doi:10.1038/s41598-021-92295-9 · Cited by 33
Graph Coloring with a Distributed Hybrid Quantum Annealing Algorithm
Titiloye, O., & Crispin, A. J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22000-5_57 · Cited by 26
Direct comparison of quantum and simulated annealing on a fully connected Ising ferromagnet
Wauters, M. M., Fazio, R., Nishimori, H., & Santoro, G. E. (2017) · Physical Review A · doi:10.1103/physreva.96.022326 · Cited by 34
Self-citationVariational optimization of the quantum annealing schedule for the Lechner-Hauke-Zoller scheme
Susa, Y., & Nishimori, H. (2021) · Physical Review A · doi:10.1103/physreva.103.022619 · Cited by 33
Self-citationRodin, B. A., Eills, J., Picazo‐Frutos, R., Федорович, Ш. К., Budker, D., & Ivanov, K. L. (2021) · Physical Chemistry Chemical Physics · doi:10.1039/d0cp06581a · Cited by 27
Quantum annealing speedup over simulated annealing on random Ising chains
Zanca, T., & Santoro, G. E. (2016) · Physical review. B./Physical review. B · doi:10.1103/physrevb.93.224431 · Cited by 40
Using optimal control methods with constraints to generate singlet states in NMR
Rodin, B. A., Kiryutin, A. S., Yurkovskaya, A. V., Ivanov, K. L., Yamamoto, S., Sato, K., & Takui, T. (2018) · Journal of Magnetic Resonance · doi:10.1016/j.jmr.2018.03.005 · Cited by 25
Optimal Control for Quantum Optimization of Closed and Open Systems
Venuti, L. C., D’Alessandro, D., & Lidar, D. A. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.054023 · Cited by 29
Energy Gap at First-Order Quantum Phase Transitions: An Anomalous Case
Tsuda, J., Yamanaka, Y., & Nishimori, H. (2013) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.82.114004 · Cited by 30
Self-citationQuantum Annealing with Markov Chain Monte Carlo Simulations and D-Wave Quantum Computers
Wang, Y., Wu, S., & Zou, J. (2016) · Statistical Science · doi:10.1214/16-sts560 · Cited by 29
Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian
Yan, B., & Sinitsyn, N. A. (2022) · Nature Communications · doi:10.1038/s41467-022-29887-0 · Cited by 51
“The vertical line marks the annealing time τa(18), for which the gap between the ground state and the highest density point in the spectrum equals the bandwidth ΔEI (full width at half maximum) of the spectrum of HI.”
BackgroundOhzeki, M. (2017) · Scientific Reports · doi:10.1038/srep41186 · Cited by 31
“The computational time of QA can be evaluated by the energy gap between the ground state and the first excited state during the decrease in the transverse fields 8,9 .”
BackgroundComplex semiclassical analysis of the Loschmidt amplitude and dynamical quantum phase transitions
Obuchi, T., Suzuki, S., & Takahashi, K. (2017) · Physical review. B./Physical review. B · doi:10.1103/physrevb.95.174305 · Cited by 26
Mapping structural topology optimization problems to quantum annealing
Wang, X., Wang, Z., & Ni, B. (2024) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-024-03791-1 · Cited by 22
“Several studies have already demonstrated encouraging outcomes (Wang and Niu 2007; Morita and Nishimori 2008; Mu and Wang 2020; Neukart and Compos-tella et al. 2017; Yarkoni and Raponi et al. 2022; Vreumin-gen and Neukart et al. 2019).”
Routing and scheduling optimization for urban air mobility fleet management using quantum annealing
Haba, R., Mano, T., Ueda, R., Ebe, G., Takeda, K., Terabe, M., & Ohzeki, M. (2025) · Scientific Reports · doi:10.1038/s41598-025-86843-w · Cited by 34
Variational counterdiabatic driving of the Hubbard model for ground-state preparation
Xie, Q., Seki, K., & Yunoki, S. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.155153 · Cited by 33
Simulated quantum annealing of double-well and multiwell potentials
Inack, E. M., & Pilati, S. (2015) · Physical Review E · doi:10.1103/physreve.92.053304 · Cited by 27
Quantum annealing-aided design of an ultrathin-metamaterial optical diode
Kim, S., Park, S.-J., Moon, S., Zhang, Q., Hwang, S., Kim, S.-K., Luo, T., & Lee, E. (2024) · Nano Convergence · doi:10.1186/s40580-024-00425-6 · Cited by 20
A Symbolic Approach to Discrete Structural Optimization Using Quantum Annealing
Wils, K., & Chen, B. (2023) · Mathematics · doi:10.3390/math11163451 · Cited by 23
Fast quantum methods for optimization
Boixo, S., Ortíz, G., & Somma, R. D. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02341-5 · Cited by 29
Quantum Machine Learning, Leveraging AI, and Semiconductor Technology
Eswaran, U., & Eswaran, V. (2024) · Advances in mechatronics and mechanical engineering (AMME) book series · doi:10.4018/979-8-3693-7076-6.ch003 · Cited by 18
Understanding quantum tunneling using diffusion Monte Carlo simulations
Inack, E. M., Giudici, G., Parolini, T., Santoro, G. E., & Pilati, S. (2018) · Physical Review A · doi:10.1103/physreva.97.032307 · Cited by 19
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.