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 201–300 of 379
Koh, Y. W. (2016) · Physical review. B./Physical review. B · doi:10.1103/physrevb.93.134202 · Cited by 5
Okada, S., Ohzeki, M., & Tanaka, K. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.024803 · Cited by 5
Zhao, C., Huang, Z., & Guo, D. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03003-5 · Cited by 6
A Logarithmic Bayesian Approach to Quantum Error Detection
Convy, I., & Whaley, K. B. (2022) · Quantum · doi:10.22331/q-2022-04-04-680 · Cited by 5
“Even if a Hamiltonian is applied to the system, as would occur during a process like quantum annealing [7], the measurement signal will not be affected so long as the Hamiltonian does not mix together the four parity subspaces.”
MethodMatsuzaki, Y., Imoto, T., & Susa, Y. (2022) · Scientific Reports · doi:10.1038/s41598-022-17621-1 · Cited by 8
“HP = L ∑ j=1 h jŜ ( j) z +∑ i̸= j Ji, jŜ (i) z Ŝ ( j) z (5)”
Mozgunov, E., & Lidar, D. A. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0407 · Cited by 16
Convergence condition of simulated quantum annealing for closed and open systems
Kimura, Y., & Nishimori, H. (2022) · Physical Review A · doi:10.1103/physreva.106.062614 · Cited by 6
“[5, 25] and continuous time evolution in the present paper, resulting in the difference of coefficients of t, unity in Eq.”
BackgroundMethodResultInfluentialSelf-citationAnalysis of the shortest vector problems with quantum annealing to search the excited states
Ura, K., Imoto, T., Nikuni, T., Kawabata, S., & Matsuzaki, Y. (2023) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/acba21 · Cited by 8
Ohkuwa, M., & Nishimori, H. (2017) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.86.114004 · Cited by 11
Self-citationMetropolis–Hastings Algorithm for Ising Model
Cho, S. (2023) · Synthesis lectures on mathematics and statistics · doi:10.1007/978-3-031-33886-1_5 · Cited by 4
Osaba, E., Miranda-Rodriguez, P., Oikonomakis, A., Petrič, M., Ruiz, A., Bock, S., & Kourtis, M. (2025) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec65147.2025.11042978 · Cited by 8
“The community is exploring a number of methods in the field of quantum optimization, with Quantum Annealing (QA, [5]) and variational quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA, [6]) probably being the most prominent.”
A quantum optimization approach to Nonlinear Model Predictive Control
Novara, C., Boggio, M., & Volpe, D. (2025) · European Control Conference (ECC) · doi:10.23919/ecc65951.2025.11187268 · Cited by 4
Nonstoquastic catalyst for bifurcation-based quantum annealing of the ferromagnetic p -spin model
Susa, Y., Imoto, T., & Matsuzaki, Y. (2023) · Physical Review A · doi:10.1103/physreva.107.052401 · Cited by 9
Assessing the Effectiveness of Non-Turing Computing Paradigms
Rocutto, L., Maronese, M., Traversa, F. L., Decherchi, S., & Cavalli, A. (2023) · IEEE Access · doi:10.1109/access.2023.3312990 · Cited by 4
“take place adiabatically to guarantee success [40], [41].”
Posiform planting: generating QUBO instances for benchmarking
Hahn, G., Pelofske, E., & Djidjev, H. N. (2023) · Frontiers in Computer Science · doi:10.3389/fcomp.2023.1275948 · Cited by 4
Solving the homogeneous Bethe-Salpeter equation with a quantum annealer
Fornetti, F., Gnech, A., Frederico, T., Pederiva, F., Rinaldi, M., Roggero, A., Salmè, G., Scopetta, S., & Viviani, M. (2024) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.110.056012 · Cited by 4
Quantum Annealing via Path-Integral Monte Carlo With Data Augmentation
Hu, J., & Wang, Y. (2020) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2020.1814787 · Cited by 4
Towards Multi-agent Reinforcement Learning using Quantum Boltzmann Machines
Müller, T., Roch, C., Schmid, K., & Altmann, P. J. (2022) · International Conference on Agents and Artificial Intelligence (ICAART) · doi:10.5220/0010762100003116 · Cited by 8
“As proven in (Morita and Nishimori, 2008), spin system defined by simulated quantum annealing converges to quantum Hamiltonian.”
BackgroundQuantum Ising chain with time-averaged work in linear response theory
Nazé, P. (2023) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/ad082e · Cited by 5
Analysis of a Programmable Quantum Annealer as a Random Number Generator
Pelofske, E. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3364054 · Cited by 5
“Quantum annealing hardware is typically implemented using the transverse driving Hamiltonian where the system is initialized in the groundstate of the Transverse-field Hamiltonian [7], [8], [9], [10], [11], [12].”
BackgroundMethodHayasaka, H., Imoto, T., Matsuzaki, Y., & Kawabata, S. (2024) · Physical Review A · doi:10.1103/physreva.110.022620 · Cited by 4
“Here ∥ , it is worth mentioning that a physical Hamiltonian is usually assumed to be extensive, ∥ ˆ H ( t ) op = ∥ ˆ H QA ( t ) op = Θ( L ) [14, 48, 49].”
BackgroundA QFT Approach to Data Streaming in Natural and Artificial Neural Networks
Basti, G., & Vitiello, G. (2021) · International Society for the Study of Information Summit (IS4SI Summit) · doi:10.3390/proceedings2022081106 · Cited by 4
“This outperforms the thermal annealing, especially where the potential energy (cost) landscape consists of high but thin barriers surrounding shallow local minima [11,12].”
BackgroundQuantum Annealing and Computation: A Brief Documentary NotePreprint
Ghosh, A. K., & Mukherjee, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.1339 · Cited by 8
“Subsequently, the researches by Finnila et al. [5], Kadowaki and Nishimori [7], Brooke et al. [8] and Ferhi et al. [9] led to the robust development of quantum annealing technique, indicating clearly the possible development of analog quantum computers with such tricks (cf. Santoro and Tosatti [13], Das and Chakrabart…”
BackgroundMethodInfluentialVariational quantum algorithm for constrained topology optimization
Kim, J. E., & Wang, Y. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adfc92 · Cited by 8
“In quantum annealing [16], problems are formulated as quadratic unconstrained binary optimization (QUBO).”
Quang, T. N., Matsuyama, K., Shimizu, K., Sugano, H., Kurimoto, E., Miki, M., Suzuki, J., Chen, Z., Waidyasooriya, H. M., Hariyama, M., et al. (2025) · Scientific Reports · doi:10.1038/s41598-025-28481-w · Cited by 13
“The method is grounded in the adiabatic theorem 21,22 , which ensures a quantum system remains in its ground state if the Hamiltonian evolves slowly relative to the minimum energy gap.”
Quantum clock models with infinite-range interactions
Offei-Danso, A., Surace, F. M., Iemini, F., Russomanno, A., & Fazio, R. (2020) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/aba0a1 · Cited by 3
“The model we study is a generalization of the p-spin model [23, 24, 25] (with p = 1 corresponding to the case of two-body interactions).”
MethodSpectroscopic estimation of the photon number for superconducting Kerr parametric oscillators
Matsumoto, K. T., Yamaguchi, A., Yamamoto, T., Kawabata, S., & Matsuzaki, Y. (2023) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/acc3a8 · Cited by 3
Diabatic quantum and classical annealing of the Sherrington-Kirkpatrick model
Rakcheev, A., & Läuchli, A. M. (2023) · Physical Review A · doi:10.1103/physreva.107.062602 · Cited by 3
Enhancing quantum annealing in digital–analog quantum computing
Kadowaki, T. (2024) · APL Quantum · doi:10.1063/5.0179540 · Cited by 5
Quantum Approach for Constructing Phylogenetic Maximum Parsimony Tree
Bach, H. H., Nguyen, D. K., & Dung, N. N. V. (2024) · Communications in computer and information science · doi:10.1007/978-981-96-0437-1_12 · Cited by 3
Pelofske, E. (2025) · Physical review. E · doi:10.1103/physreve.111.054103 · Cited by 8
Seismic traveltime inversion with quantum annealing
Nguyen, H. A., & Tura, A. (2025) · Scientific Reports · doi:10.1038/s41598-025-01188-8 · Cited by 5
“This process can be described using the real-time Schrödinger equation 37 : where |·⟩ is the ket of the Dirac notation 38 , i is the imaginary unit, t is time, ¯ h is the reduced Planck’s constant, Ψ ( t ) is the wave function, | Ψ ( t ) ⟩ is the quantum state vector, H is the Hamiltonian…”
Quantum Optimization for Closed-Loop Scheduling of Earth Observation Satellite Formation
Marchioli, V., Boggio, M., Volpe, D., Massotti, L., & Novara, C. (2025) · SN Computer Science · doi:10.1007/s42979-025-04252-2 · Cited by 7
“Between these two approaches, the present work focuses on AQC and in particular on the Quantum Annealing paradigm, which exploits the adiabatic principle to solve optimization problems [39–41].”
Quantum optimization for multi-target Active Debris Removal missions
Gagliardi, M., Boggio, M., Volpe, D., & Novara, C. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00409-3 · Cited by 5
“This work focuses on Quantum Annealing paradigm [38, 72, 73], which is a heuristic implementation of AQC, exploiting the adiabatic principle but operating in a non-ideal regime where thermal effects and hardware constraints influence the evolution.”
Solving k–SAT problems with generalized quantum measurement
Zhang, Y., Lewalle, P., & Whaley, K. B. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01069-y · Cited by 10
“Published in partnership with The University of New South Wales https://doi.org/10.1038/s41534-025-01069-y Solving k – SAT problems with generalized quantum measurement”
InfluentialQuantum Associative Memory with Quantum Neural Network via Adiabatic Hamiltonian Evolution
Osakabe, Y., Akima, H., Sakuraba, M., Kinjo, M., & Sato, S. (2017) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2017edp7138 · Cited by 3
“Thus, we formulate this expression by following the Hamiltonian for the database search problem [23] and obtain”
MethodMapping state transition susceptibility in quantum annealing
Pelofske, E. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.013224 · Cited by 7
Comparing Adiabatic Quantum Computers for satellite images feature extraction
Rocutto, L., Maronese, M., Dragoni, D., Cavalli, A., & Cavazzoni, C. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.04.027 · Cited by 3
Elastic energy driven multivariant selection in martensites via quantum annealing
dos Santos, L. C. P., Hang, T., Sandt, R., Finsterbusch, M., Bouar, Y. L., & Spatschek, R. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023076 · Cited by 4
Scheduling Quantum Annealing for Active User Detection in a NOMA Network
Piron, R., & Goursaud, C. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00057 · Cited by 4
“It is quite easy to show that the numerator |⟨ ˆ H C − ˆ H P ⟩ 1 , 0 ( u ) | scales at most as O ( Poly ( N )) (see [19] for instance).”
Reformulating regression test suite optimization using quantum annealing - an empirical study
Trovato, A., Stefano, M. D., Pecorelli, F., Nucci, D. D., & Lucia, A. D. (2024) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-024-00775-w · Cited by 14
“The method takes the steps from the adiabatic theorem [31, 32], according to which, starting a quantum system from its ground state, which represents its minimum energy state, if the Hamiltonian of the system changes slowly enough, the system remains in its ground state during the whole evolution…”
Cost of emulating a small quantum annealing problem in the circuit model
Gonzalez-Conde, J., Morrell, Z., Vuffray, M., Albash, T., & Coffrin, C. (2025) · Physical Review A · doi:10.1103/physreva.111.062606 · Cited by 6
Quantum Phase Transition in Fully Connected Quantum Wajnflasz–Pick Model
Seki, Y., Tanaka, S., & Kawabata, S. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.054006 · Cited by 3
Effect of quantum fluctuations on the coloring of random graphs
Bapst, V., Semerjian, G., & Zamponi, F. (2013) · Physical Review A · doi:10.1103/physreva.87.042322 · Cited by 3
Basics and Applications of Quantum Annealing
Tanaka, S., TANAHASHI, K., Motohashi, T., & Takayanagi, S. (2018) · TEION KOGAKU (Journal of Cryogenics and Superconductivity Society of Japan) · doi:10.2221/jcsj.53.287 · Cited by 3
Quantum Computing for Machine Learning
Niraula, D., Jamaluddin, J., Pakela, J. M., & Naqa, I. E. (2022) · Springer eBooks · doi:10.1007/978-3-030-83047-2_5 · Cited by 4
Sinha, A. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0413 · Cited by 3
“[7]; DC denotes Das & Chakrabarti [13]; MN denotes Morita & Nishimori [31]; JAG denotes Johnson et al.”
BackgroundInfluentialVitale, V., Filippis, G. D., CANDIA, A. D., Tagliacozzo, A., Cataudella, V., & Lucignano, P. (2019) · Scientific Reports · doi:10.1038/s41598-019-50081-8 · Cited by 4
“Of course, due to the adiabatic theorem [30] res tends to zero if tf →∞, if the evolution is unitary.”
Yoneda, Y., Shimada, M., Yoshida, A., & Shirakashi, J.-I. (2023) · Applied Physics Express · doi:10.35848/1882-0786/accc6d · Cited by 2
Quantum annealing for nearest neighbour compliance problem
Müller, S., & Phillipson, F. (2024) · Scientific Reports · doi:10.1038/s41598-024-73882-y · Cited by 2
“There are claims of analytical and numerical evidence suggesting that Quantum Annealing can outperform classical methods such as Simulated (Thermal) Annealing for some problems 39,40 , potentially offering a quadratic speedup 41,42 .”
MethodPelofske, E., Hahn, G., & Djidjev, H. N. (2025) · npj Unconventional Computing · doi:10.1038/s44335-025-00032-6 · Cited by 3
“…planting using random QUBOs for programmable quantum annealer benchmarking Check for updates Elijah Pelofske 1 , Georg Hahn 2 & Hristo N. Djidjev 1,3,4 Posiform planting is a method for constructing QUBO instances with a unique planted solution that can be tailored to arbitrary connectivity…”
Optimization Scheduling of Multi-Energy Microgrid Based on the QUBO Quantum Computing Model
Wang, B., Wang, H., & Zhang, D. (2025) · Lecture notes in electrical engineering · doi:10.1007/978-981-96-0897-3_48 · Cited by 2
Henke, K., Pelofske, E., Kenyon, G. T., & Hahn, G. (2025) · npj Unconventional Computing · doi:10.1038/s44335-025-00028-2 · Cited by 3
Quo Vadis, Quantum Machine Learning?: Quantum kernel methods meet Earth observation
Miroszewski, A., Nalepa, J., Wijata, A. M., B, J. M. A., Saux, B. L., & Sebastianelli, A. (2026) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2025.3596291 · Cited by 4
“Quantum anneal-ers [62], [63], [64], such as those developed by D-Wave, operate based on the principles of adiabatic quantum computing.”
Enhancement of quantum annealing via n -local catalysts
Ghosh, R., Nutricati, L. A., Feinstein, N., Warburton, P. A., & Bose, S. (2026) · Physical Review Research · doi:10.1103/hnzj-j7kt · Cited by 23
“One method to simulate such a state is via adiabatic quantum annealing, which is a method where one starts from an easily preparable ground state of a known Hamiltonian and adiabatically varies the potential landscape to reach the target Hamiltonian [1–5].”
Quantum Annealed Geometric Mean Optimization for Calibrated Optimization of KAN
Mishra, A., & Panda, N. (2025) · International Conference on Intelligent Systems and Embedded Design (ISED) · doi:10.1109/ised67359.2025.11405218 · Cited by 2
“A quantum inspired algorithm called quantum annealing (QA) is utilized to obtain a system’s lowest-energy(optimal) state [27].”
Quantum Annealing for Real-World Machine Learning Applications
Nath, R. K., Thapliyal, H., & Humble, T. S. (2023) · Springer eBooks · doi:10.1007/978-3-031-37966-6_9 · Cited by 3
Yatabe, A. (2024) · Frontiers in Computer Science · doi:10.3389/fcomp.2024.1285244 · Cited by 3
Matsuta, T., & Furue, R. (2025) · PLoS ONE · doi:10.1371/journal.pone.0326303 · Cited by 6
“Γ 𝑡𝑡 According to [30,32], a sufficient condition of convergence of QA is where and are constants, is a small parameter, and is the number of qubits.”
BackgroundSandt, R., Bouar, Y. L., & Spatschek, R. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033047 · Cited by 2
Li, Y., Sun, Z., Wang, H., Shi, K., Li, J., Liu, C. X., & Ma, H. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad7b6f · Cited by 2
Quantum-Compatible Unit Commitment Modeling through Logarithmic Discretization
Christeson, T., Khodaei, A., & Eskandarpour, R. (2024) · IEEE PES Innovative Smart Grid Technologies Europe · doi:10.1109/isgteurope62998.2024.10863738 · Cited by 3
“There are various QC technologies for problem modeling, but one that is well-suited to complex optimization problems is Quantum Annealing (QA) [10], [11].”
A comparison on constrain encoding methods for quantum approximate optimization algorithm
Liu, Y., Jiao, Q., Shi, Y., Wan, K., & Guo, S. (2024) · doi:10.1145/3676536.3697126 · Cited by 6
“In quantum optimization algorithms, the most notable algorithms and techniques include the QAOA [16, 17, 22, 27], quantum Annealing [18], and Adiabatic Quantum Computation (AQC) [2].”
Quantum computing and the stable set problem
Krpan, A., Povh, J., & Pucher, D. (2025) · Optimization methods & software · doi:10.1080/10556788.2025.2490639 · Cited by 6
“A review of mathematical and theoretical foundations of quantum annealing can be found in [25].”
Quantum Computing in the RAN with Qu4Fec: Closing Gaps Towards Quantum-based FEC processors
Apostolakis, N., Sierra-Obea, M., Gramaglia, M., Ayala‐Romero, J. A., García‐Saavedra, A., Fiore, M., Banchs, A., & Costa‐Pérez, X. (2025) · Proceedings of the ACM on Measurement and Analysis of Computing Systems · doi:10.1145/3727128 · Cited by 3
“Quantum annealing [43] is a Quantum computing approach designed to solve optimization problems by finding the global minimum of a given function.”
Morais, A., Osaba, E., Pastor-López, I., & Oregi, I. (2025) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3712255.3734363 · Cited by 6
“…algorithms to explore and solve complex problems more efficiently than classical algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA, [7]), Variational Quantum Eigensolver (VQE, [40]), and quantum annealing (QA, [26]) that leverage quantum features to process information.”
Relaxation of the EM algorithm via quantum annealing for Gaussian mixture models
Miyahara, H., Tsumura, K., & Sughiyama, Y. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798981 · Cited by 4
“After that, a quantum extension of SA, which is called quantum annealing (QA), was proposed in physics [6], [7], [8], and has been intensively studied [9], [10], [11], [12], [13], [14], [15], [16], [17].”
BackgroundMethodSuperposition of Macroscopically Distinct States in Adiabatic Quantum Computation
Yuge, T. (2018) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.87.124002 · Cited by 2
Padilha, D., Weinstock, S., & Hodson, M. J. (2019) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2019.8916450 · Cited by 3
“We describe a simulation method based on the PathIntegral formulation of quantum mechanics, equivalent to Schrödinger’s canonical formalism for the time-evolution of a quantum system[7].”
MethodHomomorphic Encryption for Quantum Annealing with Spin Reversal Transformations
O’Malley, D., & Golden, J. K. (2020) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec43674.2020.9286176 · Cited by 3
“1) so that samples obtained with the modified Hamiltonian can be mapped back to samples from the original Hamiltonian.”
BackgroundInfluentialArchitectures for Quantum Information Processing
Upadhyay, S., Alam, M., & Ghosh, S. (2023) · Springer eBooks · doi:10.1007/978-981-15-6401-7_64-1 · Cited by 4
Comparison of quantum annealing and simulated annealing
Nishimori, H. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02338-0 · Cited by 3
Self-citationQuantum Computing in Green Energy ProductionPreprint
Sharabiani, M. T. A., Jakobsen, V. B., Jeppesen, M., & Mahani, A. S. (2021) · arXiv (Cornell University) · Cited by 3
Elementary Proof of QAOA ConvergencePreprint
Binkowski, L., Koßmann, G., Ziegler, T., & Schwonnek, R. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2302.04968 · Cited by 2
Effect of quantum statistics on computational power of atomic quantum annealers
Luo, Y., & Li, X. (2023) · Physical Review A · doi:10.1103/physreva.107.012608 · Cited by 2
Convergence condition of simulated quantum annealing with a non-stoquastic catalyst
Kimura, Y., & Nishimori, H. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/acc55c · Cited by 4
“These arguments and the results obtained in [26–28] applied to the model under discussion reveal that the following inequality holds for the energy gap ∆( t ) : Owing to the lower bound of w σσ ′′ of equation (44), we obtain the following lower bound for the energy gap ∆( t ) : A ( N ) is…”
InfluentialSelf-citationAdiabatic theorem for classical stochastic processes
Takahashi, K. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad3189 · Cited by 1
“R This property is reasonable since the final state must be insensitive to the choice of the initial state, if the ergodicity condition is satisfied [21].”
BackgroundMethodQUBO Formulation for Sparse Sensor Placement for Classification
van Dommelen, M. R., & Phillipson, F. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-60433-1_2 · Cited by 1
Anomalously slow dynamics of inhomogeneous quantum annealing
Dadgar, M., & Baldwin, C. L. (2025) · Physical Review A · doi:10.1103/physreva.111.062601 · Cited by 3
Noise effects on diabatic quantum annealing protocols
Salatino, G., Matzler, M., Scocco, A., Lucignano, P., & Passarelli, G. (2025) · Physical Review A · doi:10.1103/x9hw-xhvj · Cited by 3
“The quantum adiabatic theorem is the basis for these approaches, ensuring that if the evolution is sufficiently slow, the system will remain in its ground state throughout the process, leading to an accurate solution [20, 21].”
Matsuzaki, Y., Mori, Y., Yamaguchi, A., Kawakami, Y., & Yamamoto, T. (2025) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/adcb7a · Cited by 2
Solving the Cruise Passenger Itinerary Scheduling Problem Using Quantum-Inspired Computing
Ou, C., Lin, Y.-C., Chen, W.-Y., & Wu, K. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00041 · Cited by 2
“Its principle involves leveraging quantum state superposition and tunneling effects to rapidly locate the global optimal solution within a complex solution space [20].”
Analytical shortcuts to adiabaticity of weakly driven processes
Nazé, P. (2025) · Physical review. E · doi:10.1103/x5vw-5934 · Cited by 5
Modeling of shortest path of a graph in quantum computing
Singh, N. B., Pachuau, J. L., & Saha, A. K. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07968-3 · Cited by 3
“It collapses to the classical states giving optimal or near-optimal solution [10, 11].”
Hardware-efficient quantum annealing with error mitigation via classical shadow
Yoshida, T., Shingu, Y., Shimada, C., Nikuni, T., Hakoshima, H., & Matsuzaki, Y. (2026) · Physical Review A · doi:10.1103/stb4-wms8
Standardization of Multi-Objective QUBOs
Lee, L. K., Gerlach, T., & Piatkowski, N. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00017 · Cited by 2
“MC { 0 , 1 } and MC [1 , 5] on the other hand indicates if any two influencer share a common language and how compatible their timezones are respectively.”
InfluentialNoori, M., Valiante, E., Rozada, I., Vaerenbergh, T. V., & Mohseni, M. (2026) · Physical Review Applied · doi:10.1103/2fpj-t663 · Cited by 6
“Such stochastic methods are quite diverse, ranging from heuristic algorithms on CPUs, GPUs [3], and FPGAs [4–6] to specialized hardware such as quantum [7] and custom-designed classical [8–15] devices.”
Optimal quantum likelihood estimation
Levi, A., Ossi, Z., Cohen, E., & Te’eni, A. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ae2b31 · Cited by 1
An advanced hybrid quantum tabu search approach to vehicle routing problems
Holliday, J. B., Osaba, E., & Luu, K. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00375-8 · Cited by 11
“Today, several approaches are investigated in quantum optimization, with quantum annealing (QA) [31] and variational quantum algorithms like the quantum approximate optimization algorithm (QAOA) [32] being among the most notable.”
Reduction of energy-gap scaling by coherent catalysis in models of quantum annealing
Koh, Y. W., & Nishimori, H. (2020) · Physical Review A · doi:10.1103/physreva.101.052304 · Cited by 1
Self-citationAbsence of small-world effects at the quantum level and stability of the quantum critical point
Ostilli, M. (2020) · Physical review. E · doi:10.1103/physreve.102.052126 · Cited by 3
Dynamic Spectrum Allocation for Bursty Traffic Using Quantum Annealing
Inoue, S., Kawakita, Y., & Tobe, Y. (2023) · International Conference on Platform Technology and Service · doi:10.1109/platcon60102.2023.10255197 · Cited by 1
Cirauqui, D., García-March, M. Á., Saavedra, J. R. M., et al. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.144202 · Cited by 1
“On the other hand, while the new advances on Quantum Annealing (QA) machines [25, 26] pose them as firm contenders to efficiently solve these kind of QUBO problems, they’re still far away from surpassing classical computation.”
BackgroundQuantum Computer-Generated Holography
Shimobaba, T., Wang, F., & Ito, T. (2025) · IEEE Access · doi:10.1109/access.2025.3564553 · Cited by 1
“Another type of quantum computing is known as quantum annealing [45].”
Transfer learning for a deep-unfolded combinatorial optimization solver with quantum annealer
Hagiwara, R., Arai, S., & Takabe, S. (2025) · Physical Review A · doi:10.1103/d3sc-3wkj · Cited by 1
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
Self-citationMukherjee, S. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0406 · Cited by 3
Statistics of the number of defects after quantum annealing in a thermal environment
Suzuki, S., Oshiyama, H., & Shibata, N. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0411 · Cited by 1
Many Known Quantum Algorithms Are Optimal: Symmetry-Based Proofs
Крейнович, В., Galindo, O., & Kosheleva, O. M. (2022) · International Journal of Computing · doi:10.47839/ijc.21.4.2776 · Cited by 1
“, [4]–[6], [8], [18], [21], [22], [24], [28], [31], [32], [34].”
BackgroundSuzuki, S. (2010) · Lecture notes in physics · doi:10.1007/978-3-642-11470-0_5 · Cited by 4
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.