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

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

Simulated annealing versus quantum annealing

Matthias Troyer

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

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

Beyond Standard Quantum Annealing

Tameem Albash

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

Load balancing for high performance computing using quantum annealing

Omer Rathore, Alastair G. Basden, Nicholas Chancellor +1 more

With the advent of exascale computing, effective load balancing in massively parallel software applications is critically important for leveraging the full potential of high-performance computing systems. Load balancing is the distribution of computational work between available processors. Here, we investigate the application of quantum annealing to load balance two paradigmatic algorithms in high-performance computing. Namely, adaptive mesh refinement and smoothed particle hydrodynamics are chosen as representative grid and off-grid target applications. While the methodology for obtaining real simulation data to partition is application specific, the proposed balancing protocol itself remains completely general. In a grid based context, quantum annealing is found to outperform classical methods such as the round robin protocol but lacks a decisive advantage over more advanced methods such as steepest descent or simulated annealing despite remaining competitive. The primary obstacle to scalability is found to be limited coupling on current quantum annealing hardware. However, for the more complex particle formulation, approached as a multiobjective optimization, quantum annealing solutions are demonstrably Pareto dominant to state of the art classical methods across both objectives. This signals a noteworthy advancement in solution quality which can have a large impact on effective CPU usage.

arXiv:2403.05278•Physical Review Research•Jan 17, 2025•14 citations

Solving problems with quantum annealing

M. C. Thom

Digitale Welt•Mar 8, 2021•4 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.
With the advent of exascale computing, effective load balancing in massively parallel software applications is critically important for leveraging the full potential of high-performance computing systems. Load balancing is the distribution of computational work between available processors. Here, we investigate the application of quantum annealing to load balance two paradigmatic algorithms in high-performance computing. Namely, adaptive mesh refinement and smoothed particle hydrodynamics are chosen as representative grid and off-grid target applications. While the methodology for obtaining real simulation data to partition is application specific, the proposed balancing protocol itself remains completely general. In a grid based context, quantum annealing is found to outperform classical methods such as the round robin protocol but lacks a decisive advantage over more advanced methods such as steepest descent or simulated annealing despite remaining competitive. The primary obstacle to scalability is found to be limited coupling on current quantum annealing hardware. However, for the more complex particle formulation, approached as a multiobjective optimization, quantum annealing solutions are demonstrably Pareto dominant to state of the art classical methods across both objectives. This signals a noteworthy advancement in solution quality which can have a large impact on effective CPU usage.