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:0801.2193 · Reviews of Modern Physics

Colloquium : Quantum annealing and analog quantum computation

Arnab Das, Bikas K. Chakrabarti

Published Sep 5, 2008• 717 citations
arXivHTMLPDF

Abstract

The recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations is reviewed here. The concept is introduced in successive steps through studying the mapping of such computationally hard problems to classical spin-glass problems, quantum spin-glass problems arising with the introduction of quantum fluctuations, and the annealing behavior of the systems as these fluctuations are reduced slowly to zero. This provides a general framework for realizing analog quantum computation.

DOI
10.1103/revmodphys.80.1061

Related papers

Quantum Annealing, Spin Glasses, Optimization and Analog Quantum Computation

Arnab Das, Bikas K. Chakrabarti

We review here the recent success in annealing or optimizing the cost functions of complex systems utilizing quantum fluctuations rather than the classical (thermal) fluctuations. These are introduced through studies of mapping of such computationally hard problems to classical spin glass problems, quantum spin glasses and consequent annealing or analog quantum computation.

Statistical science and interdisciplinary research•Nov 1, 2009•0 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 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

Optimization Via Open System Quantum Annealing

Sergio Boixo, Robert F. Lucas, Daniel A. Lidar +2 more

Abstract : Many computationally challenging problems can be reduced to Quadratic Unconstrained Binary Optimization (QUBO), which can be solved by a quantum evolution from a strong transverse field to a spin glass Hamiltonian (also known as quantum annealing or QA). We have examined open system QA, using theoretical and experimental techniques to deepen our understanding of open system QA by situating it in the context of related, well studied classical and quantum problems. We have explored and elucidated the significance of tunneling in QA with Path Integral Monte Carlo. We have also provided signatures of quantum behavior of QA against closely related simulated annealing implementations, analytically, numerically, and experimentally. We have carried out a comprehensive comparison of geometrically-local open-system QA and classical solvers for computationally hard problems such as MAX-2-SAT. We have exploited and further developed a graph-theoretical mapping between the Ising spin glass partition function and circuit model decision problems, discovered in a previous ARO Quantum Algorithms funded project. We have made significant progress on error correction techniques for QA, both theoretically and experimentally, and in demonstration of quantum speedup.

•Jan 7, 2016•0 citations

Quantum Optimization of Fully Connected Spin Glasses

Davide Venturelli, Salvatore Mandrà, Sergey Knysh +3 more

Quantum computing promises to be more efficient and significantly faster than today's classical computing. Researchers compare the performance of a quantum annealer with that of classical algorithms for the first time on hard spin-glass problems.

arXiv:1406.7553•Physical Review X•Sep 18, 2015•227 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
The recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations is reviewed here. The concept is introduced in successive steps through studying the mapping of such computationally hard problems to classical spin-glass problems, quantum spin-glass problems arising with the introduction of quantum fluctuations, and the annealing behavior of the systems as these fluctuations are reduced slowly to zero. This provides a general framework for realizing analog quantum computation.
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.
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.
Abstract : Many computationally challenging problems can be reduced to Quadratic Unconstrained Binary Optimization (QUBO), which can be solved by a quantum evolution from a strong transverse field to a spin glass Hamiltonian (also known as quantum annealing or QA). We have examined open system QA, using theoretical and experimental techniques to deepen our understanding of open system QA by situating it in the context of related, well studied classical and quantum problems. We have explored and elucidated the significance of tunneling in QA with Path Integral Monte Carlo. We have also provided signatures of quantum behavior of QA against closely related simulated annealing implementations, analytically, numerically, and experimentally. We have carried out a comprehensive comparison of geometrically-local open-system QA and classical solvers for computationally hard problems such as MAX-2-SAT. We have exploited and further developed a graph-theoretical mapping between the Ising spin glass partition function and circuit model decision problems, discovered in a previous ARO Quantum Algorithms funded project. We have made significant progress on error correction techniques for QA, both theoretically and experimentally, and in demonstration of quantum speedup.
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.