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

Haah's 3D cubic code thermalizes rapidly

Sebastian Stengele, Libor Caha, Ángela Capel, Simone Warzel

quant-phmath-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 3 citations
arXivHTMLPDF

Abstract

Haah's 3D cubic code was introduced as a candidate for a self-correcting quantum memory in three dimensions, using the absence of string logical operators to obstruct thermal errors. It has been a long-standing open question whether it is a self-correcting quantum memory. Even though the memory time was explored numerically, no analytical upper bound was known. Here, we settle this question rigorously and show that the cubic code thermalizes rapidly at every positive temperature. Our proof relies on the framework of [Commun. Math. Phys. 407, 195 (2026)] to turn a decay-of-correlations condition into a modified logarithmic Sobolev inequality for the Davies generator. To the best of our knowledge, this is the first analytic proof of rapid mixing for all positive temperatures for any fracton code.

AI Summary

Haah’s cubic code has a logarithmic logical energy barrier and exhibits partial self-correction over a temperature-dependent range of sizes, but these facts do not determine its asymptotic thermal memory lifetime. This paper establishes an all-positive-temperature thermalization bound for the code under local Davies dynamics. For a periodic cubic lattice of linear size $L$ with $n=2L^3$ qubits, single-qubit $X$ and $Z$ bath couplings, and detailed-balance rates uniformly bounded away from zero at fixed inverse temperature $\beta<\infty$, the Davies generator satisfies a modified logarithmic Sobolev inequality with a size-independent constant. Consequently, the worst-case trace-distance mixing time obeys $t_{\mathrm{mix}}(\varepsilon)\leq C_\beta(\log L+\log\varepsilon^{-1})$. Contractivity under recovery gives an $O_\beta(\log L)$ upper bound on passive-memory time, irrespective of the final decoder, excluding asymptotic polynomial lifetime growth at fixed positive temperature. The proof applies an existing framework converting a Dobrushin–Shlosman boundary-correlation condition into entropy tensorization and then a uniform Sobolev bound. The new geometric estimates control kernels of restricted check maps: their dimensions scale at most linearly with box side lengths, while configurations reaching distance $\ell$ have weight at least $\min\{\ell^2,L_{\min}^2\}/100$. Cancellations in a Gibbs-state expansion yield boundary-correlation decay $Ke^{-\gamma d^2}$ for separations $d\geq L_{\max}^{2/3}$. The result concerns the specified Davies dynamics and periodic boundaries; open boundaries are not proved. Temperature-dependent constants may grow rapidly as $\beta\to\infty$, so the bound remains compatible with finite-size partial self-correction.

No sign of AI-generated textAI use disclosed
We acknowledge the use of LLMs for a proof of Lemma~\ref{lem:characterbound} as well as testing, refining proof ideas, proofreading, and generating Ti$k$Z figures.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
28 pages, 11 figures

Related papers

Random Local Stabilizer Codes in Three Dimensions without String or Self-Similar Fractal Logical Operators

Han Yan

Quantum error-correcting codes (QECs) are essential components of quantum computation and have deep connections to quantum phases of matter. A key obstruction to passive self-correcting QECs is the presence of string logical operators, which can generate logical errors through constant-energy-barrier processes. Haah's Codes (fracton codes) showed that three-dimensional stabilizer codes can forbid such string logical operators, but their translation-invariant structure supports self-similar fractal logical operators with a logarithmic energy barrier. We introduce the qutrit random cubic codes, a family of local qutrit Calderbank-Shor-Steane stabilizer Hamiltonians with similar cube-check structure as Haah's Code 1 but built from spatially varying stabilizers. We prove that these models retain the no-string property and numerically observe that they have properties distinct from translation-invariant fracton codes: the smallest ground-state degeneracy exponent is $k=2$ for odd $L$ and $k=4$ for even $L$; noncontractible plane-logical operators span the entire logical space; and charge-push diagnostics show that the self-similar fractal operators are absent. These results demonstrate that constrained randomness can fundamentally change the nature of stabilizer codes and improve their self-correction properties. They further point to broader families of quantum error-correcting codes and quantum phases beyond canonical topological and fracton orders.

quant-pharXiv:2606.19873•Jun 19, 2026•0 citations

Quantum Self-Correction in the 3D Cubic Code Model

Sergey B. Bravyi, Jeongwan Haah

A big open question in the quantum information theory concerns the feasibility of a self-correcting quantum memory. A quantum state recorded in such memory can be stored reliably for a macroscopic time without need for active error correction, if the memory is in contact with a cold enough thermal bath. Here we report analytic and numerical evidence for self-correcting behavior in the quantum spin lattice model known as the 3D cubic code. We prove that its memory time is at least L(cβ), where L is the lattice size, β is the inverse temperature of the bath, and c>0 is a constant coefficient. However, this bound applies only if the lattice size L does not exceed a critical value which grows exponentially with β. In that sense, the model can be called a partially self-correcting memory. We also report a Monte Carlo simulation indicating that our analytic bounds on the memory time are tight up to constant coefficients. To model the readout step we introduce a new decoding algorithm, which can be implemented efficiently for any topological stabilizer code. A longer version of this work can be found in Bravyi and Haah, arXiv:1112.3252.

arXiv:1112.3252•Physical Review Letters•Nov 12, 2013•327 citations

Proposals for 3D self-correcting quantum memory

Ting-Chun Lin, Wang, Hsin-Po, Min-Hsiu Hsieh

A self-correcting quantum memory is a type of quantum error correcting code that can correct errors passively through cooling. A major open question in the field is whether self-correcting quantum memories can exist in 3D. In this work, we propose two candidate constructions for 3D self-correcting quantum memories. The first construction is an extension of Haah's code, which retains translation invariance. The second construction is based on fractals with greater flexibility in its design. Additionally, we review existing 3D quantum codes and suggest that they are not self-correcting.

arXiv:2411.03115•Nov 5, 2024•9 citations

Self-Correcting 3D Surface Code with Growing Local Dimension

Jinkang Guo

We construct self-correcting 3D surface codes over $\mathbb Z_q$ with local dimension $q$ growing with system size. The model preserves the local geometry and stabilizer support of the ordinary 3D surface code and remains translation invariant in the bulk, while modifying only the stabilizer Pauli powers. We use the Lee metric to characterize error weight and consider local Metropolis dynamics with single-qudit $X^{\pm1}$ and $Z^{\pm1}$ updates, each changing the energy by at most a constant independent of $q$ and system size $N$. We prove that, below the critical temperature, when the local dimension scales as $q=Θ(N)$, the memory times in both error sectors grow at least as $\exp\left[Ω(N^{1/3})\right]$. Our numerical results further support these analytical results. Together, these results establish growing local Hilbert-space dimension as a new resource for designing self-correcting quantum memories while retaining simple local geometry and local thermal dynamics.

quant-pharXiv:2610.35099•Oct 27, 2026•0 citations

Channel-resolved memory time of Haah's cubic code under reversible rate filtering and temporally correlated baths

Hikaru Wakaura

Abstract Self-correcting quantum memories would store logical information without a real-time decoder, and Haah's cubic code is the best studied three-dimensional candidate, but how its memory time depends on the environment beyond a flat Markovian bath has not been mapped. Here we simulate the thermal syndrome dynamics of the cubic code at $\beta=4.5$--$5$ for up to $13718$ qubits under detailed-balance rate filters on each of its three energy channels, under an Ornstein--Uhlenbeck modulation that gives the bath a correlation time, and at rescaled code energies. The zero-energy diffusion channel controls the memory time: suppressing it by $10^{3}$ lengthens the memory time $80$- to $120$-fold for $L=7$--$13$, the gain enters as a prefactor rather than a steeper size law, and it outlives the flat-bath optimum, where the memory time peaks between $L=13$ and $17$ and falls by $39\%$ at $L=19$ while the filtered bath still grows to $L=17$ and gains a factor $45$ at $L=19$. The pair-creation channel is invisible over three decades; a bath correlation time adds a factor of two to eleven, consistent with annealed and quenched hazard averages; and a uniform $12\%$ energy rescaling raises the size exponent from $2.7$ to $4.3$ along the Bravyi--Haah line, which no gapped pseudomode we solve provides. These results form a channel-resolved finite-size benchmark for bath engineering of a passive three-dimensional memory; they establish neither asymptotic scaling nor an advantage over active decoding.

•Oct 12, 2026•0 citations

Topological order and memory time in marginally-self-correcting quantum memory

Karthik Siva, Beni Yoshida

We examine two proposals for marginally-self-correcting quantum memory: the cubic code by Haah and the welded code by Michnicki. In particular, we prove explicitly that they are absent of topological order above zero temperature, as their Gibbs ensembles can be prepared via a short-depth quantum circuit from classical ensembles. Our proof technique naturally gives rise to the notion of free energy associated with excitations. Further, we develop a framework for an ergodic decomposition of Davies generators in CSS codes which enables formal reduction to simpler classical memory problems. We then show that memory time in the welded code is doubly exponential in inverse temperature via the Peierls argument. These results introduce further connections between thermal topological order and self-correction from the viewpoint of free energy and quantum circuit depth.

arXiv:1603.07805•Physical Review A•Mar 22, 2017•34 citations
Haah's 3D cubic code was introduced as a candidate for a self-correcting quantum memory in three dimensions, using the absence of string logical operators to obstruct thermal errors. It has been a long-standing open question whether it is a self-correcting quantum memory. Even though the memory time was explored numerically, no analytical upper bound was known. Here, we settle this question rigorously and show that the cubic code thermalizes rapidly at every positive temperature. Our proof relies on the framework of [Commun. Math. Phys. 407, 195 (2026)] to turn a decay-of-correlations condition into a modified logarithmic Sobolev inequality for the Davies generator. To the best of our knowledge, this is the first analytic proof of rapid mixing for all positive temperatures for any fracton code.
Haah’s cubic code has a logarithmic logical energy barrier and exhibits partial self-correction over a temperature-dependent range of sizes, but these facts do not determine its asymptotic thermal memory lifetime. This paper establishes an all-positive-temperature thermalization bound for the code under local Davies dynamics.
For a periodic cubic lattice of linear size LLL with n=2L3n=2L^3n=2L3 qubits, single-qubit XXX and ZZZ bath couplings, and detailed-balance rates uniformly bounded away from zero at fixed inverse temperature β<∞\beta<\inftyβ<∞, the Davies generator satisfies a modified logarithmic Sobolev inequality with a size-independent constant. Consequently, the worst-case trace-distance mixing time obeys tmix(ε)≤Cβ(log⁡L+log⁡ε−1)t_{\mathrm{mix}}(\varepsilon)\leq C_\beta(\log L+\log\varepsilon^{-1})tmix​(ε)≤Cβ​(logL+logε−1). Contractivity under recovery gives an Oβ(log⁡L)O_\beta(\log L)Oβ​(logL) upper bound on passive-memory time, irrespective of the final decoder, excluding asymptotic polynomial lifetime growth at fixed positive temperature.
The proof applies an existing framework converting a Dobrushin–Shlosman boundary-correlation condition into entropy tensorization and then a uniform Sobolev bound. The new geometric estimates control kernels of restricted check maps: their dimensions scale at most linearly with box side lengths, while configurations reaching distance ℓ\ellℓ have weight at least min⁡{ℓ2,Lmin⁡2}/100\min\{\ell^2,L_{\min}^2\}/100min{ℓ2,Lmin2​}/100. Cancellations in a Gibbs-state expansion yield boundary-correlation decay Ke−γd2Ke^{-\gamma d^2}Ke−γd2 for separations d≥Lmax⁡2/3d\geq L_{\max}^{2/3}d≥Lmax2/3​.
The result concerns the specified Davies dynamics and periodic boundaries; open boundaries are not proved. Temperature-dependent constants may grow rapidly as β→∞\beta\to\inftyβ→∞, so the bound remains compatible with finite-size partial self-correction.
Quantum error-correcting codes (QECs) are essential components of quantum computation and have deep connections to quantum phases of matter. A key obstruction to passive self-correcting QECs is the presence of string logical operators, which can generate logical errors through constant-energy-barrier processes. Haah's Codes (fracton codes) showed that three-dimensional stabilizer codes can forbid such string logical operators, but their translation-invariant structure supports self-similar fractal logical operators with a logarithmic energy barrier. We introduce the qutrit random cubic codes, a family of local qutrit Calderbank-Shor-Steane stabilizer Hamiltonians with similar cube-check structure as Haah's Code 1 but built from spatially varying stabilizers. We prove that these models retain the no-string property and numerically observe that they have properties distinct from translation-invariant fracton codes: the smallest ground-state degeneracy exponent is k=2k=2k=2 for odd LLL and k=4k=4k=4 for even LLL; noncontractible plane-logical operators span the entire logical space; and charge-push diagnostics show that the self-similar fractal operators are absent. These results demonstrate that constrained randomness can fundamentally change the nature of stabilizer codes and improve their self-correction properties. They further point to broader families of quantum error-correcting codes and quantum phases beyond canonical topological and fracton orders.
A big open question in the quantum information theory concerns the feasibility of a self-correcting quantum memory. A quantum state recorded in such memory can be stored reliably for a macroscopic time without need for active error correction, if the memory is in contact with a cold enough thermal bath. Here we report analytic and numerical evidence for self-correcting behavior in the quantum spin lattice model known as the 3D cubic code. We prove that its memory time is at least L(cβ), where L is the lattice size, β is the inverse temperature of the bath, and c>0 is a constant coefficient. However, this bound applies only if the lattice size L does not exceed a critical value which grows exponentially with β. In that sense, the model can be called a partially self-correcting memory. We also report a Monte Carlo simulation indicating that our analytic bounds on the memory time are tight up to constant coefficients. To model the readout step we introduce a new decoding algorithm, which can be implemented efficiently for any topological stabilizer code. A longer version of this work can be found in Bravyi and Haah, arXiv:1112.3252.
A self-correcting quantum memory is a type of quantum error correcting code that can correct errors passively through cooling. A major open question in the field is whether self-correcting quantum memories can exist in 3D. In this work, we propose two candidate constructions for 3D self-correcting quantum memories. The first construction is an extension of Haah's code, which retains translation invariance. The second construction is based on fractals with greater flexibility in its design. Additionally, we review existing 3D quantum codes and suggest that they are not self-correcting.
We construct self-correcting 3D surface codes over Zq\mathbb Z_qZq​ with local dimension qqq growing with system size. The model preserves the local geometry and stabilizer support of the ordinary 3D surface code and remains translation invariant in the bulk, while modifying only the stabilizer Pauli powers. We use the Lee metric to characterize error weight and consider local Metropolis dynamics with single-qudit X±1X^{\pm1}X±1 and Z±1Z^{\pm1}Z±1 updates, each changing the energy by at most a constant independent of qqq and system size NNN. We prove that, below the critical temperature, when the local dimension scales as q=Θ(N)q=Θ(N)q=Θ(N), the memory times in both error sectors grow at least as exp⁡[Ω(N1/3)]\exp\left[Ω(N^{1/3})\right]exp[Ω(N1/3)]. Our numerical results further support these analytical results. Together, these results establish growing local Hilbert-space dimension as a new resource for designing self-correcting quantum memories while retaining simple local geometry and local thermal dynamics.
Abstract Self-correcting quantum memories would store logical information without a real-time decoder, and Haah's cubic code is the best studied three-dimensional candidate, but how its memory time depends on the environment beyond a flat Markovian bath has not been mapped. Here we simulate the thermal syndrome dynamics of the cubic code at β=4.5\beta=4.5β=4.5--555 for up to 137181371813718 qubits under detailed-balance rate filters on each of its three energy channels, under an Ornstein--Uhlenbeck modulation that gives the bath a correlation time, and at rescaled code energies. The zero-energy diffusion channel controls the memory time: suppressing it by 10310^{3}103 lengthens the memory time 808080- to 120120120-fold for L=7L=7L=7--131313, the gain enters as a prefactor rather than a steeper size law, and it outlives the flat-bath optimum, where the memory time peaks between L=13L=13L=13 and 171717 and falls by 39%39\%39% at L=19L=19L=19 while the filtered bath still grows to L=17L=17L=17 and gains a factor 454545 at L=19L=19L=19. The pair-creation channel is invisible over three decades; a bath correlation time adds a factor of two to eleven, consistent with annealed and quenched hazard averages; and a uniform 12%12\%12% energy rescaling raises the size exponent from 2.72.72.7 to 4.34.34.3 along the Bravyi--Haah line, which no gapped pseudomode we solve provides. These results form a channel-resolved finite-size benchmark for bath engineering of a passive three-dimensional memory; they establish neither asymptotic scaling nor an advantage over active decoding.
We examine two proposals for marginally-self-correcting quantum memory: the cubic code by Haah and the welded code by Michnicki. In particular, we prove explicitly that they are absent of topological order above zero temperature, as their Gibbs ensembles can be prepared via a short-depth quantum circuit from classical ensembles. Our proof technique naturally gives rise to the notion of free energy associated with excitations. Further, we develop a framework for an ergodic decomposition of Davies generators in CSS codes which enables formal reduction to simpler classical memory problems. We then show that memory time in the welded code is doubly exponential in inverse temperature via the Peierls argument. These results introduce further connections between thermal topological order and self-correction from the viewpoint of free energy and quantum circuit depth.