Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Convergence theorems for quantum annealing

悟史 森田, Satoshi Morita, 秀稔 西森, Hidetoshi Nishimori

Published Oct 1, 2006• 0 citations
OpenAlex

Related papers

Convergence of quantum annealing with real-time Schrödinger dynamics

悟史 森田, Satoshi Morita, 秀稔 西森 +1 more

•May 1, 2007•0 citations

On Convergence of Tabu-Enhanced Quantum Annealing Algorithm

Alexander Rumyantsev, Davide Pastorello, Enrico Blanzieri +1 more

Communications in computer and information science•Jan 1, 2022•0 citations

Convergence of Quantum Annealing with Real-Time Schrodinger Dynamics(General)

Satoshi Morita, Hidetoshi Nishimori

Journal of the Physical Society of Japan•Jun 15, 2007•1 citation

Mathematical foundation of quantum annealing

悟史 森田, Satoshi Morita, 秀稔 西森 +1 more

•Dec 1, 2008•0 citations

Rigorous convergence condition for quantum annealing

Yusuke Kimura, Hidetoshi Nishimori

Abstract We derive a generic bound on the rate of decrease of transverse field for quantum annealing to converge to the ground state of a generic Ising model when quantum annealing is formulated as an infinite-time process. Our theorem is based on a rigorous upper bound on the excitation probability in the infinite-time limit and is a mathematically rigorous counterpart of a previously known result derived only from the leading-order term of the asymptotic expansion of adiabatic condition. Since our theorem gives a sufficient condition of convergence for a generic transverse-field Ising model, any specific problem may allow a better, faster, control of the coefficient.

arXiv:2207.12096•Journal of Physics A Mathematical and Theoretical•Oct 27, 2022•6 citations

Convergence theorems for quantum annealing

Satoshi Morita, Hidetoshi Nishimori

We prove several theorems to give sufficient conditions for convergence of quantum annealing, which is a protocol to solve generic optimization problems by quantum dynamics. In particular the property of strong ergodicity is proved for the path-integral Monte Carlo implementation of quantum annealing for the transverse Ising model under a power decay of the transverse field. This result is to be compared with the much slower inverse-log decay of temperature in the conventional simulated annealing. Similar results are proved for the Green's function Monte Carlo approach. Optimization problems in continuous space of particle configurations are also discussed.

arXiv:quant-ph/0608154•Journal of Physics A Mathematical and General•Oct 24, 2006•51 citations
Abstract We derive a generic bound on the rate of decrease of transverse field for quantum annealing to converge to the ground state of a generic Ising model when quantum annealing is formulated as an infinite-time process. Our theorem is based on a rigorous upper bound on the excitation probability in the infinite-time limit and is a mathematically rigorous counterpart of a previously known result derived only from the leading-order term of the asymptotic expansion of adiabatic condition. Since our theorem gives a sufficient condition of convergence for a generic transverse-field Ising model, any specific problem may allow a better, faster, control of the coefficient.
We prove several theorems to give sufficient conditions for convergence of quantum annealing, which is a protocol to solve generic optimization problems by quantum dynamics. In particular the property of strong ergodicity is proved for the path-integral Monte Carlo implementation of quantum annealing for the transverse Ising model under a power decay of the transverse field. This result is to be compared with the much slower inverse-log decay of temperature in the conventional simulated annealing. Similar results are proved for the Green's function Monte Carlo approach. Optimization problems in continuous space of particle configurations are also discussed.