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

3-d quantum stabilizer codes with a power law energy barrier

Kamil Michnicki

Published Aug 16, 2012• 33 citations
arXivHTMLPDF

Abstract

We introduce a new primitive, called welding, for combining two stabilizer codes to produce a new stabilizer code. We apply welding to construct surface codes and then use the surface codes to construct solid codes, a variant of a 3-d toric code with rough and smooth boundaries. Finally, we weld solid codes together to produce a $(O(L^3),1,O(L^{4/3}))$ stabilizer code with an energy barrier of $O(L^{2/3})$, which solves an open problem of whether a power law energy barrier is possible for local stabilizer code Hamiltonians in three-dimensions. The previous highest energy barrier is $O(\log L)$. Previous no-go results are avoided by breaking translation invariance.

DOI
10.48550/arxiv.1208.3496

Related papers

3D Topological Quantum Memory with a Power-Law Energy Barrier

Kamil Michnicki

We discuss energy barriers and their relationship to self-correcting quantum memories. We introduce the solid code, a 3D version of Kitaev's surface code, and then combine several solid codes using a technique called welding. The resulting code is a [[O(L³),1,O(L(4/3))]] stabilizer code with an energy barrier of O(L(2/3)), which is an exponential improvement over the previous highest energy barrier in 3D. No-go results are avoided by breaking microscopic translation invariance.

arXiv:1406.4227•Physical Review Letters•Sep 24, 2014•36 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

Decoding the three-dimensional toric codes and welded codes on cubic lattices

Abhishek Kulkarni, Pradeep Kiran Sarvepalli

Recent years have seen a growing interest in quantum codes in three dimensions (3D). One of the earliest proposed 3D quantum codes is the 3D toric code. It has been shown that 3D color codes can be mapped to 3D toric codes. The 3D toric code on a cubic lattice is also a building block for the welded code which has the highest energy barrier to date. Although well known, the performance of the 3D toric code has not been studied extensively. In this paper we propose efficient decoding algorithms for the 3D toric code on a cubic lattice with and without boundaries and report their performance for various quantum channels. We observe a threshold of $\ensuremath{\gtrsim}12%$ for the bit flip errors, $\ensuremath{\approx}3%$ for the phase flip errors, and 24.8% for the erasure channel. We also study the performance of the welded 3D toric code on the quantum erasure channel. We did not observe a threshold for the welded code over the erasure channel for the parameters we simulated.

arXiv:1808.03092•Physical Review A•Jul 8, 2019•4 citations

Layer codes

Dominic J. Williamson, Nouédyn Baspin

Quantum computers require memories that are capable of storing quantum information reliably for long periods of time. The surface code is a two-dimensional quantum memory with code parameters that scale optimally with the number of physical qubits, under the constraint of two-dimensional locality. In three spatial dimensions an analogous simple yet optimal code was not previously known. Here we present a family of three dimensional topological codes with optimal scaling code parameters and a polynomial energy barrier. Our codes are based on a construction that takes in a stabilizer code and outputs a three-dimensional topological code with related code parameters. The output codes are topological defect networks formed by layers of surface code joined along one-dimensional junctions, with a maximum stabilizer check weight of six. When the input is a family of good quantum low-density parity-check codes the output codes have optimal scaling. Our results uncover strongly-correlated states of quantum matter that are capable of storing quantum information with the strongest possible protection from errors that is achievable in three dimensions. Quantum error correcting codes are inefficient when implemented on platforms with local connectivity in two dimensions, which motivates platforms with 3D connectivity and codes applicable in these conditions. Here, the authors show how to transform any CSS stabilizer code into a 3D topological code, leading to codes with optimal asymptotic scaling in 3D.

arXiv:2309.16503•Nature Communications•Nov 4, 2024•26 citations

Parent Hamiltonians for stabilizer quantum many-body scars

Shane Dooley

Quantum many-body scars (QMBS) have attracted considerable interest due to their role in weak ergodicity breaking in many-body systems. We present a general construction that embeds stabilizer states as QMBS of local Hamiltonians. The method relies on a notion of factorizability of Pauli strings on a lattice, which is used to convert stabilizer elements into local, few-body operators that annihilate the stabilizer state. This enables the systematic construction of parent Hamiltonians with zero-energy stabilizer QMBS typically near the middle of the spectrum. The method reproduces several known results in a unified framework, including recent examples of volume-law entangled QMBS, such as the ``rainbow'' QMBS and the entangled antipodal Bell pair state. We also apply the framework to construct examples of stabilizer QMBS with a more complex entanglement structure, such as the cluster state, the toric code state, and a volume-law entangled state we dub the antipodal toric code (ATC) state. Exact diagonalization confirms our results and reveal the stabilizer states as exact eigenstates of their parent Hamiltonian.

quant-pharXiv:2601.10805•Physical Review Letters•Jan 19, 2026•5 citations

Layer Codes as Partially Self-Correcting Quantum Memories

Shouzhen Gu, Libor Caha, Shin Ho Choe +3 more

We investigate layer codes, a family of three-dimensional stabilizer codes that achieves optimal scaling of code parameters and energy barrier, as candidates for self-correcting quantum memories. First, we introduce two decoding algorithms for layer codes with provable guarantees for local stochastic and adversarial noise, respectively. We then prove that layer codes constitute partially self-correcting quantum memories which outperform previously analyzed models such as the cubic and welded solid codes. Notably, we argue that partial self-correction without the requirement of efficient decoding is more common than expected, as it arises solely from a diverging energy barrier. This draws a sharp distinction between partially self-correcting systems and partially self-correcting memories. Another novel aspect of our work is an analysis of layer codes constructed from random Calderbank-Shor-Steane codes. We show that these random layer codes have optimal scaling (up to logarithmic corrections) of code parameters and energy barrier. Finally, we present numerical studies of their memory times and report behavior consistent with partial self-correction.

arXiv:2510.06659•Physical Review Letters•Apr 9, 2026•9 citations
We introduce a new primitive, called welding, for combining two stabilizer codes to produce a new stabilizer code. We apply welding to construct surface codes and then use the surface codes to construct solid codes, a variant of a 3-d toric code with rough and smooth boundaries. Finally, we weld solid codes together to produce a (O(L3),1,O(L4/3))(O(L^3),1,O(L^{4/3}))(O(L3),1,O(L4/3)) stabilizer code with an energy barrier of O(L2/3)O(L^{2/3})O(L2/3), which solves an open problem of whether a power law energy barrier is possible for local stabilizer code Hamiltonians in three-dimensions. The previous highest energy barrier is O(log⁡L)O(\log L)O(logL). Previous no-go results are avoided by breaking translation invariance.
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.
Recent years have seen a growing interest in quantum codes in three dimensions (3D). One of the earliest proposed 3D quantum codes is the 3D toric code. It has been shown that 3D color codes can be mapped to 3D toric codes. The 3D toric code on a cubic lattice is also a building block for the welded code which has the highest energy barrier to date. Although well known, the performance of the 3D toric code has not been studied extensively. In this paper we propose efficient decoding algorithms for the 3D toric code on a cubic lattice with and without boundaries and report their performance for various quantum channels. We observe a threshold of $\ensuremath{\gtrsim}12%$ for the bit flip errors, $\ensuremath{\approx}3%$ for the phase flip errors, and 24.8% for the erasure channel. We also study the performance of the welded 3D toric code on the quantum erasure channel. We did not observe a threshold for the welded code over the erasure channel for the parameters we simulated.
Quantum computers require memories that are capable of storing quantum information reliably for long periods of time. The surface code is a two-dimensional quantum memory with code parameters that scale optimally with the number of physical qubits, under the constraint of two-dimensional locality. In three spatial dimensions an analogous simple yet optimal code was not previously known. Here we present a family of three dimensional topological codes with optimal scaling code parameters and a polynomial energy barrier. Our codes are based on a construction that takes in a stabilizer code and outputs a three-dimensional topological code with related code parameters. The output codes are topological defect networks formed by layers of surface code joined along one-dimensional junctions, with a maximum stabilizer check weight of six. When the input is a family of good quantum low-density parity-check codes the output codes have optimal scaling. Our results uncover strongly-correlated states of quantum matter that are capable of storing quantum information with the strongest possible protection from errors that is achievable in three dimensions. Quantum error correcting codes are inefficient when implemented on platforms with local connectivity in two dimensions, which motivates platforms with 3D connectivity and codes applicable in these conditions. Here, the authors show how to transform any CSS stabilizer code into a 3D topological code, leading to codes with optimal asymptotic scaling in 3D.
Quantum many-body scars (QMBS) have attracted considerable interest due to their role in weak ergodicity breaking in many-body systems. We present a general construction that embeds stabilizer states as QMBS of local Hamiltonians. The method relies on a notion of factorizability of Pauli strings on a lattice, which is used to convert stabilizer elements into local, few-body operators that annihilate the stabilizer state. This enables the systematic construction of parent Hamiltonians with zero-energy stabilizer QMBS typically near the middle of the spectrum. The method reproduces several known results in a unified framework, including recent examples of volume-law entangled QMBS, such as the ``rainbow'' QMBS and the entangled antipodal Bell pair state. We also apply the framework to construct examples of stabilizer QMBS with a more complex entanglement structure, such as the cluster state, the toric code state, and a volume-law entangled state we dub the antipodal toric code (ATC) state. Exact diagonalization confirms our results and reveal the stabilizer states as exact eigenstates of their parent Hamiltonian.
We investigate layer codes, a family of three-dimensional stabilizer codes that achieves optimal scaling of code parameters and energy barrier, as candidates for self-correcting quantum memories. First, we introduce two decoding algorithms for layer codes with provable guarantees for local stochastic and adversarial noise, respectively. We then prove that layer codes constitute partially self-correcting quantum memories which outperform previously analyzed models such as the cubic and welded solid codes. Notably, we argue that partial self-correction without the requirement of efficient decoding is more common than expected, as it arises solely from a diverging energy barrier. This draws a sharp distinction between partially self-correcting systems and partially self-correcting memories. Another novel aspect of our work is an analysis of layer codes constructed from random Calderbank-Shor-Steane codes. We show that these random layer codes have optimal scaling (up to logarithmic corrections) of code parameters and energy barrier. Finally, we present numerical studies of their memory times and report behavior consistent with partial self-correction.