Quantum annealing of the random transverse-field Ising model in one, two, and three dimensions

arXiv:2610.11411 · cond-mat.stat-mech, cond-mat.dis-nn, quant-ph · Submitted 2026-10-08 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: I'm Kai, and with me are Mira and Lev, guest researcher.

Mira: Today's paper: "Quantum annealing of the random transverse-field Ising model in one, two, and three dimensions".

Kai: The gist Quantum annealing must be sufficiently slow to prevent defect formation,

Mira: First, who's behind it and why it matters.

Paper summary: Kai: So, we're wrapping up this look at the paper, "Quantum annealing of the random transverse-field Ising model in one, two, and three dimensions."

Mira: It really boils down to how slow you have to anneal quantum systems if you want them to stay correct.

Lev: Right. The main point is setting a limit on that speed so you don't get those nasty defects forming during the process.

Kai: So, what does that mean for the actual hardware we build? What are these authors suggesting is actually achievable in practice?

Mira: They’re talking about this scaling relationship between the annealing time and the size of your system, which they call tauL.

Lev: It means you can't just pick any slow enough time; it has to grow with the system you're trying to study, scaling with L.

Kai: So if I build a bigger chip, I need a proportionally longer annealing time? That sounds like a pretty big constraint for experimentalists.

Mira: Exactly. They’re showing that this isn't just some arbitrary number; it comes from the underlying physics of how clusters merge during the annealing process.

Lev: The SDRG method they use lets them see those merges, which is key because it connects the microscopic events to that macroscopic scaling law.

Kai: It’s interesting how they manage to generalize this idea across one, two, and three dimensions using this renormalization group approach.

Mira: They argue that even though the specific disorder changes depending on the dimension, the universal fixed points suggest these scaling rules hold up generally.

Lev: But we have to be careful; those results rely on the assumption that the system flows to an infinite-disorder fixed point, which isn't guaranteed for every setup.

Kai: So, even with these strong theoretical results, there's still a lot of work left on how this plays out when you try to actually cool something up in a lab.

Mira: That’s where the next piece comes in—we need to see if we can actually implement these scaling predictions onto real quantum hardware.

Conclusion: Kai: So we're wrapping up this talk on "Quantum annealing of the random transverse-field Ising model in one, two, and three dimensions."

Mira: Basically they’ve mapped out exactly how slow your quantum computer needs to be to avoid errors when you’re using this specific type of annealing.

Lev: It’s about finding that bottleneck time, the minimum amount of time you need before defects become too common.

Kai: The authors use a technique called SDRG, which lets them look at how small clusters merge during the process and figure out what causes those errors.

Mira: They show that this merging happens in a way that follows universal scaling laws, no matter whether you’re looking at one or three dimensions.

Lev: What this means for us is that if you want reliable quantum computation, you need to design your annealing protocol around these system-size dependent time requirements.

Kai: It shifts the focus from just picking any slow enough ramp to understanding the actual dynamics of cluster aggregation during annealing.

Mira: And they suggest that these scaling behaviors are robust because they connect to fixed points that don't depend on the specific disorder you start with.

Lev: So, for anyone building a quantum annealer, this gives a concrete rule about how long to wait before you have to worry about your results becoming garbage.

Kai: It’s a big step in telling us what practical constraints we need to respect when designing these kinds of systems for real use.

Mira: And now we can look at how these scaling laws fit into the more complex landscape of actual error correction protocols.

Department of Physics and Astronomy, Northwestern University · Department of Engineering Sciences and Applied Mathematics, Northwestern University · Northwestern Institute on Complex Systems, Northwestern University · HUN-REN Wigner Research Centre for Physics

cond-mat.stat-mech, cond-mat.dis-nn, quant-ph

Submitted: 2026-10-08

Updated: 2026-10-08

Comments: 17 pages, 10 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 83/100

The gist: The gist Quantum annealing must be sufficiently slow to prevent defect formation, and this paper studies this problem in the random transverse-field Ising model via the adiabatic theorem to obtain

Key concepts

Quantum Annealing
This process uses quantum mechanics to find the lowest energy state of a complex problem, like finding the best configuration for a system. In this paper, it is used to explore how slow annealing can avoid errors when changing the system's parameters over time.
Adiabatic Theorem
This theorem provides a condition for avoiding defects during the annealing process. Essentially, it states that if the system changes slowly enough compared to its energy gaps, it will remain in its instantaneous ground state without getting stuck in excited states or forming errors.
Strong-Disorder Renormalization Group (SDRG)
This is a mathematical technique used to analyze the annealing process. It views the slow change as a gradual merging of strongly coupled clusters of spins. This method helps identify the elementary events where errors or defects are likely to form.
Infinite-Disorder Fixed Point (IDFP)
This refers to a universal state that the random transverse-field Ising model flows toward in any finite dimension when disorder is strong enough. The critical exponents associated with this fixed point are universal, meaning they don't depend on the specific details of the disorder.

Terminology

Summary

The gist Quantum annealing must be sufficiently slow to prevent defect formation, and this paper studies this problem in the random transverse-field Ising model via the adiabatic theorem to obtain the limiting rate at which defect formation can be avoided<ref:2610.11411#pg2>.

How it works

The study employs a scaling theory of the statistics of elementary events of error formation in general dimensions, comparing it to extensive numerical analysis carried out in one, two, and three dimensions using the strong-disorder renormalization group (SDRG) technique<ref:2610.11411#pg2>. The SDRG approach views the annealing process as a gradual aggregation of strongly coupled clusters, which allows access to the elementary events of error formation<ref:2610.11411#pg3>. Each fusion event can be assigned a crossover annealing time separating the adiabatic and non-adiabatic regimes, where the largest of these crossover times sets the annealing time required to suppress defect formation<ref:2610.11411#pg3>.

Model and Adiabatic Theorem

The work considers the random transverse-field Ising model (RTFIM) on d-dimensional cubic lattices with a time-dependent Hamiltonian H(t) that drives the system from a paramagnetic phase to a ferromagnetic phase<ref:2610.11411#pg2>. The adiabatic theorem provides the condition for avoiding defects, which is defined by τ ≫ max 0≤s≤1 Q(s), where Q(s) is related to the matrix element divided by the squared gap<ref:2610.11411#pg4>. The critical annealing time τc is defined as τc ≡ max 0≤s≤1 Q(s)<ref:2610.11411#pg4>.

Results in One Dimension

In one dimension, the SDRG approach classifies spins into clusters, and during annealing, these clusters undergo a gradual aggregation by pairwise fusions<ref:2610.11411#pg3>. The crossover annealing time can be written as τc ∼ n1 + nb / ϵ(t∗), where n1 and nb denote the number of original fields involved in h˜1 and J˜, respectively<ref:2610.11411#pg4>. The conditional probability distribution of the logarithmic energy scale Γ for fusions occurring at a given value of the control parameter ∆ ≪ 1 has an exponential cutoff at small energy (large Γ) as G>(Γ∆) ∼ ∆e−2∆Γ<ref:2610.11411#pg4>. Integrating over the entire control parameter range yields that the fraction of erroneous (non-adiabatic) fusions scales, for large annealing times, as n(τ) ∼ ln τ /τ0 ln2(τ /τ0) −2<ref:2610.11411#pg4>.

Generalization to Higher Dimensions

The framework is generalized to higher dimensions based on the assumption that the RTFIM flows to an infinite-disorder fixed point (IDFP) in any finite dimension provided the initial disorder is strong enough<ref:2610.11411#pg5>. The minimal annealing time required for a finite system of size L, τL, scales with the linear size L as τL ∼ Lωe cLψ in all studied dimensions<ref:2610.11411#pg6>. The exponent ω is conjectured to be related to the usual critical exponents by ω = ψ + 1/ν<ref:2610.11411#pg5>.

Characteristics of Fusions

The analysis examines several characteristics of fusion events, including the excitation energy ϵ of the dominant fusion, which scales according to Eq. (10)<ref:2610.11411#pg6>. The effective multiplicity τLϵ of the dominant fusion follows algebraic scaling anticipated in Eq. (11), with exponents ω = 1 in d = 1, ω = 1.20(5) in d = 2, and ω = 1.25(5) in d = 3<ref:2610.11411#pg7>. The sample-to-sample distribution of the threshold annealing time τL is compatible with the activated finite-size scaling of τL in Eq. (15)<ref:2610.11411#pg7>.

Error Density Scaling

The density of errors produced in an infinite system under a finite annealing time is measured by the fraction n(τ) of erroneous (non-adiabatic) fusion events to all fusion events, which scales as n(τ) ∼ ln τ / (ln τ) ω ψ − d ψ for large τ<ref:2610.11411#pg7>.

Conclusion

The bottleneck annealing time needed to avoid defects in a finite sample scales with the linear size L as τL ∼ Lωe cLψ in all studied dimensions, and this relationship corresponds to an ultra-slow decrease of the defect density with the annealing time, as n(τ) ∼ (ln τ) − d/ψ for large τ<ref:2610.11411#pg7>. The numerical analysis presented in this work has been performed for a particular form of disorder and annealing protocol, and it is expected that the asymptotic results are universally valid for protocols having a linear time-dependence at the critical point<ref:2610.11411#pg11>.

How it works

The SDRG method was validated for the one-dimensional model by a comparison with results of exact diagonalization based on the free-fermion technique<ref:2610.11411#pg7>. The distributions of scaling combinations xϵ = − ln(ϵ/ϵ0)/Lψ, xn = ln(τLϵ/Lω), and xτ = ln[τL/(τ0Lω)]/Lψ must display data collapse using ψ = 1/2, ω = 1, and appropriately chosen constants ϵ0 and τ0<ref:2610.11411#pg7>. The SDRG method successfully identifies all universal aspects of the scaling behavior<ref:2610.11411#pg7>. The bottleneck annealing time needed to avoid defects in a finite sample scales with the linear size L as τL ∼ Lωe cLψ in all studied dimensions<ref:2610.11411#pg11>. This relationship corresponds to an ultra-slow decrease of the defect density with the annealing time, as n(τ) ∼ (ln τ) − d/ψ in leading order for large τ<ref:2610.11411#pg7>. The numerical analysis presented in this work has been performed for a particular form of disorder and annealing protocol<ref:2610.11411#pg11>. Nevertheless, it is well-known that the critical exponents of an IDFP are universal in the sense that they are independent from the particular form of disorder<ref:2610.11411#pg7>. Consequently, our asymptotic results valid in the limit of long annealing times or large system sizes are expected to be independent from the type of disorder<ref:2610.11411#pg11>. The region where error formation is considerable shrinks to the critical point with increasing annealing time<ref:2610.11411#pg7>. As a consequence, our asymptotic results are expected to be universally valid for protocols having a linear time-dependence at the critical point<ref:2610.11411#pg11>.

How it works

The analysis of all fusion events shows that the marginal distributions of the logarithmic excitation energies Γ = − ln ϵ of all fusions are shown in Fig. 5, and the tail must be algebraic, ρ(Γ) ∼ Γ − κ with κ = 1 + d/ψ in all three dimensions<ref:2610.11411#pg7>. The probability density of the logarithmic crossover times ln τc over all fusion events is expected to have the form ρ(x) ∼ x − (1+d/ψ), where x = ln τc<ref:2610.11411#pg7>. The scaling of the error density with annealing time follows ln τ ∼ [n(τ)]−ψ/d, valid in the large τ limit<ref:2610.11411#pg7>. The predicted asymptotic dependence is indicated by the dashed lines having slopes −ψ/d in Fig. 10<ref:2610.11411#pg7>.

How it works

The numerical analysis presented in this work has been performed for a particular form of disorder and annealing protocol, and it is expected that the bottleneck annealing time needed to avoid defects in a finite sample scales with the linear size L as τL ∼ Lωe cLψ in all studied dimensions<ref:2610.11411#pg7>. This relationship corresponds to an ultra-slow decrease of the defect density with the annealing time, as n(τ) ∼ (ln τ) − d/ψ in leading order for large τ<ref:2610.11411#pg7>. The numerical analysis presented in this work has been performed for a particular form of disorder and annealing protocol<ref:2610.11411#pg11>. Nevertheless, it is well-known that the critical exponents of an IDFP are universal in the sense that they are independent from the particular form of disorder<ref:2610.11411#pg7>. Consequently, our asymptotic results valid in the limit of long annealing times or large system sizes are expected to be independent from the type of disorder<ref:2610.11411#pg11>. The region where error formation is considerable shrinks to the critical point with increasing annealing time<ref:2610.11411#pg7>. As a consequence, our asymptotic results are expected to be universally valid for protocols having a linear time-dependence at the critical point<ref:2610.11411#pg11>.

How it works

The SDRG method was validated for the one-dimensional model by a comparison with results of exact diagonalization based on the free-fermion technique<ref:2610.11411#pg7>. The distributions of scaling combinations xϵ = − ln(ϵ/ϵ0)/Lψ, xn = ln(τLϵ/Lω), and xτ = ln[τL/(τ0Lω)]/Lψ must display data collapse using ψ = 1/2, ω = 1, and appropriately chosen constants ϵ0 and τ0<ref:2610.11411#pg7>. The SDRG method successfully identifies all universal aspects of the scaling behavior<ref:2610.11411#pg7>.

Improvements for AI systems

  1. textbfConcentration of Critical Exponents in Model Design + Capability to Predict Defect Suppression Thresholds + The improved system can predict, for a given dimension and disorder realization, the limiting rate at which defect formation can be avoided by calculating the crossover annealing time τc, defined as the maximum of the adiabatic condition Q(s) over the annealing time interval.

  2. textbfAdaptive Annealing Path Optimization + Capability to Design Optimal Annealing Protocols + The system can provide a map of individual events of potential defect formation in the excitation energy - control parameter plane to help in the design of optimal annealing paths.

  3. textbf Multi-scale Error Event Characterization + Capability to Quantify Defect Statistics across Time Scales + The AI can determine the scaling theory of the statistics of these events in general dimensions and calculate quantities like the fraction of erroneous (non-adiabatic) fusions scales, for large annealing times, as n(τ) ∼ ln τ /τ0 ln2 (τ /τ0) −2.

Sources

Related papers