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

Proposals for 3D self-correcting quantum memory

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

Published Nov 5, 2024• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2411.03115

Related papers

A proposal for self-correcting stabilizer quantum memories in 3 dimensions (or slightly less)

Courtney G Brell

We propose a family of local CSS stabilizer codes as possible candidates for self-correcting quantum memories in 3D. The construction is inspired by the classical Ising model on a Sierpinski carpet fractal, which acts as a classical self-correcting memory. Our models are naturally defined on fractal subsets of a 4D hypercubic lattice with Hausdorff dimension less than 3. Though this does not imply that these models can be realized with local interactions in , we also discuss this possibility. The X and Z sectors of the code are dual to one another, and we show that there exists a finite temperature phase transition associated with each of these sectors, providing evidence that the system may robustly store quantum information at finite temperature.

arXiv:1411.7046•New Journal of Physics•Jan 25, 2016•23 citations

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•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•292 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

A passive self-correcting quantum memory in three dimensions

Shankar Balasubramanian, Margarita Davydova, Ting-Chun Lin

We construct a 3D Pauli stabilizer Hamiltonian whose ground state space can encode a qubit for exponential time when coupled to a bath at non-zero temperature. Our construction recursively applies a sequence of transformations to a seed Hamiltonian that increases the memory lifetime of the encoded qubit while maintaining geometric locality in $\mathbb{R}^3$.

quant-pharXiv:2605.10943•May 12, 2026•0 citations

Cored product codes for quantum self-correction in three dimensions

Brenden Roberts, Jin Ming Koh, Yi Tan +1 more

The existence of self-correcting quantum memories in three dimensions is a long-standing open question at the interface between quantum computing and many-body physics. We take the perspective that large contributions to the entropy arising from fine-tuned spatial symmetries, including the assumption of an underlying regular lattice, are responsible for fundamental challenges to realizing self-correction. Accordingly, we introduce a class of disordered quantum codes, which we call "cored product codes". These codes are derived from classical factors via the hypergraph product but undergo a coring procedure which allows them to be embedded in a lower number of spatial dimensions while preserving code properties. As a specific example, we focus on a fractal code based on the aperiodic pinwheel tiling as the classical factor and perform finite temperature numerical simulations on the resulting three-dimensional quantum memory. We provide evidence that, below a critical temperature, the memory lifetime increases with system size for codes up to 60000 qubits.

arXiv:2510.05479•Oct 7, 2025•0 citations
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 propose a family of local CSS stabilizer codes as possible candidates for self-correcting quantum memories in 3D. The construction is inspired by the classical Ising model on a Sierpinski carpet fractal, which acts as a classical self-correcting memory. Our models are naturally defined on fractal subsets of a 4D hypercubic lattice with Hausdorff dimension less than 3. Though this does not imply that these models can be realized with local interactions in , we also discuss this possibility. The X and Z sectors of the code are dual to one another, and we show that there exists a finite temperature phase transition associated with each of these sectors, providing evidence that the system may robustly store quantum information at finite temperature.
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.
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.
We construct a 3D Pauli stabilizer Hamiltonian whose ground state space can encode a qubit for exponential time when coupled to a bath at non-zero temperature. Our construction recursively applies a sequence of transformations to a seed Hamiltonian that increases the memory lifetime of the encoded qubit while maintaining geometric locality in R3\mathbb{R}^3R3.
The existence of self-correcting quantum memories in three dimensions is a long-standing open question at the interface between quantum computing and many-body physics. We take the perspective that large contributions to the entropy arising from fine-tuned spatial symmetries, including the assumption of an underlying regular lattice, are responsible for fundamental challenges to realizing self-correction. Accordingly, we introduce a class of disordered quantum codes, which we call "cored product codes". These codes are derived from classical factors via the hypergraph product but undergo a coring procedure which allows them to be embedded in a lower number of spatial dimensions while preserving code properties. As a specific example, we focus on a fractal code based on the aperiodic pinwheel tiling as the classical factor and perform finite temperature numerical simulations on the resulting three-dimensional quantum memory. We provide evidence that, below a critical temperature, the memory lifetime increases with system size for codes up to 60000 qubits.