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

Journal of Statistical Physics

Simulated annealing and quantum detailed balance

Alberto Frigerio

Published Jan 1, 1990• 10 citations
Publisher
DOI
10.1007/bf01020296

Related papers

Simulated annealing versus quantum annealing

Matthias Troyer

Bulletin of the American Physical Society•Mar 14, 2016•1 citation

Re'class'ification of 'quant'ified classical simulated annealing

Toshiyuki Tanaka

We discuss a classical reinterpretation of quantum-mechanics-based analysis of classical Markov chains with detailed balance, that is based on the quantum-classical correspondence. The classical reinterpretation is then used to demonstrate that it successfully reproduces a sufficient condition for cooling schedule in classical simulated annealing, which has the inverse-logarithmic scaling.

arXiv:0810.0557•Journal of Physics Conference Series•Jan 7, 2009•0 citations

Re‘class’ification of ‘quant’ified classical simulated annealing

Abstract. We discuss a classical reinterpretation of quantum-mechanics-based analysis of classical Markov chains with detailed balance, that is based on the quantum-classical correspondence. The classical reinterpretation is then used to demonstrate that it successfully reproduces a sufficient condition for cooling schedule in classical simulated annealing, which has the inverse-logarithm scaling. 1.

•Nov 20, 2012•0 citations

Experiments on Quantum Annealing

G. Aeppli, T. F. Rosenbaum

Lecture notes in physics•Nov 16, 2005•2 citations

Beyond Standard Quantum Annealing

Tameem Albash

Bulletin of the American Physical Society•Mar 4, 2020•0 citations

An Upper-Bound Inequality for the Calculation Time in Simulated Annealing: A Classical Analogue of the Adiabatic Theorem

Akihisa Ichiki, Masayuki Ohzeki

It has recently been reported that classical systems have a speed limit for state evolution, although the concept of a speed limit had previously been considered to be unique to quantum systems. Owing to the speed limit for classical systems, a lower bound on the calculation time of simulated annealing for a desired calculation accuracy can be derived. However, such a lower bound does not provide a practical criterion for determining whether a calculation can be completed within a reasonable time. In this paper, we derive an inequality for classical systems analogous to the quantum adiabatic theorem, which provides a calculation time that guarantees a specified accuracy for fluctuation-exploiting computation. For a Fokker–Planck evolution with a spectral gap, the error is bounded by a relaxation term and, for a genuinely driven annealing protocol, by an additional driving term proportional to the speed of the instantaneous stationary distribution. The trade-off relation between calculation time and accuracy is given in a form that is tolerable for practical use. The result clarifies the roles of the relaxation gap and annealing speed, as well as the possible acceleration caused by detailed-balance-violating dynamics.

arXiv:2107.01792•Journal of the Physical Society of Japan•Oct 30, 2026•0 citations
It has recently been reported that classical systems have a speed limit for state evolution, although the concept of a speed limit had previously been considered to be unique to quantum systems. Owing to the speed limit for classical systems, a lower bound on the calculation time of simulated annealing for a desired calculation accuracy can be derived. However, such a lower bound does not provide a practical criterion for determining whether a calculation can be completed within a reasonable time. In this paper, we derive an inequality for classical systems analogous to the quantum adiabatic theorem, which provides a calculation time that guarantees a specified accuracy for fluctuation-exploiting computation. For a Fokker–Planck evolution with a spectral gap, the error is bounded by a relaxation term and, for a genuinely driven annealing protocol, by an additional driving term proportional to the speed of the instantaneous stationary distribution. The trade-off relation between calculation time and accuracy is given in a form that is tolerable for practical use. The result clarifies the roles of the relaxation gap and annealing speed, as well as the possible acceleration caused by detailed-balance-violating dynamics.