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:1202.5868

QUANTUM ANNEALING AND QUANTUM FLUCTUATION EFFECT IN FRUSTRATED ISING SYSTEMS

SHU TANAKA, RYO TAMURA

Published Sep 27, 2012• 1 citation
arXivHTMLPDF

Abstract

Quantum annealing method has been widely attracted attention in statistical physics and information science since it is expected to be a powerful method to obtain the best solution of optimization problem as well as simulated annealing. The quantum annealing method was incubated in quantum statistical physics. This is an alternative method of the simulated annealing which is well-adopted for many optimization problems. In the simulated annealing, we obtain a solution of optimization problem by decreasing temperature (thermal fluctuation) gradually. In the quantum annealing, in contrast, we decrease quantum field (quantum fluctuation) gradually and obtain a solution. In this paper we review how to implement quantum annealing and show some quantum fluctuation effects in frustrated Ising spin systems.

DOI
10.1142/9789814425285_0011

Related papers

MICROSCOPIC PROPERTIES OF QUANTUM ANNEALING — APPLICATION TO FULLY FRUSTRATED ISING SYSTEMS

Shu Tanaka

In this paper we show quantum fluctuation effect of fully frustrated Ising spin systems. Quantum annealing has been expected to be an efficient method to find ground state of optimization problems. However it is not clear when to use the quantum annealing. In order to clarify when the quantum annealing works well, we have to study microscopic properties of quantum annealing. In fully frustrated Ising spin systems, there are macroscopically degenerated ground states. When we apply quantum annealing to fully frustrated systems, we cannot obtain each ground state with the same probability. This nature is consistent with "order by disorder" which is well-known mechanism in frustrated systems.

arXiv:1106.0555•Sep 27, 2012•0 citations

QUANTUM ANNEALING: FROM VIEWPOINTS OF STATISTICAL PHYSICS, CONDENSED MATTER PHYSICS, AND COMPUTATIONAL PHYSICS

Shu Tanaka, Ryo Tamura

In this paper, we review some features of quantum annealing and related topics from viewpoints of statistical physics, condensed matter physics, and computational physics. We can obtain a better solution of optimization problems in many cases by using the quantum annealing. Actually the efficiency of the quantum annealing has been demonstrated for problems based on statistical physics. Then the quantum annealing has been expected to be an efficient and generic solver of optimization problems. Since many implementation methods of the quantum annealing have been developed and will be proposed in the future, theoretical frameworks of wide area of science and experimental technologies will be evolved through studies of the quantum annealing.

arXiv:1204.2907•Kinki Universtiy series on quantum computing•Oct 4, 2012•3 citations

Quantum Annealing: An Introduction and New Developments

Masayuki Ohzeki, Hidetoshi Nishimori

Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary results for an alternative method. The review part includes the relationship of quantum annealing with classical simulated annealing. We next propose a novel quantum algorithm which might be available for hard optimization problems by using a classical-quantum mapping as well as the Jarzynski equality introduced in nonequilibrium statistical physics.

arXiv:1006.1696•Journal of Computational and Theoretical Nanoscience•Mar 23, 2011•51 citations

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

Yoshiaki Horiike, Yuki Kawaguchi

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.

cond-mat.stat-mechCross-listedarXiv:2511.16457•Nov 21, 2025•1 citation

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

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
Quantum annealing method has been widely attracted attention in statistical physics and information science since it is expected to be a powerful method to obtain the best solution of optimization problem as well as simulated annealing. The quantum annealing method was incubated in quantum statistical physics. This is an alternative method of the simulated annealing which is well-adopted for many optimization problems. In the simulated annealing, we obtain a solution of optimization problem by decreasing temperature (thermal fluctuation) gradually. In the quantum annealing, in contrast, we decrease quantum field (quantum fluctuation) gradually and obtain a solution. In this paper we review how to implement quantum annealing and show some quantum fluctuation effects in frustrated Ising spin systems.
In this paper we show quantum fluctuation effect of fully frustrated Ising spin systems. Quantum annealing has been expected to be an efficient method to find ground state of optimization problems. However it is not clear when to use the quantum annealing. In order to clarify when the quantum annealing works well, we have to study microscopic properties of quantum annealing. In fully frustrated Ising spin systems, there are macroscopically degenerated ground states. When we apply quantum annealing to fully frustrated systems, we cannot obtain each ground state with the same probability. This nature is consistent with "order by disorder" which is well-known mechanism in frustrated systems.
In this paper, we review some features of quantum annealing and related topics from viewpoints of statistical physics, condensed matter physics, and computational physics. We can obtain a better solution of optimization problems in many cases by using the quantum annealing. Actually the efficiency of the quantum annealing has been demonstrated for problems based on statistical physics. Then the quantum annealing has been expected to be an efficient and generic solver of optimization problems. Since many implementation methods of the quantum annealing have been developed and will be proposed in the future, theoretical frameworks of wide area of science and experimental technologies will be evolved through studies of the quantum annealing.
Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary results for an alternative method. The review part includes the relationship of quantum annealing with classical simulated annealing. We next propose a novel quantum algorithm which might be available for hard optimization problems by using a classical-quantum mapping as well as the Jarzynski equality introduced in nonequilibrium statistical physics.
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.
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.
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 . . . . . . . . . . . . . . . . . . . . . . . .