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:2602.09149 · Journal of Physics Condensed Matter

Quantum annealing and condensed matter physics

Viv Kendon, Nicholas Chancellor

quant-phcond-mat.dis-nnSubmitted Feb 9, 2026• Announced Feb 11, 2026• 1 citation
arXivHTMLPDF

Abstract

Quantum annealing leverages the properties of interacting quantum spin systems to solve computational problems, typically optimisation problems. Current hardware now has capabilities that can be used to solve condensed matter physics problems, too. In this topical review, we provide an overview of quantum annealing aimed at condensed matter physicists, to show the mutual benefits of working together to understand and improve how quantum annealers work, and to use them to advance condensed matter physics.

Journal reference
J. Phys.: Condens. Matter 38 143005 (2026)
DOI
10.1088/1361-648X/ae5906
Comments
16 pages + 11 pages of references, 2 figures, 3 tables, journal submitted version

Related papers

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

Overview of Condensed Matter Physics

S. M. Girvin, Kun Yang

Modern Condensed Matter Physics brings together the most important advances in the field of recent decades. It provides instructors teaching graduate-level condensed matter courses with a comprehensive and in-depth textbook that will prepare graduate students for research or further study as well as reading more advanced and specialized books and research literature in the field. This textbook covers the basics of crystalline solids as well as analogous optical lattices and photonic crystals, while discussing cutting-edge topics such as disordered systems, mesoscopic systems, many-body systems, quantum magnetism, Bose–Einstein condensates, quantum entanglement, and superconducting quantum bits. Students are provided with the appropriate mathematical background to understand the topological concepts that have been permeating the field, together with numerous physical examples ranging from the fractional quantum Hall effect to topological insulators, the toric code, and majorana fermions. Exercises, commentary boxes, and appendices afford guidance and feedback for beginners and experts alike.

Cambridge University Press eBooks•Feb 28, 2019•0 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

Advancing Computational Efficiency with Quantum Annealing in Complex Optimization Across Scientific Domains

Raju Shanmugam, M Babu, S Tamilselvan +2 more

The quantum annealing technique is such a paradigm that is next generation that can be used in solving optimization problem across different scientific domains like finance and material science and is capable of breaking through past obstacles to generate solutions for problems waiting to be solved. The purpose of this paper is the detailed depiction of the application of the quantum annealing in the optimization that includes the principles, applications, methodologies and outcomes and future trends all of them. Through a multidisciplinary approach, we examine the use of quantum annealing, as the method that exploits the specific features of the quantum annealing through the quantum mechanics, to explore the multitude of solution spaces faster and better than the classical methods, leading to the superior solution quality and the faster computing times. Next, we give examples for its implementation in Portfolio optimization, Machine learning, chemical optimization, Traffic management and so on depicting its role in delivering tangible benefits such as higher financial returns, precision improvement, and time savings contrast to the classical methods. Therefore, we also emphasize the current impediments, such as the scaling down the size and the ethical aspect, through which we give the way forward for the subsequent scientific researches and studies. In this abstract, we aim to depict the helix-like nature of quantum annealing in the revolution of optimization, bringing in innovations, and thus, shaping the future in which it is the quantum computing technologies that hold the central stage in addressing the complex interconnecting real-world issues.

•Jul 24, 2024•0 citations

Quantum speedup for solving the one-dimensional Hubbard model using quantum annealing

Kunal Vyas, Fengping Jin, Hans A. De Raedt +1 more

The Hubbard model has occupied the minds of condensed matter physicists for most part of the last century. This model provides insight into a range of phenomena in correlated electron systems. We wish to examine the paradigm of quantum algorithms for solving such many-body problems. The focus of our current work is on the one-dimensional model that is integrable, meaning that there exist analytical results for determining its ground state. In particular, we demonstrate how to perform a gate-based quantum computer simulation of quantum annealing for the Hubbard Hamiltonian. We perform simulations for systems with up to 40 qubits to study the scaling of required annealing time for obtaining the ground state. We find that for the half-filled cases considered, there is a polynomial quantum speedup over algorithms based on the Bethe-ansatz equations.

arXiv:2510.02141•Physical Review Research•Apr 7, 2026•1 citation
Quantum annealing leverages the properties of interacting quantum spin systems to solve computational problems, typically optimisation problems. Current hardware now has capabilities that can be used to solve condensed matter physics problems, too. In this topical review, we provide an overview of quantum annealing aimed at condensed matter physicists, to show the mutual benefits of working together to understand and improve how quantum annealers work, and to use them to advance condensed matter physics.
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 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.
Modern Condensed Matter Physics brings together the most important advances in the field of recent decades. It provides instructors teaching graduate-level condensed matter courses with a comprehensive and in-depth textbook that will prepare graduate students for research or further study as well as reading more advanced and specialized books and research literature in the field. This textbook covers the basics of crystalline solids as well as analogous optical lattices and photonic crystals, while discussing cutting-edge topics such as disordered systems, mesoscopic systems, many-body systems, quantum magnetism, Bose–Einstein condensates, quantum entanglement, and superconducting quantum bits. Students are provided with the appropriate mathematical background to understand the topological concepts that have been permeating the field, together with numerous physical examples ranging from the fractional quantum Hall effect to topological insulators, the toric code, and majorana fermions. Exercises, commentary boxes, and appendices afford guidance and feedback for beginners and experts alike.
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.
The quantum annealing technique is such a paradigm that is next generation that can be used in solving optimization problem across different scientific domains like finance and material science and is capable of breaking through past obstacles to generate solutions for problems waiting to be solved. The purpose of this paper is the detailed depiction of the application of the quantum annealing in the optimization that includes the principles, applications, methodologies and outcomes and future trends all of them. Through a multidisciplinary approach, we examine the use of quantum annealing, as the method that exploits the specific features of the quantum annealing through the quantum mechanics, to explore the multitude of solution spaces faster and better than the classical methods, leading to the superior solution quality and the faster computing times. Next, we give examples for its implementation in Portfolio optimization, Machine learning, chemical optimization, Traffic management and so on depicting its role in delivering tangible benefits such as higher financial returns, precision improvement, and time savings contrast to the classical methods. Therefore, we also emphasize the current impediments, such as the scaling down the size and the ethical aspect, through which we give the way forward for the subsequent scientific researches and studies. In this abstract, we aim to depict the helix-like nature of quantum annealing in the revolution of optimization, bringing in innovations, and thus, shaping the future in which it is the quantum computing technologies that hold the central stage in addressing the complex interconnecting real-world issues.
The Hubbard model has occupied the minds of condensed matter physicists for most part of the last century. This model provides insight into a range of phenomena in correlated electron systems. We wish to examine the paradigm of quantum algorithms for solving such many-body problems. The focus of our current work is on the one-dimensional model that is integrable, meaning that there exist analytical results for determining its ground state. In particular, we demonstrate how to perform a gate-based quantum computer simulation of quantum annealing for the Hubbard Hamiltonian. We perform simulations for systems with up to 40 qubits to study the scaling of required annealing time for obtaining the ground state. We find that for the half-filled cases considered, there is a polynomial quantum speedup over algorithms based on the Bethe-ansatz equations.