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

arXiv:2511.16457

Distinguishing thermal versus quantum annealing using probability-flux signatures across interaction networks

Yoshiaki Horiike, Yuki Kawaguchi

cond-mat.stat-mechcond-mat.dis-nncond-mat.quant-gasphysics.data-anquant-phSubmitted Nov 20, 2025• Announced Nov 21, 2025• 1 citation• Revised Dec 4, 2025 (v2)
v1 · Nov 20, 2025v2 · Dec 4, 2025
arXivHTMLPDF

Abstract

Simulated annealing provides a heuristic solution to combinatorial optimization problems. The cost function of a problem is mapped onto the energy function of a physical many-body system, and, by using thermal or quantum fluctuations, the system explores the state space to find the ground state, which corresponds to the optimal solution of the problem. Studies have highlighted both the similarities and differences between thermal and quantum fluctuations. Nevertheless, fundamental understanding of thermal and quantum annealing remains incomplete, making it unclear how quantum annealing outperforms thermal annealing in which problem instances. Here, we investigate the many-body dynamics of thermal and quantum annealing by examining all possible interaction networks of $\pm J$ Ising spin systems up to seven spins. Our comprehensive investigation reveals that differences between thermal and quantum annealing emerge for particular interaction networks, indicating that the structure of the energy landscape distinguishes the two dynamics. We identify the microscopic origin of these differences through probability fluxes in state space, finding that the two dynamics are broadly similar, but that quantum tunnelling produces qualitative differences. Our results provide insight into how thermal and quantum fluctuations navigate a system toward the ground state in simulated annealing, and are experimentally verifiable in atomic, molecular, and optical systems. Furthermore, these insights may improve mappings of optimization problems to Ising spin systems, yielding more accurate solutions in faster simulated annealing and thus benefiting real-world applications in industry. Our comprehensive survey of interaction networks and visualization of probability flux can help to understand, predict, and control quantum advantage in quantum annealing.

Related papers

Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics

Steven Abel, Andrei Constantin, Luca A. Nutricati

Quantum annealing is a computational paradigm in which optimisation problems are mapped onto the energy landscape of an interacting quantum system and explored through its dynamical evolution. By continuously transforming a simple initial Hamiltonian into one whose ground state encodes the solution, the system traverses a complex landscape via a combination of quantum fluctuations, tunnelling processes, and dissipative dynamics. Unlike gate-based quantum computing, quantum annealing is a specialised and near-term approach aimed primarily at discrete optimisation and sampling tasks. While it is not expected to provide polynomial-time solutions to NP-hard problems in the worst case, it offers a physically motivated heuristic for navigating rugged energy landscapes that arise across science and engineering. Modern quantum annealers realise programmable spin systems with thousands of qubits, placing them among the largest controllable quantum devices currently available. As a result, their significance extends beyond optimisation: they also function as experimental platforms for studying non-equilibrium many-body quantum dynamics in regimes that are difficult to access using classical simulation. In this review we present an accessible introduction to the principles of quantum annealing, describe the main hardware platforms and algorithmic techniques, and analyse how tunnelling, spectral gaps, and open-system effects shape computational performance. We survey applications ranging from optimisation and machine learning to quantum simulation and many-body physics, and discuss the central challenges in benchmarking, scaling, and control. These perspectives position quantum annealing as a distinctive framework at the interface of optimisation, stochastic sampling, and programmable quantum dynamics, with a role that is complementary to both classical algorithms and gate-based quantum computing.

quant-pharXiv:2605.06857•Contemporary Physics•May 11, 2026•1 citation

Quantum annealing in the transverse Ising model

Tadashi Kadowaki, Hidetoshi Nishimori

We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between states and thus play the same role as thermal fluctuations in the conventional approach. The idea is tested by the transverse Ising model, in which the transverse field is a function of time similar to the temperature in the conventional method. The goal is to find the ground state of the diagonal part of the Hamiltonian with high accuracy as quickly as possible. We have solved the time-dependent Schr\"odinger equation numerically for small size systems with various exchange interactions. Comparison with the results of the corresponding classical (thermal) method reveals that the quantum annealing leads to the ground state with much larger probability in almost all cases if we use the same annealing schedule.

arXiv:cond-mat/9804280•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Nov 1, 1998•2,516 citations

Optimization through quantum annealing: theory and some applications

Demian A. Battaglia, Lorenzo Stella

Quantum annealing is a promising tool for solving optimization problems, similar in some ways to the traditional (classical) simulated annealing of Kirkpatrick et al. Simulated annealing takes advantage of thermal fluctuations in order to explore the optimization landscape of the problem at hand, whereas quantum annealing employs quantum fluctuations. Intriguingly, quantum annealing has been proved to be more effective than its classical counterpart in many applications. We illustrate the theory and the practical implementation of both classical and quantum annealing – highlighting the crucial differences between these two methods – by means of results recently obtained in experiments, in simple toy-models, and more challenging combinatorial optimization problems (namely, Random Ising model and Travelling Salesman Problem). The techniques used to implement quantum and classical annealing are either deterministic evolutions, for the simplest models, or Monte Carlo approaches, for harder optimization tasks. We discuss the pro and cons of these approaches and their possible connections to the landscape of the problem addressed.

Contemporary Physics•Jul 1, 2006•9 citations

Study of Optimization Problems by Quantum Annealing(量子アニーリングによる最適化問題の研究)

門脇正史

We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state.Quantum fluctuations cause transitions between states and thus play the same role as thermal fluctuations in the conventional approach.The idea is tested by the two models, the transverse Ising model and the traveling salesman problem.Adding the transverse field to the Ising model is a simple way to introduce quantum fluctuations.The strength of the transverse field is controlled as a function of time similarly to the temperature in the conventional method.The goal is to find the ground state of the diagonal part of the Hamiltonian with high accuracy as quickly as possible.We also consider the traveling salesman problem.This model can be described by the Ising spin, so that we also apply the same technique to the transverse Ising model.We solve the time-dependent Schrödinger equation numerically for small size systems with various types of exchange interactions of the Ising model.Comparison with the results of the corresponding classical (thermal) method reveals that the quantum method leads to the ground state with much larger probability in almost all cases if we use the same annealing schedule of the control parameters.We check the case of large-size systems by using the quantum Monte Carlo method.The simulation supports the results of the small-size systems, while the dynamics of the Schrödinger equation and the quantum Monte Carlo method are not the same.We find that the simulated annealing by quantum fluctuations has a better performance than the conventional method for the ground state search of the Ising-spin systems.The calculation of the traveling salesman problem is also performed as A.3 Case of Γ(t) = c/ √ t . . . . . . . . . . . . . . . . . . . . . . . .

•Jan 1, 1999•0 citations

Study of Optimization Problems by Quantum Annealing

Tadashi Kadowaki

We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. The idea is tested by the two models, the transverse Ising model and the traveling salesman problem (TSP). Adding the transverse field to the Ising model is a simple way to introduce quantum fluctuations. The strength of the transverse field is controlled as a function of time similarly to the temperature in the conventional method. TSP can be described by the Ising spin, so that we also apply the same technique to TSP. We directory solve the time-dependent Schrödinger equation for small-size systems and perform the quantum Monte Carlo simulation for large-size systems. Comparison with the results of the corresponding classical (thermal) method reveals that the quantum method leads to the ground state with much larger probability in almost all cases if we use the same annealing schedule of the control parameters. We also find that the relaxation time is quite short for quantum systems by numerical simulations. We consider this is one of the reasons why the annealing in quantum systems have a better performance of finding the optimal state in comparison with classical systems.

arXiv:quant-ph/0205020•May 5, 2002•68 citations

A comparison of classical and quantum annealing dynamics

Sei Suzuki

Simulated annealing and quantum annealing are algorithms for combinatorial optimization problems. The former brings solutions using thermal fluctuations and through classical dynamics, while the latter does using quantum fluctuations and through quantum dynamics. In this paper, dynamics of these two algorithms are compared by means of the Kibble-Zurek argument, employing a one-dimensional random Ising model as an exercise for algorithms. We reveal that quantum annealing reduces residual errors faster than simulated annealing with decreasing annealing rate. The result implies the advantage of quantum annealing over simulated annealing.

Journal of Physics Conference Series•Jan 7, 2009•9 citations
Simulated annealing provides a heuristic solution to combinatorial optimization problems. The cost function of a problem is mapped onto the energy function of a physical many-body system, and, by using thermal or quantum fluctuations, the system explores the state space to find the ground state, which corresponds to the optimal solution of the problem. Studies have highlighted both the similarities and differences between thermal and quantum fluctuations. Nevertheless, fundamental understanding of thermal and quantum annealing remains incomplete, making it unclear how quantum annealing outperforms thermal annealing in which problem instances. Here, we investigate the many-body dynamics of thermal and quantum annealing by examining all possible interaction networks of ±J\pm J±J Ising spin systems up to seven spins. Our comprehensive investigation reveals that differences between thermal and quantum annealing emerge for particular interaction networks, indicating that the structure of the energy landscape distinguishes the two dynamics. We identify the microscopic origin of these differences through probability fluxes in state space, finding that the two dynamics are broadly similar, but that quantum tunnelling produces qualitative differences. Our results provide insight into how thermal and quantum fluctuations navigate a system toward the ground state in simulated annealing, and are experimentally verifiable in atomic, molecular, and optical systems. Furthermore, these insights may improve mappings of optimization problems to Ising spin systems, yielding more accurate solutions in faster simulated annealing and thus benefiting real-world applications in industry. Our comprehensive survey of interaction networks and visualization of probability flux can help to understand, predict, and control quantum advantage in quantum annealing.
Quantum annealing is a computational paradigm in which optimisation problems are mapped onto the energy landscape of an interacting quantum system and explored through its dynamical evolution. By continuously transforming a simple initial Hamiltonian into one whose ground state encodes the solution, the system traverses a complex landscape via a combination of quantum fluctuations, tunnelling processes, and dissipative dynamics. Unlike gate-based quantum computing, quantum annealing is a specialised and near-term approach aimed primarily at discrete optimisation and sampling tasks. While it is not expected to provide polynomial-time solutions to NP-hard problems in the worst case, it offers a physically motivated heuristic for navigating rugged energy landscapes that arise across science and engineering. Modern quantum annealers realise programmable spin systems with thousands of qubits, placing them among the largest controllable quantum devices currently available. As a result, their significance extends beyond optimisation: they also function as experimental platforms for studying non-equilibrium many-body quantum dynamics in regimes that are difficult to access using classical simulation. In this review we present an accessible introduction to the principles of quantum annealing, describe the main hardware platforms and algorithmic techniques, and analyse how tunnelling, spectral gaps, and open-system effects shape computational performance. We survey applications ranging from optimisation and machine learning to quantum simulation and many-body physics, and discuss the central challenges in benchmarking, scaling, and control. These perspectives position quantum annealing as a distinctive framework at the interface of optimisation, stochastic sampling, and programmable quantum dynamics, with a role that is complementary to both classical algorithms and gate-based quantum computing.
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between states and thus play the same role as thermal fluctuations in the conventional approach. The idea is tested by the transverse Ising model, in which the transverse field is a function of time similar to the temperature in the conventional method. The goal is to find the ground state of the diagonal part of the Hamiltonian with high accuracy as quickly as possible. We have solved the time-dependent Schr\"odinger equation numerically for small size systems with various exchange interactions. Comparison with the results of the corresponding classical (thermal) method reveals that the quantum annealing leads to the ground state with much larger probability in almost all cases if we use the same annealing schedule.
Quantum annealing is a promising tool for solving optimization problems, similar in some ways to the traditional (classical) simulated annealing of Kirkpatrick et al. Simulated annealing takes advantage of thermal fluctuations in order to explore the optimization landscape of the problem at hand, whereas quantum annealing employs quantum fluctuations. Intriguingly, quantum annealing has been proved to be more effective than its classical counterpart in many applications. We illustrate the theory and the practical implementation of both classical and quantum annealing – highlighting the crucial differences between these two methods – by means of results recently obtained in experiments, in simple toy-models, and more challenging combinatorial optimization problems (namely, Random Ising model and Travelling Salesman Problem). The techniques used to implement quantum and classical annealing are either deterministic evolutions, for the simplest models, or Monte Carlo approaches, for harder optimization tasks. We discuss the pro and cons of these approaches and their possible connections to the landscape of the problem addressed.
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state.Quantum fluctuations cause transitions between states and thus play the same role as thermal fluctuations in the conventional approach.The idea is tested by the two models, the transverse Ising model and the traveling salesman problem.Adding the transverse field to the Ising model is a simple way to introduce quantum fluctuations.The strength of the transverse field is controlled as a function of time similarly to the temperature in the conventional method.The goal is to find the ground state of the diagonal part of the Hamiltonian with high accuracy as quickly as possible.We also consider the traveling salesman problem.This model can be described by the Ising spin, so that we also apply the same technique to the transverse Ising model.We solve the time-dependent Schrödinger equation numerically for small size systems with various types of exchange interactions of the Ising model.Comparison with the results of the corresponding classical (thermal) method reveals that the quantum method leads to the ground state with much larger probability in almost all cases if we use the same annealing schedule of the control parameters.We check the case of large-size systems by using the quantum Monte Carlo method.The simulation supports the results of the small-size systems, while the dynamics of the Schrödinger equation and the quantum Monte Carlo method are not the same.We find that the simulated annealing by quantum fluctuations has a better performance than the conventional method for the ground state search of the Ising-spin systems.The calculation of the traveling salesman problem is also performed as A.3 Case of Γ(t) = c/ √ t . . . . . . . . . . . . . . . . . . . . . . . .
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. The idea is tested by the two models, the transverse Ising model and the traveling salesman problem (TSP). Adding the transverse field to the Ising model is a simple way to introduce quantum fluctuations. The strength of the transverse field is controlled as a function of time similarly to the temperature in the conventional method. TSP can be described by the Ising spin, so that we also apply the same technique to TSP. We directory solve the time-dependent Schrödinger equation for small-size systems and perform the quantum Monte Carlo simulation for large-size systems. Comparison with the results of the corresponding classical (thermal) method reveals that the quantum method leads to the ground state with much larger probability in almost all cases if we use the same annealing schedule of the control parameters. We also find that the relaxation time is quite short for quantum systems by numerical simulations. We consider this is one of the reasons why the annealing in quantum systems have a better performance of finding the optimal state in comparison with classical systems.
Simulated annealing and quantum annealing are algorithms for combinatorial optimization problems. The former brings solutions using thermal fluctuations and through classical dynamics, while the latter does using quantum fluctuations and through quantum dynamics. In this paper, dynamics of these two algorithms are compared by means of the Kibble-Zurek argument, employing a one-dimensional random Ising model as an exercise for algorithms. We reveal that quantum annealing reduces residual errors faster than simulated annealing with decreasing annealing rate. The result implies the advantage of quantum annealing over simulated annealing.