Quantum annealing and condensed matter physics
Pith reviewed 2026-05-16 05:06 UTC · model grok-4.3
The pith
Quantum annealing hardware can now be used to solve problems in condensed matter physics.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Current quantum annealing devices have reached sufficient scale, connectivity, and control to address condensed matter models beyond toy cases, enabling mutual progress where annealing solves physics problems and condensed matter insights refine how annealers operate.
What carries the argument
Quantum annealing, the controlled evolution of a quantum spin system from an easy initial Hamiltonian to a problem Hamiltonian whose ground state encodes the solution, applied by mapping condensed matter Hamiltonians onto programmable spin interactions.
If this is right
- Condensed matter Hamiltonians can be directly encoded as annealing problems and run on hardware to obtain ground states or thermal samples.
- Annealing dynamics provide a new experimental window into quantum phase transitions and glassy behavior in spin systems.
- Insights from condensed matter theory can be used to design better annealing schedules and mitigate errors in existing devices.
- Collaborations can accelerate the study of open problems in quantum magnetism that are intractable for classical simulation.
Where Pith is reading between the lines
- Known exact results from condensed matter models could serve as benchmarks to quantify the accuracy of current annealers beyond optimization performance alone.
- If annealing hardware improves connectivity further, it could enable direct simulation of higher-dimensional or long-range interaction models that remain difficult today.
Load-bearing premise
Existing quantum annealing devices have reached enough scale, connectivity, and control to address condensed matter models beyond simple toy cases.
What would settle it
A concrete demonstration that a standard condensed matter model such as the two-dimensional Ising spin glass or a frustrated Heisenberg chain cannot be solved or simulated accurately on present-day annealers due to noise, limited qubit count, or connectivity would falsify the claim that hardware is now ready.
read the original 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.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript is a topical review introducing quantum annealing to condensed matter physicists. It argues that current quantum annealing hardware now possesses capabilities sufficient to address condensed matter physics problems (beyond pure optimization), and it outlines mutual benefits from closer collaboration between the communities to improve device understanding and to advance simulations of quantum spin systems.
Significance. If the hardware-capability claim holds, the review could usefully lower the barrier for condensed matter researchers to experiment with annealers on models such as Ising or Heisenberg lattices, potentially yielding new observables where classical methods scale poorly. The review structure itself supplies no new derivations or data, so its value rests on accurate synthesis of prior literature and on explicit discussion of embedding overhead, effective temperature, and control precision.
major comments (2)
- [§3] §3 (Hardware capabilities): the assertion that 'current hardware now has capabilities that can be used to solve condensed matter physics problems' is load-bearing for the central claim yet is supported only by qualitative statements; no quantitative assessment of minor-embedding chain lengths or effective temperature for 2D lattices larger than ~100 spins is provided, leaving the skeptic's concern about prohibitive overhead unaddressed.
- [§4.2] §4.2 (Embedding and mapping): the discussion of Pegasus and Chimera graphs does not include a scaling plot or table showing chain-length growth versus lattice size for representative CM Hamiltonians (e.g., 2D Ising with next-nearest-neighbor terms); without this, it is impossible to judge whether the hardware can reach regimes where classical methods fail.
minor comments (2)
- [Figure 2] Figure 2 caption: the legend for the 'effective temperature' curve is missing units and a reference to the calibration method used.
- Throughout: several citations to D-Wave technical reports are given only by URL; replace with stable arXiv or journal references where available.
Simulated Author's Rebuttal
We thank the referee for their detailed and constructive comments on our topical review. We appreciate the emphasis on strengthening the quantitative aspects to better support the central claims. We address each major comment below.
read point-by-point responses
-
Referee: [§3] §3 (Hardware capabilities): the assertion that 'current hardware now has capabilities that can be used to solve condensed matter physics problems' is load-bearing for the central claim yet is supported only by qualitative statements; no quantitative assessment of minor-embedding chain lengths or effective temperature for 2D lattices larger than ~100 spins is provided, leaving the skeptic's concern about prohibitive overhead unaddressed.
Authors: We agree that the manuscript would benefit from more quantitative support for the hardware capabilities claim. In the revised version, we will expand the discussion in §3 by incorporating specific quantitative results from the literature on minor-embedding chain lengths and effective temperatures for 2D spin lattices. For example, we will reference studies demonstrating successful embeddings for systems exceeding 100 spins and discuss the associated overheads, thereby addressing concerns about prohibitive scaling. revision: yes
-
Referee: [§4.2] §4.2 (Embedding and mapping): the discussion of Pegasus and Chimera graphs does not include a scaling plot or table showing chain-length growth versus lattice size for representative CM Hamiltonians (e.g., 2D Ising with next-nearest-neighbor terms); without this, it is impossible to judge whether the hardware can reach regimes where classical methods fail.
Authors: We acknowledge the value of including a scaling table or plot for clarity. Since this is a review paper, we will add a table in §4.2 that compiles scaling data from existing publications on chain-length growth for 2D Ising models (including next-nearest-neighbor interactions) on both Chimera and Pegasus graphs. This will provide readers with a clear view of the regimes accessible on current hardware. revision: yes
Circularity Check
Review paper presents overview of existing literature with no internal derivations or predictions
full rationale
The manuscript is explicitly a topical review that surveys quantum annealing applications to condensed matter physics by referencing prior work. No new equations, fitted parameters, predictions, or uniqueness theorems are derived within the paper itself. The claim that current hardware can address condensed matter problems is presented as a summary of demonstrated capabilities from cited studies rather than a self-contained derivation that reduces to its own inputs. No self-citation chains, ansatzes, or renamings function as load-bearing steps here.
Axiom & Free-Parameter Ledger
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Quantum annealing leverages... transverse Ising Hamiltonian... A(t) Ĥ0 + B(t) Ĥp... regimes defined by annealing rate vs gap vs bath coupling (table 1)
-
IndisputableMonolith/Foundation/AlexanderDuality.leanalexander_duality_circle_linking unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Hardware graph connectivity... minor-embedding... domain-wall encodings
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.