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:1603.07805 · Physical Review A

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

Karthik Siva, Beni Yoshida

Published Mar 22, 2017• 34 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.95.032324

Related papers

Finite-temperature topological entanglement entropy for CSS codes

Zhi Li, Roger S. K. Mong

We consider topological entanglement entropy (TEE) at finite temperature for CSS codes, which include some ordinary topological-ordered systems such as the toric code and some fracton models such as the Haah's code and the X-cube model. We find, under the assumption that there is no extended critical phase, the finite-temperature TEE is a piecewise constant function of the temperature, with possible discontinuities only at phase transitions. We then consider phase transitions of CSS codes. We claim that there must exist a phase transition at zero temperature for any CSS codes in 2D and 3D with topological order. This statement can be rigorous proved for some familiar examples, while for general models it can be argued based on the low-temperature expansion. This indicates the break down of topological orders at finite temperature. We also discuss possible connections with self-correcting quantum memory.

arXiv:1910.07545•Oct 16, 2019•5 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

Long-Range Toric Code: Finite-Temperature Topological Order in Two Dimensions

Jacopo Gliozzi, Taylor L. Hughes, Kyung-Su Kim

We introduce two-dimensional toric code models with additional long-range loop interactions. Our models preserve the topologically ordered ground states of the ordinary toric code, while confining anyons at zero temperature. For sufficiently long-ranged interactions, we argue that this confinement persists at finite temperatures, strongly constraining anyon mobility and giving rise to finite-temperature topological order. This topological phase acts as a self-correcting quantum memory and exhibits long-range entanglement. For shorter-ranged interactions, signatures of topological order survive only up to an exponentially large length scale at finite temperature, yielding a partially self-correcting quantum memory.

cond-mat.str-elCross-listedarXiv:2610.37765•Oct 29, 2026•0 citations

Quantum memory at nonzero temperature in a thermodynamically trivial system

Yifan Hong, Jinkang Guo, Andrew Lucas

Passive error correction protects logical information forever (in the thermodynamic limit) by updating the system based only on local information and few-body interactions. A paradigmatic example is the classical two-dimensional Ising model: a Metropolis-style Gibbs sampler retains the sign of the initial magnetization (a logical bit) for thermodynamically long times in the low-temperature phase. Known models of passive quantum error correction similarly exhibit thermodynamic phase transitions to a low-temperature phase wherein logical qubits are protected by thermally stable topological order. Here, in contrast, we show that certain families of constant-rate classical and quantum low-density parity check codes have no thermodynamic phase transitions at nonzero temperature, but nonetheless exhibit ergodicity-breaking dynamical transitions: below a critical nonzero temperature, the mixing time of local Gibbs sampling diverges in the thermodynamic limit. Slow Gibbs sampling of such codes enables fault-tolerant passive quantum error correction using finite-depth circuits. This strategy is well suited to measurement-free quantum error correction, and may present a desirable experimental alternative to conventional quantum error correction based on syndrome measurements and active feedback. It has been commonly assumed that self-correcting quantum memories are only possible in systems with finite-temperature phase transitions to topological order. Here the authors show a complete breakdown of this expectation in quantum low-density parity-check codes.

arXiv:2403.10599•Nature Communications•Jan 2, 2025•28 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•3 citations

Towards self-correcting quantum memories

Kamil Michnicki

This thesis presents a model of self-correcting quantum memories where quantum states are encoded using topological stabilizer codes and error correction is done using local measurements and local dynamics. Quantum noise poses a practical barrier to developing quantum memories. This thesis explores two types of models for suppressing noise. One model suppresses thermalizing noise energetically by engineering a Hamiltonian with a high energy barrier between code states. Thermalizing dynamics are modeled phenomenologically as a Markovian quantum master equation with only local generators. The second model suppresses stochastic noise with a cellular automaton that performs error correction using syndrome measurements and a local update rule. Several ways of visualizing and thinking about stabilizer codes are presented in order to design ones that have a high energy barrier: the non-local Ising model, the quasi-particle graph and the theory of welded stabilizer codes. I develop the theory of welded stabilizer codes and use it to construct a code with the highest known energy barrier in 3-d for spin Hamiltonians: the welded solid code. Although the welded solid code is not fully self correcting, it has some self correcting properties. It has an increased memory lifetime for an increased system size up to a temperature dependent maximum. One strategy for increasing the energy barrier is by mediating an interaction with an external system. I prove a no-go theorem for a class of Hamiltonians where the interaction terms are local, of bounded strength and commute with the stabilizer group. Under these conditions the energy barrier can only be increased by a multiplicative constant. I develop cellular automaton to do error correction on a state encoded using the toric code. The numerical evidence indicates that while there is no threshold, the model can extend the memory lifetime significantly. While of less theoretical importance, this could be practical for real implementations of quantum memories. Numerical evidence also suggests that the cellular automaton could function as a decoder with a soft threshold.

•Sep 29, 2015•1 citation
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.
We consider topological entanglement entropy (TEE) at finite temperature for CSS codes, which include some ordinary topological-ordered systems such as the toric code and some fracton models such as the Haah's code and the X-cube model. We find, under the assumption that there is no extended critical phase, the finite-temperature TEE is a piecewise constant function of the temperature, with possible discontinuities only at phase transitions. We then consider phase transitions of CSS codes. We claim that there must exist a phase transition at zero temperature for any CSS codes in 2D and 3D with topological order. This statement can be rigorous proved for some familiar examples, while for general models it can be argued based on the low-temperature expansion. This indicates the break down of topological orders at finite temperature. We also discuss possible connections with self-correcting quantum memory.
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 introduce two-dimensional toric code models with additional long-range loop interactions. Our models preserve the topologically ordered ground states of the ordinary toric code, while confining anyons at zero temperature. For sufficiently long-ranged interactions, we argue that this confinement persists at finite temperatures, strongly constraining anyon mobility and giving rise to finite-temperature topological order. This topological phase acts as a self-correcting quantum memory and exhibits long-range entanglement. For shorter-ranged interactions, signatures of topological order survive only up to an exponentially large length scale at finite temperature, yielding a partially self-correcting quantum memory.
Passive error correction protects logical information forever (in the thermodynamic limit) by updating the system based only on local information and few-body interactions. A paradigmatic example is the classical two-dimensional Ising model: a Metropolis-style Gibbs sampler retains the sign of the initial magnetization (a logical bit) for thermodynamically long times in the low-temperature phase. Known models of passive quantum error correction similarly exhibit thermodynamic phase transitions to a low-temperature phase wherein logical qubits are protected by thermally stable topological order. Here, in contrast, we show that certain families of constant-rate classical and quantum low-density parity check codes have no thermodynamic phase transitions at nonzero temperature, but nonetheless exhibit ergodicity-breaking dynamical transitions: below a critical nonzero temperature, the mixing time of local Gibbs sampling diverges in the thermodynamic limit. Slow Gibbs sampling of such codes enables fault-tolerant passive quantum error correction using finite-depth circuits. This strategy is well suited to measurement-free quantum error correction, and may present a desirable experimental alternative to conventional quantum error correction based on syndrome measurements and active feedback. It has been commonly assumed that self-correcting quantum memories are only possible in systems with finite-temperature phase transitions to topological order. Here the authors show a complete breakdown of this expectation in quantum low-density parity-check codes.
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.
This thesis presents a model of self-correcting quantum memories where quantum states are encoded using topological stabilizer codes and error correction is done using local measurements and local dynamics. Quantum noise poses a practical barrier to developing quantum memories. This thesis explores two types of models for suppressing noise. One model suppresses thermalizing noise energetically by engineering a Hamiltonian with a high energy barrier between code states. Thermalizing dynamics are modeled phenomenologically as a Markovian quantum master equation with only local generators. The second model suppresses stochastic noise with a cellular automaton that performs error correction using syndrome measurements and a local update rule. Several ways of visualizing and thinking about stabilizer codes are presented in order to design ones that have a high energy barrier: the non-local Ising model, the quasi-particle graph and the theory of welded stabilizer codes. I develop the theory of welded stabilizer codes and use it to construct a code with the highest known energy barrier in 3-d for spin Hamiltonians: the welded solid code. Although the welded solid code is not fully self correcting, it has some self correcting properties. It has an increased memory lifetime for an increased system size up to a temperature dependent maximum. One strategy for increasing the energy barrier is by mediating an interaction with an external system. I prove a no-go theorem for a class of Hamiltonians where the interaction terms are local, of bounded strength and commute with the stabilizer group. Under these conditions the energy barrier can only be increased by a multiplicative constant. I develop cellular automaton to do error correction on a state encoded using the toric code. The numerical evidence indicates that while there is no threshold, the model can extend the memory lifetime significantly. While of less theoretical importance, this could be practical for real implementations of quantum memories. Numerical evidence also suggests that the cellular automaton could function as a decoder with a soft threshold.