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:1102.2025 · Journal of Physics Conference Series

Nonequilibrium work performed in quantum annealing

Masayuki Ohzeki, Hidetoshi Nishimori

Published Jul 20, 2011• 8 citations
arXivHTMLPDF

Abstract

Quantum annealing is a generic solver of classical optimization problems that makes full use of quantum fluctuations. We consider work statistics given by a repetition of quantum annealing processes by employing the Jarzynski equality proposed in nonequilibrium statistical physics. In particular, we analyze a nonequilibrium average of the exponentiated work performed by a transverse field. A special symmetry, gauge symmetry, leads to a non-trivial relationship between quantum annealing toward different targets in the theory of spin glasses. We believe that our results will be a step toward an alternative realization of efficient quantum computation as well as our better understanding of nonequilibrium behavior of systems under quantum control.

DOI
10.1088/1742-6596/302/1/012047

Related papers

Nonequilibrium work performed in quantum annealing

Ohzeki, M., 西森秀稔, Hidetoshi Nishimori

Quantum annealing is a generic solver of classical optimization problems that makes full use of quantum fluctuations. We consider work statistics given by a repetition of quantum annealing processes by employing the Jarzynski equality proposed in nonequilibrium statistical physics. In particular, we analyze the distribution of the work performed by a transverse field. A special symmetry, gauge symmetry, leads to a non-trivial relationship between quantum annealing toward different targets in the theory of spin glasses. We believe that our results will be a step toward an alternative realization of efficient quantum computation as well as our better understanding of nonequilibrium behavior of systems under quantum control.

•Sep 18, 2019•11 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

Quantum versus Classical Annealing: Insights from Scaling Theory and Results for Spin Glasses on 3-Regular Graphs

Chengwei Liu, Anatoli Polkovnikov, Anders W. Sandvik

We discuss an Ising spin glass where each S=1/2 spin is coupled antiferromagnetically to three other spins (3-regular graphs). Inducing quantum fluctuations by a time-dependent transverse field, we use out-of-equilibrium quantum Monte Carlo simulations to study dynamic scaling at the quantum glass transition. Comparing the dynamic exponent and other critical exponents with those of the classical (temperature-driven) transition, we conclude that quantum annealing is less efficient than classical simulated annealing in bringing the system into the glass phase. Quantum computing based on the quantum annealing paradigm is therefore inferior to classical simulated annealing for this class of problems. We also comment on previous simulations where a parameter is changed with the simulation time, which is very different from the true Hamiltonian dynamics simulated here.

arXiv:1409.7192•Physical Review Letters•Apr 7, 2015•54 citations

Quantum Annealing with the Jarzynski Equality

Masayuki Ohzeki, Hidetoshi Nishimori

We show a practical application of the Jarzynski equality in quantum computation. Its implementation may open a way to solve combinatorial optimization problems, minimization of a real single-valued function, cost function, with many arguments. We consider to incorporate the Jarzynski equality into quantum annealing, which is one of the generic algorithms to solve the combinatorial optimization problem. The ordinary quantum annealing suffers from nonadiabatic transitions whose rate is characterized by the minimum energy gap Δmin of the quantum system under consideration. The quantum sweep speed is therefore restricted to be extremely slow for the achievement to obtain a solution without relevant errors. However, in our strategy shown in the present study, we find that such a difficulty would not matter.

arXiv:1001.0836•Physical Review Letters•Jul 12, 2010•32 citations

Adiabatic bottlenecks in quantum annealing and nonequilibrium dynamics of paramagnons

Tim Bode, Frank K. Wilhelm

The correspondence between long-range interacting quantum spin glasses and combinatorial optimization problems underpins the physical motivation for adiabatic quantum computing. On one hand, in disordered (quantum) spin systems, the focus is on exact methods such as the replica trick that allow the calculation of system quantities in the limit of infinite system and ensemble size. On the other hand, when solving a given instance of an optimization problem, disorder-averaged quantities are of no relevance, as one is solely interested in instance-specific, finite-size properties, in particular the optimal solution. Here, we apply the nonequilibrium Green's function formalism to the spin coherent-state path integral to obtain the statistical fluctuations and the collective-excitation spectrum along the annealing path. For the example of the quantum Sherrington-Kirkpatrick spin glass, by comparing to extensive numerically exact results, we show that this method provides access to the instance-specific bottlenecks of the annealing protocol.

arXiv:2403.11548•Physical Review A•Jul 12, 2024•6 citations

Quantum Spin Glasses, Annealing and Computation

Shu Tanaka, Ryo Tamura, Bikas K. Chakrabarti

Quantum annealing is a new-generation tool of information technology, which helps in solving combinatorial optimization problems with high precision, based on the concepts of quantum statistical physics. Detailed discussion on quantum spin glasses and its application in solving combinatorial optimization problems is required for better understanding of quantum annealing concepts. Fulfilling this requirement, the book highlights recent development in quantum spin glasses including Nishimori line, replica method and quantum annealing methods along with the essential principles. Separate chapters on simulated annealing, quantum dynamics and classical spin models are provided for enhanced learning. Important topics including adiabatic quantum computers and quenching dynamics are discussed in detail. This text will be useful for students of quantum computation, quantum information, statistical physics and computer science.

•May 4, 2017•88 citations
Quantum annealing is a generic solver of classical optimization problems that makes full use of quantum fluctuations. We consider work statistics given by a repetition of quantum annealing processes by employing the Jarzynski equality proposed in nonequilibrium statistical physics. In particular, we analyze a nonequilibrium average of the exponentiated work performed by a transverse field. A special symmetry, gauge symmetry, leads to a non-trivial relationship between quantum annealing toward different targets in the theory of spin glasses. We believe that our results will be a step toward an alternative realization of efficient quantum computation as well as our better understanding of nonequilibrium behavior of systems under quantum control.
Quantum annealing is a generic solver of classical optimization problems that makes full use of quantum fluctuations. We consider work statistics given by a repetition of quantum annealing processes by employing the Jarzynski equality proposed in nonequilibrium statistical physics. In particular, we analyze the distribution of the work performed by a transverse field. A special symmetry, gauge symmetry, leads to a non-trivial relationship between quantum annealing toward different targets in the theory of spin glasses. We believe that our results will be a step toward an alternative realization of efficient quantum computation as well as our better understanding of nonequilibrium behavior of systems under quantum control.
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.
We discuss an Ising spin glass where each S=1/2 spin is coupled antiferromagnetically to three other spins (3-regular graphs). Inducing quantum fluctuations by a time-dependent transverse field, we use out-of-equilibrium quantum Monte Carlo simulations to study dynamic scaling at the quantum glass transition. Comparing the dynamic exponent and other critical exponents with those of the classical (temperature-driven) transition, we conclude that quantum annealing is less efficient than classical simulated annealing in bringing the system into the glass phase. Quantum computing based on the quantum annealing paradigm is therefore inferior to classical simulated annealing for this class of problems. We also comment on previous simulations where a parameter is changed with the simulation time, which is very different from the true Hamiltonian dynamics simulated here.
We show a practical application of the Jarzynski equality in quantum computation. Its implementation may open a way to solve combinatorial optimization problems, minimization of a real single-valued function, cost function, with many arguments. We consider to incorporate the Jarzynski equality into quantum annealing, which is one of the generic algorithms to solve the combinatorial optimization problem. The ordinary quantum annealing suffers from nonadiabatic transitions whose rate is characterized by the minimum energy gap Δmin of the quantum system under consideration. The quantum sweep speed is therefore restricted to be extremely slow for the achievement to obtain a solution without relevant errors. However, in our strategy shown in the present study, we find that such a difficulty would not matter.
The correspondence between long-range interacting quantum spin glasses and combinatorial optimization problems underpins the physical motivation for adiabatic quantum computing. On one hand, in disordered (quantum) spin systems, the focus is on exact methods such as the replica trick that allow the calculation of system quantities in the limit of infinite system and ensemble size. On the other hand, when solving a given instance of an optimization problem, disorder-averaged quantities are of no relevance, as one is solely interested in instance-specific, finite-size properties, in particular the optimal solution. Here, we apply the nonequilibrium Green's function formalism to the spin coherent-state path integral to obtain the statistical fluctuations and the collective-excitation spectrum along the annealing path. For the example of the quantum Sherrington-Kirkpatrick spin glass, by comparing to extensive numerically exact results, we show that this method provides access to the instance-specific bottlenecks of the annealing protocol.
Quantum annealing is a new-generation tool of information technology, which helps in solving combinatorial optimization problems with high precision, based on the concepts of quantum statistical physics. Detailed discussion on quantum spin glasses and its application in solving combinatorial optimization problems is required for better understanding of quantum annealing concepts. Fulfilling this requirement, the book highlights recent development in quantum spin glasses including Nishimori line, replica method and quantum annealing methods along with the essential principles. Separate chapters on simulated annealing, quantum dynamics and classical spin models are provided for enhanced learning. Important topics including adiabatic quantum computers and quenching dynamics are discussed in detail. This text will be useful for students of quantum computation, quantum information, statistical physics and computer science.