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 101–200 of 379
Correlation inequalities for quantum spin systems with quenched centered disorder
Contucci, P., & Lebowitz, J. L. (2010) · Journal of Mathematical Physics · doi:10.1063/1.3293753 · Cited by 18
Fair sampling of ground-state configurations of binary optimization problems
Zhu, Z., Ochoa, A. J., & Katzgraber, H. G. (2019) · Physical Review E · doi:10.1103/physreve.99.063314 · Cited by 17
A real-world test of portfolio optimization with quantum annealing
Sakuler, W., Oberreuter, J. M., Aiolfi, R., Asproni, L., Roman, B., & Schiefer, J. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00268-2 · Cited by 37
“…(QUBO) formulation (Grant et al. 2021; Lucas 2014; Glover and Kochenberger 2018), which is by definition unconstrained, each of these terms must be properly weighted in the objective function such that the resulting solution not only satisfies the constraints, but also maximizes the returns.”
Three phases of quantum annealing: Fast, slow, and very slow
Soriani, A., Nazé, P., Bonança, M. V. S., Gardas, B., & Deffner, S. (2022) · Physical Review A · doi:10.1103/physreva.105.042423 · Cited by 18
“To complement existing, approximate methods, we employ adiabatic perturbation theory [26,33,34].”
Efficient low temperature Monte Carlo sampling using quantum annealing
Sandt, R., & Spatschek, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-33828-2 · Cited by 21
The Potential of Quantum Techniques for Stock Price Prediction
Srivastava, N., Belekar, G., Shahakar, N., & Aswath Babu, H. (2023) · IEEE International Conference on Recent Advances in Systems Science and Engineering (RASSE) · doi:10.1109/rasse60029.2023.10363533 · Cited by 21
“Unlike classical feature selection methods, QA can efficiently explore a vast number of possible feature combinations simultaneously, potentially leading to more accurate and efficient feature selection [16]–[18].”
BackgroundDetecting Many-Body Bell Nonlocality by Solving Ising Models
Frérot, I., & Roscilde, T. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.140504 · Cited by 22
Experimental and Theoretical Study of Thermodynamic Effects in a Quantum Annealer
Kadowaki, T., & Ohzeki, M. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061008 · Cited by 17
“[8] Satoshi Morita and Hidetoshi Nishimori, “Mathematical foundation of quantum annealing,” Journal of Mathematical Physics 49, 1–47 (2008).”
BackgroundAnomalous behavior of the energy gap in the one-dimensional quantum XY model
Okuyama, M., Yamanaka, Y., Nishimori, H., & Rams, M. M. (2015) · Physical Review E · doi:10.1103/physreve.92.052116 · Cited by 17
Self-citationShirakawa, T., Seki, K., & Yunoki, S. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013004 · Cited by 18
Greedy parameter optimization for diabatic quantum annealing
Kadowaki, T., & Nishimori, H. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0416 · Cited by 20
Self-citationMarosi, A. C., Farkas, A., Máray, T., & Lovas, R. (2023) · IEEE Access · doi:10.1109/access.2023.3342749 · Cited by 21
“Next, we focus on discussing the offerings of hardware providers following the two main quantum computing models: the quantum annealing model [37], [38], and the quantum circuit model [39], [40], [41].”
MethodNishimura, K., Nishimori, H., Ochoa, A. J., & Katzgraber, H. G. (2016) · Physical review. E · doi:10.1103/physreve.94.032105 · Cited by 24
Self-citationBreakdown of the Weak-Coupling Limit in Quantum Annealing
Bando, Y., Yip, K.-W., Chen, H., Lidar, D. A., & Nishimori, H. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.054033 · Cited by 21
“[5, 71] or Quantum Monte Carlo Annealing in Ref.”
BackgroundSelf-citationA Variable Neighbourhood Descent Heuristic for Conformational Search Using a Quantum Annealer
Marchand, D. J. J., Noori, M., Roberts, A., Rosenberg, G., Woods, B., Yildiz, U., Coons, M., Devore, D., & Margl, P. (2019) · Scientific Reports · doi:10.1038/s41598-019-47298-y · Cited by 15
“Although the method can be readily extended to any chosen degree, we assume in this paper that a binary quadratic program is desirable as it is well-suited for optimization using quantum annealing [29,30].”
MethodEnergy Efficient Path and Trajectory Optimization of Manipulators With Task Deadline Constraints
Otani, T., Nakamura, M., Kimura, K., & Takanishi, A. (2023) · IEEE Access · doi:10.1109/access.2023.3320143 · Cited by 15
“The Digital Annealer is a technology that specializes in solving complex combinatorial optimization problems at high-speed using a digital circuit design inspired by quantum phenomena [27], [28].”
BackgroundGate-Based Variational Quantum Algorithm for Truss Structure Size Optimization Problem
Xu, Y., Wang, X., & Wang, Z. (2024) · AIAA Journal · doi:10.2514/1.j064518 · Cited by 13
Ising formulation of associative memory models and quantum annealing recall
Santra, S., Shehab, O., & Balu, R. (2017) · Physical Review A · doi:10.1103/physreva.96.062330 · Cited by 18
Statistical-Mechanical Analysis of Compressed Sensing for Hamiltonian Estimation of Ising Spin Glass
Takahashi, C., Ohzeki, M., Okada, S., Terabe, M., Taguchi, S., & Tanaka, K. (2018) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.87.074001 · Cited by 15
Takada, K., Yamashiro, Y., & Nishimori, H. (2020) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.89.044001 · Cited by 22
Self-citationMu, L., Wang, P., & Xin, G. (2020) · Information Sciences · doi:10.1016/j.ins.2020.03.035 · Cited by 15
Quantum Optimization Algorithms in Operations Research: Methods, Applications, and ImplicationsPreprint
Klug, F. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4854668 · Cited by 25
Federated quantum machine learning for drug discovery and healthcare
Saggi, M. K., Bhatia, A. S., & Kais, S. (2024) · Annual reports in computational chemistry · doi:10.1016/bs.arcc.2024.10.007 · Cited by 16
Quantum computing for space applications: a selective review and perspectives
Torta, P., Casati, R., Bruni, S., Mandarino, A., & Prati, E. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00369-8 · Cited by 20
Quantum annealing: next-generation computation and how to implement it when information is missing
Ohzeki, M., Takahashi, C., Okada, S., Terabe, M., Taguchi, S., & Tanaka, K. (2018) · Nonlinear Theory and Its Applications IEICE · doi:10.1587/nolta.9.392 · Cited by 15
Quantum and classical annealing in a continuous space with multiple local minima
Koh, Y. W., & Nishimori, H. (2022) · Physical Review A · doi:10.1103/physreva.105.062435 · Cited by 18
Self-citationCounterdiabatic reverse annealing
Passarelli, G., & Lucignano, P. (2023) · Physical Review A · doi:10.1103/physreva.107.022607 · Cited by 20
Effectiveness of quantum annealing for continuous-variable optimization
Arai, S., Oshiyama, H., & Nishimori, H. (2023) · Physical Review A · doi:10.1103/physreva.108.042403 · Cited by 21
Self-citationA complete restricted Boltzmann machine on an adiabatic quantum computer
Rocutto, L., & Prati, E. (2021) · International Journal of Quantum Information · doi:10.1142/s0219749921410033 · Cited by 15
Kibble-Zurek mechanism in simulated annealing and quantum annealing
Suzuki, S. (2011) · Journal of Physics Conference Series · doi:10.1088/1742-6596/302/1/012046 · Cited by 12
Dynamical singularities of glassy systems in a quantum quench
Obuchi, T., & Takahashi, K. (2012) · Physical Review E · doi:10.1103/physreve.86.051125 · Cited by 13
Noise dynamics of quantum annealers: estimating the effective noise using idle qubits
Pelofske, E., Hahn, G., & Djidjev, H. N. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/accbe6 · Cited by 12
Deep learning optimal quantum annealing schedules for random Ising models
Hegde, P. R., Passarelli, G., Cantele, G., & Lucignano, P. (2023) · New Journal of Physics · doi:10.1088/1367-2630/ace547 · Cited by 17
Initial State Encoding via Reverse Quantum Annealing and H-Gain Features
Pelofske, E., Hahn, G., & Djidjev, H. N. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3319586 · Cited by 25
“Quantum annealing (QA) is a form of specialized quantum computation that uses quantum fluctuations in order to search for the global minimum of a combinatorial optimization problem [1], [2], [3], [4], [5], [6].”
BackgroundThermal, quantum and simulated quantum annealing: analytical comparisons for simple models
Bapst, V., & Semerjian, G. (2013) · Journal of Physics Conference Series · doi:10.1088/1742-6596/473/1/012011 · Cited by 15
Nonequilibrium Work on Spin Glasses in Longitudinal and Transverse Fields
Ohzeki, M., Katsuda, H., & Nishimori, H. (2011) · Journal of the Physical Society of Japan · doi:10.1143/jpsj.80.084002 · Cited by 12
Self-citationHybrid quantum annealing decomposition framework for unit commitment
Ling, J., Zhang, Q., Geng, G., & Jiang, Q. (2024) · Electric Power Systems Research · doi:10.1016/j.epsr.2024.111121 · Cited by 22
Controller load optimization strategies in Software-Defined Networking: A survey
Liu, Y., Ge, Y., Meng, Q., & Liu, Q. (2024) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2024.104043 · Cited by 14
Cyclic quantum annealing: searching for deep low-energy states in 5000-qubit spin glass
Zhang, H., Boothby, K., & Kamenev, A. (2024) · Scientific Reports · doi:10.1038/s41598-024-80761-z · Cited by 43
“Ideally, the ground state is attainable if the adiabatic condition is strictly met[23, 24, 26, 32].”
Salloum, H., Zhanalin, S., Badr, A. A., & Kholodov, Y. A. (2025) · Scientific Reports · doi:10.1038/s41598-025-04568-2 · Cited by 23
“At the core of QA lies the time-dependent Schrödinger equation 76–78 : Where: ℏ is the reduced Planck constant.”
What Is the Optimal Annealing Schedule in Quantum Annealing
Galindo, O., & Крейнович, В. (2020) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci47803.2020.9308407 · Cited by 14
“, [2], [3], [4], [6], [9], [11], [12], [14], [16], [17], [18], [20].”
BackgroundElementary proof of QAOA convergence
Binkowski, L., Koßmann, G., Ziegler, T., & Schwonnek, R. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad59bb · Cited by 31
Test Case Minimization with Quantum Annealers
Wang, X., Muqeet, A., Yue, T., Ali, S., & Arcaini, P. (2024) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3680467 · Cited by 26
“QA is based on the adiabatic theorem [13, 14], stating that if a quantum system is initialized in a ground state (i.e., the lowest energy state) and the Hamiltonian 2 of the system changes sufficiently slowly, the quantum system will remain in the ground state during the system evolution.”
Fiorelli, E., Rotondo, P., Marcuzzi, M., Garrahan, J. P., & Lesanovsky, I. (2019) · Physical Review A · doi:10.1103/physreva.99.032126 · Cited by 12
Exploration of new chemical materials using black-box optimization with the D-wave quantum annealer
Doi, M., Nakao, Y., Tanaka, T., Sako, M., & Ohzeki, M. (2023) · Frontiers in Computer Science · doi:10.3389/fcomp.2023.1286226 · Cited by 17
“The quantum adiabatic theorem ensures that it is possible to find the nontrivial ground state at the end of the quantum annealing if the transverse field changes sufficiently slowly (Suzuki and Okada, 2005; Morita and Nishimori, 2008; Ohzeki and Nishimori, 2011).”
BackgroundQuantum Parallel Training of a Boltzmann Machine on an Adiabatic Quantum Computer
Noè, D., Rocutto, L., Moro, L. D., & Prati, E. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300330 · Cited by 13
Lee, S., Lim, Q. J., Ross, C., Lee, E., Han, S., Kim, Y., Peng, Z., & Kim, S. (2024) · IEEE Antennas and Propagation Magazine · doi:10.1109/map.2024.3498695 · Cited by 10
“According to the adiabatic theorem in quantum mechanics, the rate of change of the Hamiltonian must be sufficiently lower than the gap between the lowest and the second-lowest energy spectrum [16].”
Optimal PMU Placement via Quantum Optimization
Jiang, Y., Liang, Z., Li, Y., & Morstyn, T. (2025) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2025.3564889 · Cited by 14
“As indicated previously, [31] utilizes QA techniques, which costs O ( N 2 ) on classical computers to form the adjacency matrix and O ( N 2 + e − 1 N ) on QPU for the QA process [59].”
Quantum computing for discrete optimization: A highlight of three technologies
Bochkarev, A. A., Heese, R., Jäger, S., Schiewe, P., & Schöbel, A. (2025) · European Journal of Operational Research · doi:10.1016/j.ejor.2025.07.063 · Cited by 26
“Advantage is a special-purpose device designed for QA (Das & Chakrabarti, 2005; Finnila et al., 1994; Hauke et al., 2020; Morita & Nishimori, 2008).”
Tao, W. J., Guo, G., Li, H., et al. (2022) · KSCE Journal of Civil Engineering · doi:10.1007/s12205-022-1034-0 · Cited by 10
“…the parameter inversion errors caused by the optimal parameters not within the given initial parameters and its varied range, the variable initial parameters values method is used in the model to optimize the traditional QA (Wei et al., 2006; Martonák et al., 2004; Morita and Nishimori, 2008).”
MethodAdvantage of Pausing: Parameter Setting for Quantum Annealers
Izquierdo, Z. G., Grabbe, S. R., Idris, H., Wang, Z., Marshall, J., & Rieffel, E. G. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.054056 · Cited by 12
“…annealing relies on the fact that the solu-tion to such an optimization problem can also be understood as the GS of an Ising problem Hamiltonian [35] H p = <ij> J ij σ zi σ zj + i h i σ xi , where σ xi and σ zi are individual Pauli matrices acting on spin i , J ij represents the strength of the…”
BackgroundEarly steps toward practical subsurface computations with quantum computing
Greer, S. Y., & O’Malley, D. (2023) · Frontiers in Computer Science · doi:10.3389/fcomp.2023.1235784 · Cited by 10
4-Clique network minor embedding for quantum annealers
Pelofske, E. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.034023 · Cited by 19
How Small-World Interactions Can Lead to Improved Quantum Annealer Designs
Katzgraber, H. G., & Novotny, M. A. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.10.054004 · Cited by 11
Quantum annealing for microstructure equilibration with long-range elastic interactions
Sandt, R., Bouar, Y. L., & Spatschek, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-33232-w · Cited by 11
Al-Bayaty, A., & Perkowski, M. A. (2024) · Entropy · doi:10.3390/e26100843 · Cited by 18
Quantum annealing with twisted fields
Imoto, T., Seki, Y., Matsuzaki, Y., & Kawabata, S. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac9155 · Cited by 14
“In particular, there are two major obstacles: decoherence and non-adiabatic transitions [28].”
BackgroundAssessing the performance of quantum annealing with nonlinear driving
Soriani, A., Nazé, P., Bonança, M. V. S., Gardas, B., & Deffner, S. (2022) · Physical Review A · doi:10.1103/physreva.105.052442 · Cited by 9
“Had we considered protocols with zero first and second derivatives at the end points, then the excess work would scale as τ−6 for slow processes, and so on for higher derivatives [44, 45].”
BackgroundMethodFinding optimal pathways in chemical reaction networks using Ising machines
Mizuno, Y., & Komatsuzaki, T. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013115 · Cited by 18
“Morita and Nishi-mori [57, 58] proved that the excitation probability is bounded by an arbitrarily small constant ϵ at each time if Γ( t ) decreases in time as where a and b are constants of O ( N 0 σ ) and t 0 is a positive constant.”
BackgroundQuantum annealing with error mitigation
Shingu, Y., Nikuni, T., Kawabata, S., & Matsuzaki, Y. (2024) · Physical Review A · doi:10.1103/physreva.109.042606 · Cited by 15
Feeding the multitude: A polynomial-time algorithm to improve sampling
Ochoa, A. J., Jacob, D. C., Mandrà, S., & Katzgraber, H. G. (2019) · Physical review. E · doi:10.1103/physreve.99.043306 · Cited by 16
“As part of our analysis, here we demonstrate how fair sampling [17–19] of states generated with transverse-field quantum annealing [20–28] using a D-Wave 2X quantum annealer [29] can be improved.”
BackgroundPhase transitions in the frustrated Ising ladder with stoquastic and nonstoquastic catalysts
Takada, K., Sota, S., Yunoki, S., Pokharel, B., Nishimori, H., & Lidar, D. A. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.043013 · Cited by 9
“From the point of view of quantum annealing and optimization this implies a quantitative, if not qualitative, improvement by the non-stoquastic XX catalyst, since a larger gap implies a faster time-to-solution by the adiabatic theorem [6, 7].”
BackgroundSelf-citationDeterministic quantum annealing expectation-maximization algorithm
Miyahara, H., Tsumura, K., & Sughiyama, Y. (2017) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/aa967e · Cited by 12
On the Question of Ergodicity in Quantum Spin Glass Phase and Its Role in Quantum Annealing
Mukherjee, S., & Chakrabarti, B. K. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061004 · Cited by 12
Endo, K., Matsuda, Y., Tanaka, S., & Muramatsu, M. (2024) · PLoS ONE · doi:10.1371/journal.pone.0304594 · Cited by 13
Scheduling of Satellite Constellation Operations in EO Missions Using Quantum Optimization
Marchioli, V., Boggio, M., Volpe, D., Massotti, L., & Novara, C. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-77432-4_16 · Cited by 9
Susa, Y., & Nishimori, H. (2020) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.89.044006 · Cited by 9
Self-citationShortcuts to Thermodynamic Quasistaticity
Soriani, A., Miranda, E., Deffner, S., & Bonança, M. V. S. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.170602 · Cited by 11
Nonequilibrium work performed in quantum annealing
Ohzeki, M., & Nishimori, H. (2011) · Journal of Physics Conference Series · doi:10.1088/1742-6596/302/1/012047 · Cited by 8
Self-citationPerformance of quantum annealing in solving optimization problems: A review
Suzuki, S. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02342-4 · Cited by 8
Efficient Quantum and Simulated Annealing of Potts Models Using a Half-hot Constraint
Okada, S., Ohzeki, M., & Tanaka, K. (2020) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.89.094801 · Cited by 10
“According to the adiabatic theorem [5], the computational time of QA is proportional to the inverse square of the minimum energy gap between the instantaneous gound state and the first excited state.”
BackgroundA quantum annealing protocol to solve the nuclear shell model
Costa, E., Pérez-Obiol, A., Menéndez, J., Rios, A., García-Sáez, A., & Juliá-Díaz, B. (2025) · SciPost Physics · doi:10.21468/scipostphys.19.2.062 · Cited by 14
A brief review on quantum computing based drug design
Das, P., Ray, A., Bhattacharyya, S., Platoš, J., Snåšel, V., Mršić, L., Huang, T., & Zelinka, I. (2024) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1553 · Cited by 13
In‐Materia Annealing and Combinatorial Optimization Based on Vertical Memristive Array
Lee, S. H., Cheong, S., Cho, J. M., Ghenzi, N., Shin, D. H., Jang, Y. H., Han, J., Park, T. W., Kim, D. Y., Shim, S. K., et al. (2024) · Advanced Materials · doi:10.1002/adma.202410191 · Cited by 9
Rajak, A., & Chakrabarti, B. K. (2014) · Indian Journal of Physics · doi:10.1007/s12648-014-0483-9 · Cited by 7
Quantum Annealing for Automated Feature Selection in Stress Detection
Nath, R. K., Thapliyal, H., & Humble, T. S. (2021) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi51109.2021.00089 · Cited by 7
“Theoretically, it has been proven that quantum annealing is always guaranteed to reach the global minimum with a faster rate of convergence than classical annealing [11].”
BackgroundPetri Net Modeling for Ising Model Formulation in Quantum Annealing
Nakamura, M., Kaneshima, K., & Yoshida, T. (2021) · Applied Sciences · doi:10.3390/app11167574 · Cited by 7
“This new approach solves unconstrained optimization problems formulated as a Hamiltonian by evolving the time-dependent Schrödinger equation from a quantum mechanical superposition of all possible states to its ground state in physical systems[Morita and Nishimori, 2008].”
MethodKaneko, K., & Nishimori, H. (2015) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.84.094001 · Cited by 10
Self-citationMessage-passing Algorithm of Quantum Annealing with Nonstoquastic Hamiltonian
Ohzeki, M. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061005 · Cited by 7
Suzuki, S., Inoue, J., & Chakrabarti, B. K. (2012) · Lecture notes in physics · doi:10.1007/978-3-642-33039-1_8 · Cited by 7
Nonequilibrium work on spin glasses in longitudinal and transverse fieldsPreprint
Ohzeki, M., Katsuda, H., & Nishimori, H. (2016) · Cited by 12
Self-citationQuantum Annealing in Machine Learning: QBoost on D-Wave Quantum Annealer
Salloum, H., Salloum, A., Mazzara, M., & Zykov, S. V. (2024) · Procedia Computer Science · doi:10.1016/j.procs.2024.09.311 · Cited by 11
Quantum graph learning and algorithms applied in quantum computer sciences and image classification
Shayeganfar, F., Ramazani, A., Sundararaghavan, V., & Duan, Y. (2025) · Applied Physics Reviews · doi:10.1063/5.0237599 · Cited by 11
Fujii, T., Komuro, K., Okudaira, Y., & Sawada, M. (2023) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.92.044001 · Cited by 8
Milestones on the Quantum Utility Highway: Quantum Annealing Case Study
McGeoch, C. C., & Farré, P. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3625307 · Cited by 14
“In an ideal noise-free environment, if tanneal is above a certain threshold time determined by the input, the qubits will finish in a ground state of the objective function (2) with high probability [14, 46, 57].”
BackgroundOkada, S., Ohzeki, M., & Tanaka, K. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.024802 · Cited by 6
Benchmarking D-Wave Quantum Annealers: Spectral Gap Scaling of Maximum Cardinality Matching Problems
McLeod, C. R., & Sasdelli, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-08760-8_13 · Cited by 15
“Using D-Wave terminology [17] the initial Hamiltonian is called the tunnelling Hamiltonian and is in its lowest energy state when all qubits are in a superposition state of 0 and 1.”
MethodRigorous convergence condition for quantum annealing
Kimura, Y., & Nishimori, H. (2022) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ac9dce · Cited by 9
“The approach of Morita and Nishimori builds on an approximate version of the “adiabatic theorem”, which takes into account only the leading-order term of the asymptotic expansion of excitation probability and ignores higher order contributions.”
BackgroundMethodResultInfluentialSelf-citationSoriani, A., Miranda, E., & Bonança, M. V. S. (2022) · New Journal of Physics · doi:10.1088/1367-2630/aca177 · Cited by 8
Kadowaki, T. (2018) · Physical Review A · doi:10.1103/physreva.97.022312 · Cited by 6
“[8] Satoshi Morita and Hidetoshi Nishimori, “Mathematical foundation of quantum annealing,” Journal of Mathematical Physics 49, 1–47 (2008), arXiv:0806.”
BackgroundNonequilibrium work performed in quantum annealing
Ohzeki, M., 西森秀稔, & Nishimori, H. (2019) · Tokyo Tech Research Repository (Tokyo Institute of Technology) · Cited by 11
Self-citationQuantum annealing with a nonvanishing final value of the transverse field
Nishimura, K., & Nishimori, H. (2017) · Physical Review A · doi:10.1103/physreva.96.042310 · Cited by 9
Self-citationComparative Study of Portfolio Optimization Models for Cryptocurrency and Stock Markets
Alidaee, B., Wang, H., & Wang, W. (2025) · IEEE Access · doi:10.1109/access.2025.3551628 · Cited by 7
Wauters, M. M., & van Nieuwenburg, E. (2022) · Nature Machine Intelligence · doi:10.1038/s42256-022-00535-y · Cited by 5
“The algorithm of choice here is the technique of quantum annealing (QA) [5, 6].”
MethodAnalyzing the effectiveness of quantum annealing with meta-learning
Pellini, R., & Dacrema, M. F. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00179-8 · Cited by 6
“It is based on the Adiabatic Quantum Computation (AQC) paradigm, with some relaxations (Yarkoni et al. 2022; Morita and Nishimori 2008; Farhi et al. 2000; Albash and Lidar 2018; Hauke et al. 2020).”
Lagrangian duality in quantum optimization: Overcoming QUBO limitations for constrained problems
Gabbassov, E., Rosenberg, G., & Scherer, A. (2025) · Physical Review Research · doi:10.1103/53gd-2374 · Cited by 12
Computational complexity of three-dimensional Ising spin glass: Lessons from D-wave annealer
Zhang, H., & Kamenev, A. (2025) · Physical Review Research · doi:10.1103/3bkn-v5rd · Cited by 16
Miyamoto, K., & Ueda, H. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03937-y · Cited by 12
How to experimentally evaluate the adiabatic condition for quantum annealing
Mori, Y., Kawabata, S., & Matsuzaki, Y. (2024) · Scientific Reports · doi:10.1038/s41598-024-58286-2 · Cited by 10
“In principle, if we can diagonalize the Hamiltonian, we can use an approximate version of the adiabatic conditions are given as follows 23,24,26,27 : for all s and m , where T ann denotes the annealing time, s = t / T ann denotes the time normalized by T ann , t denotes the time, | m ( s ) � ( | 0…”
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
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.