⚛️ quantum physics

Quantum annealing and condensed matter physics

This topical review bridges quantum annealing and condensed matter physics by outlining how their collaboration can enhance both the understanding of quantum annealers and the advancement of condensed matter research through the use of current hardware capabilities.

Original authors: Viv Kendon, Nicholas Chancellor

Published 2026-04-09

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Viv Kendon, Nicholas Chancellor

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to find the lowest point in a massive, foggy mountain range. This is a problem that computers face all the time: finding the best solution (the "lowest point") among billions of possibilities.

This paper is a friendly invitation from two physicists, Viv Kendon and Nick Chancellor, to the world of Condensed Matter Physics (the study of how materials like metals, magnets, and superconductors behave). They are saying: "Hey, we have built these new machines called Quantum Annealers. You study mountains and materials; we study how to climb them. Let's work together!"

Here is the breakdown of their argument, explained with simple analogies.

1. What is a Quantum Annealer? (The Magic Compass)

Think of a standard computer as a very fast hiker who checks one path at a time. If there are a billion paths, it takes a long time.

A Quantum Annealer is different. Imagine a hiker who is also a ghost. Because they are a "quantum" ghost, they can:

Tunnel: Instead of climbing over a high mountain peak to get to the other side, they can pass through the mountain like a ghost.
Feel the whole landscape: They don't just check one path; they sense the shape of the whole mountain range at once.

The machine works by setting up a "landscape" of energy (like a bumpy floor) where the lowest point represents the answer to a problem. It starts with the landscape flat and easy, then slowly shapes it into the complex problem. The goal is for the system to naturally roll down into the deepest valley (the best solution).

2. The Three Ways to Climb (The Regimes)

The paper explains that this "ghost hiker" can move in three different ways, depending on how fast you change the landscape:

The Slow & Steady Walk (Adiabatic): You change the landscape so slowly that the hiker never gets confused. They stay in the lowest valley the whole time.
- The Catch: If the mountains are huge and complex, this walk takes forever. It's too slow for real-world problems.
The Fast Run (Diabatic): You change the landscape quickly. The hiker gets a little dizzy and jumps around, but sometimes this "chaos" helps them find shortcuts that the slow walker misses. This is where the most exciting new discoveries are happening.
The Warm Bath (Quasistatic): Imagine the hiker is in a warm pool. The water (heat) jiggles them around. Sometimes this jiggling helps them jump over small bumps they couldn't climb otherwise. This is great for "sampling" (finding many good solutions, not just the one best one).

3. Why Physicists Should Care (The Mutual Benefit)

The authors argue that this is a two-way street:

A. Physics helps the Computer:
Condensed matter physicists have spent 50 years studying how atoms behave in magnets and metals. They know how to predict when things get "stuck" or how they react to heat.

The Analogy: The computer builders are trying to drive a car without a map. The physicists have the map! They can tell the builders, "Don't go that way, there's a cliff (a 'gap' in the energy)," or "The heat here will help you jump."

B. The Computer helps Physics:
These machines are essentially giant, programmable magnets.

The Analogy: Instead of building a real, expensive lab experiment to test how a new alloy behaves, scientists can just "program" the alloy into the quantum machine. The machine acts as a simulator. It can solve problems about how materials behave at the atomic level that are too hard for normal supercomputers.

4. The Hurdles (The "Encoding" Problem)

There is a catch. The quantum machine speaks a specific language: it only understands simple connections between neighbors (like a grid of dots).

The Problem: Real-world problems (like scheduling a flight or designing a new drug) are often "all-to-all" connected (every dot connects to every other dot).
The Fix: You have to translate the problem. It's like trying to fit a round peg in a square hole. You have to use "chains" of dots to represent one big idea. The paper discusses clever tricks (like "domain walls") to make this translation efficient so you don't run out of space.

5. The Bottom Line

The paper concludes that we are at a turning point.

Old days: We thought these machines were just for solving math puzzles.
New days: We realize they are powerful tools for simulating nature.

The authors are calling for a collaboration. They want condensed matter physicists to stop looking at these machines as "black boxes" and start treating them as experimental tools. If physicists help understand the physics of how these machines work, the machines will get better. And if the machines get better, they will help physicists discover new materials and understand the universe in ways we can't do with classical computers today.

In short: It's a partnership between the people who built the new engine (Quantum Computing) and the people who know how to drive it through the terrain of nature (Condensed Matter Physics). Together, they can go places neither could go alone.

Based on the provided paper, here is a detailed technical summary of "Quantum annealing and condensed matter physics" by Kendon and Chancellor.

1. Problem Statement

The paper addresses the disconnect between the development of quantum annealing (QA) hardware and the theoretical framework of condensed matter physics (CMP). While QA devices (like D-Wave systems) are increasingly capable, their operation is often viewed through the lens of computer science (optimization complexity) rather than physics.

The Gap: Traditional computer science approaches focus on worst-case complexity (NP-hardness), which may not reflect the behavior of "typical" instances found in real-world physics problems. Conversely, condensed matter physics offers tools to understand typical behaviors, thermal fluctuations, and non-equilibrium dynamics, which are crucial for understanding how QA hardware actually functions.
The Challenge: Current QA hardware operates in regimes (diabatic, quasistatic, adiabatic) that are not fully understood theoretically. Furthermore, mapping complex computational problems onto the limited connectivity of physical hardware graphs remains a significant bottleneck. The authors argue that a closer collaboration between CMP and QA researchers is necessary to improve hardware performance and utilize QA for simulating condensed matter systems.

2. Methodology

The paper is a topical review that synthesizes theoretical models, hardware capabilities, and encoding strategies. It does not present new experimental data but rather organizes existing knowledge to bridge the two fields.

Theoretical Framework: The authors analyze three closely related models of quantum computing:
1. Adiabatic Quantum Computing (AQC): Slow evolution from a simple ground state to a problem Hamiltonian.
2. Computation by Quantum Walk: Evolution on a graph defined by an adjacency matrix.
3. Quantum Annealing (QA): A driven dissipative system where the Hamiltonian evolves over time, interacting with a thermal environment.
Regime Analysis: The paper categorizes QA operation into distinct regimes based on the relationship between the annealing rate ( $\partial\Gamma/\partial t$ $\partial Γ/ \partial t$ ), the minimum energy gap ( $\Delta$ $Δ$ ), and the coupling to a thermal bath ( $\gamma$ $γ$ ):
- Adiabatic: Slow evolution, system stays in the ground state.
- Quasistatic: Thermal equilibration dominates; useful for sampling.
- Diabatic: Fast evolution; unitary dynamics dominate, but energy is removed via non-adiabatic transitions.
Encoding Analysis: The authors examine how classical problems are mapped to Ising Hamiltonians, comparing binary vs. unary encodings and discussing hardware connectivity constraints (minor-embedding).

3. Key Contributions

The paper makes several significant contributions to the field:

Regime Classification: It provides a rigorous mathematical definition of the different operating regimes of QA (Table 1), clarifying when thermal effects dominate versus when quantum coherence or diabatic effects are primary. It highlights that current hardware often operates in the diabatic or quasistatic regimes, not the ideal adiabatic regime.
Condensed Matter Perspective on Optimization: It argues that CMP tools (like spin glass theory) are better suited for benchmarking QA than worst-case complexity theory. For instance, it explains why certain random Ising models are easy for classical Monte Carlo (no spin-glass transition at finite temperature) and how this affects benchmarking validity.
Quantum Monte Carlo (QMC) Limitations: The paper details the "topological obstructions" where classical QMC fails to emulate physical QA. Specifically, it discusses the "shamrock" Hamiltonian (Andriyash & Amin, 2017), where physical annealing exhibits exponentially faster tunneling than QMC due to interference between multiple tunneling paths—a purely quantum effect QMC cannot capture.
Encoding Strategies: It advocates for unary encodings (specifically domain-wall and one-hot) over binary encodings for certain problems. Domain-wall encoding is highlighted as superior for D-Wave systems because it allows arbitrary interactions to be represented as quadratic terms and reduces the overhead of chain-breaking in minor-embedding.
Application Roadmap: It outlines a shift in focus from pure optimization to quantum simulation and sampling. It suggests that QA is currently more useful for finding low-energy states and sampling thermal distributions (equilibrium and non-equilibrium) than for finding exact global optima.

4. Results and Findings

Hardware Capabilities: Current flux-qubit devices (e.g., D-Wave) can access both diabatic and quasistatic regimes. Neutral atom systems, however, are dominated by atom loss rather than thermalization, limiting their access to the quasistatic regime.
Scaling and Connectivity: Mapping fully connected problems to 2D/3D hardware graphs incurs a polynomial overhead (scaling as $N^2$ for 2D). The authors suggest that the "largest mappable fully-connected problem" is a better metric for hardware performance than raw qubit count.
Performance in Sampling: QA devices have demonstrated success in thermal sampling (finding low-energy states) and simulating equilibrium condensed matter systems (e.g., spin glasses, ice-like systems, fractional magnetization).
Diabatic Advantage: Recent experiments suggest that diabatic annealing (fast sweeps) can solve problems that are intractable for classical tensor network simulations, implying a "quantum utility" even without full error correction.
Hybrid Algorithms: The paper highlights successful hybrid workflows where QA is used as a thermal sampler to generate low-energy configurations, which are then refined using classical Density Functional Theory (DFT). This approach has successfully predicted material properties (e.g., bandgap bowing in alloys) with high accuracy.

5. Significance

For Condensed Matter Physicists: The paper serves as a guide to understanding how QA hardware works, demystifying the "black box" of quantum annealers. It encourages physicists to use these devices not just for optimization, but as analog simulators for studying non-equilibrium dynamics, phase transitions, and complex many-body systems.
For Quantum Computing Researchers: It emphasizes that the path to "quantum advantage" may lie in approximate optimization and sampling rather than exact solutions to NP-hard problems. It suggests that understanding the diabatic regime and open-system dynamics is critical for improving hardware.
Future Directions: The paper calls for new theoretical frameworks to explain far-from-equilibrium dynamics in quantum systems. It identifies the diabatic regime as the most promising area for near-term quantum advantage and suggests that domain-wall encoding and hybrid quantum-classical algorithms are the most viable paths forward for practical applications in materials science and physics.

In summary, the paper posits that the future of quantum annealing lies in a symbiotic relationship with condensed matter physics: using CMP theory to understand and improve the annealer, and using the annealer to simulate complex physical systems that are beyond the reach of classical computers.