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

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

Hikaru Wakaura

Published Oct 12, 2026• 0 citations
PDF (CC BY)Publisher

Abstract

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.

DOI
10.21203/rs.3.rs-11241681/v1

Related papers

Haah's 3D cubic code thermalizes rapidly

Sebastian Stengele, Libor Caha, Ángela Capel +1 more

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.

quant-pharXiv:2609.39959•Oct 1, 2026•3 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

Partial Self-Correction in Layer Codes

Dominic J. Williamson

The storage of large-scale quantum information at finite temperature requires an autonomous and reliable quantum hard drive, also known as a self-correcting quantum memory. It is a long-standing open problem to find a self-correcting quantum memory in three dimensions. The recently introduced layer codes achieve the best possible scaling of code parameters and logical energy barrier in three dimensions; these are tantalizing features for the purposes of self-correction. In this Letter, we show that a family of layer codes based on good quantum Tanner codes exhibit partial self-correction. Their memory time grows exponentially with linear system size, up to a length scale that is exponential in the inverse temperature. At this length scale, the memory time scales as a double exponential of inverse temperature. To establish this result, we introduce a concatenated matching decoder that combines three rounds of parallelized minimum-weight perfect matching with a decoder for good quantum Tanner codes. We show that our decoder corrects errors up to a constant fraction of the energy barrier, and a constant fraction of the code distance, for a family of layer codes. Our results position layer codes as the leading candidate for a partially self-correcting memory in three dimensions in the asymptotically large system size regime. While they fall short of achieving strict self-correction in the thermodynamic limit, our Letter highlights the potential of these local codes in three dimensions, with fast distance and logical qubit growth, fast decoders, and a long memory time over a wide range of parameters. In particular, recent work by Gu et al. reports promising numerical results for the memory time of small explicit instances of layer codes based on random input codes.

arXiv:2510.09218•Physical Review Letters•Jul 29, 2026•7 citations

Bounds on Autonomous Quantum Error Correction

Oles Shtanko, Yu-Jie Liu, Simon Lieu +2 more

Autonomous quantum memories are a way to passively protect quantum information using engineered dissipation that creates an “always-on'' decoder. We analyze Markovian autonomous decoders that can be implemented with a wide range of qubit and bosonic error-correcting codes, and derive several upper bounds and a lower bound on the logical error rate in terms of correction and noise rates. These bounds suggest that, in general, there is always a correction rate, possibly size-dependent, above which autonomous memories exhibit arbitrarily long coherence times. For any given autonomous memory, size dependence of this correction rate is difficult to rule out: we point to common scenarios where autonomous decoders that stochastically implement active error correction must operate at rates that grow with code size. For codes with a threshold, we show that it is possible to achieve faster-than-polynomial decay of the logical error rate with code size by using superlogarithmic scaling of the correction rate. We illustrate our results with several examples. One example is an exactly solvable global dissipative toric code model that can achieve an effective logical error rate that decreases exponentially with the linear lattice size, provided that the recovery rate grows proportionally with the linear lattice size.

arXiv:2308.16233•Quantum•Jul 22, 2025•13 citations

What Must a Quantum-Memory Decoder Know About Temporally Correlated Noise?

Danesh Morales-Hashemi, Graeme Smith, Ningping Cao

What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent $X$ rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching $1/2$ relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below $1/2$, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's $X$ distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.

quant-pharXiv:2610.03545•Oct 5, 2026•0 citations

Quantum Memory from Rare Thermal Boundaries

Harjas Sandhu

Thermal equilibrium can suppress the configurations through which stored quantum information changes. The challenge is to turn that equilibrium statement into protection of an unknown input after it has been written into a memory. This paper proves two storage criteria under the exact joint system–bath Hamiltonian dynamics. When all three logical Pauli commutators are supported on a common projection of Gibbs probability p, ideal logical subsystem replacement gives a deterministic channel-error bound proportional to p times the holding time. A protocol using a classical Pauli frame gives a sharper thermal correlation bound. Both estimates preserve arbitrary entanglement with an external reference and retain the full exponential coefficient of any separately established rare-boundary estimate. The argument separates a relative-entropy control of rare events from a general Bell–Weyl correlation-to-channel theorem. The latter applies to arbitrary fixed correlated resources and joint quantum channels, with an algebraic extension for infinite baths. Further results give sufficient conditions for imperfect writing, a normalized-sector formulation, and explicit obstructions showing why initial logical accuracy or domination by one thermal resource need not characterize a useful memory. The results are abstract storage criteria. They assume an accessible exact logical algebra and a specified joint resource; they do not supply a new three-dimensional code, efficient Gibbs-state preparation, or a generic noisy-writing threshold. A separate collective-symmetry application retains its exact coupling and energy-scale assumptions. Established correlation, entropy, channel-randomization and noiseless-subsystem machinery is credited throughout.

•Nov 6, 2026•0 citations
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.
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.
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.
The storage of large-scale quantum information at finite temperature requires an autonomous and reliable quantum hard drive, also known as a self-correcting quantum memory. It is a long-standing open problem to find a self-correcting quantum memory in three dimensions. The recently introduced layer codes achieve the best possible scaling of code parameters and logical energy barrier in three dimensions; these are tantalizing features for the purposes of self-correction. In this Letter, we show that a family of layer codes based on good quantum Tanner codes exhibit partial self-correction. Their memory time grows exponentially with linear system size, up to a length scale that is exponential in the inverse temperature. At this length scale, the memory time scales as a double exponential of inverse temperature. To establish this result, we introduce a concatenated matching decoder that combines three rounds of parallelized minimum-weight perfect matching with a decoder for good quantum Tanner codes. We show that our decoder corrects errors up to a constant fraction of the energy barrier, and a constant fraction of the code distance, for a family of layer codes. Our results position layer codes as the leading candidate for a partially self-correcting memory in three dimensions in the asymptotically large system size regime. While they fall short of achieving strict self-correction in the thermodynamic limit, our Letter highlights the potential of these local codes in three dimensions, with fast distance and logical qubit growth, fast decoders, and a long memory time over a wide range of parameters. In particular, recent work by Gu et al. reports promising numerical results for the memory time of small explicit instances of layer codes based on random input codes.
Autonomous quantum memories are a way to passively protect quantum information using engineered dissipation that creates an “always-on'' decoder. We analyze Markovian autonomous decoders that can be implemented with a wide range of qubit and bosonic error-correcting codes, and derive several upper bounds and a lower bound on the logical error rate in terms of correction and noise rates. These bounds suggest that, in general, there is always a correction rate, possibly size-dependent, above which autonomous memories exhibit arbitrarily long coherence times. For any given autonomous memory, size dependence of this correction rate is difficult to rule out: we point to common scenarios where autonomous decoders that stochastically implement active error correction must operate at rates that grow with code size. For codes with a threshold, we show that it is possible to achieve faster-than-polynomial decay of the logical error rate with code size by using superlogarithmic scaling of the correction rate. We illustrate our results with several examples. One example is an exactly solvable global dissipative toric code model that can achieve an effective logical error rate that decreases exponentially with the linear lattice size, provided that the recovery rate grows proportionally with the linear lattice size.
What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent XXX rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching 1/21/21/2 relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below 1/21/21/2, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's XXX distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.
Thermal equilibrium can suppress the configurations through which stored quantum information changes. The challenge is to turn that equilibrium statement into protection of an unknown input after it has been written into a memory. This paper proves two storage criteria under the exact joint system–bath Hamiltonian dynamics. When all three logical Pauli commutators are supported on a common projection of Gibbs probability p, ideal logical subsystem replacement gives a deterministic channel-error bound proportional to p times the holding time. A protocol using a classical Pauli frame gives a sharper thermal correlation bound. Both estimates preserve arbitrary entanglement with an external reference and retain the full exponential coefficient of any separately established rare-boundary estimate. The argument separates a relative-entropy control of rare events from a general Bell–Weyl correlation-to-channel theorem. The latter applies to arbitrary fixed correlated resources and joint quantum channels, with an algebraic extension for infinite baths. Further results give sufficient conditions for imperfect writing, a normalized-sector formulation, and explicit obstructions showing why initial logical accuracy or domination by one thermal resource need not characterize a useful memory. The results are abstract storage criteria. They assume an accessible exact logical algebra and a specified joint resource; they do not supply a new three-dimensional code, efficient Gibbs-state preparation, or a generic noisy-writing threshold. A separate collective-symmetry application retains its exact coupling and energy-scale assumptions. Established correlation, entropy, channel-randomization and noiseless-subsystem machinery is credited throughout.