Toric codes all the way down: decoupling translation-invariant topological CSS codes in higher dimensions
quant-ph, cond-mat.str-el
Submitted: 2026-10-29
Updated: 2026-11-10
Comments: 22 pages, 4 figures. Code: https://github.com/hmx21/css-decoupling ; Lean formalization: https://github.com/hmx21/css-decoupling-lean . v2: references added, Zenodo DOIs added, minor edits
Code: https://github.com/hmx21/css-decoupling
License: http://creativecommons.org/licenses/by/4.0/
The gist: Topological Calderbank-Shor-Steane (CSS) codes in more than two spatial dimensions offer features useful for fault-tolerant quantum computation…
Terminology
Abstract
Topological Calderbank-Shor-Steane (CSS) codes in more than two spatial dimensions offer features useful for fault-tolerant quantum computation, such as transversal non-Clifford gates and single-shot decoding, but a systematic understanding of them is still lacking. One approach is to decouple a code: map it to a stack of higher-form toric codes by a finite-depth local CSS-preserving Clifford circuit, possibly after adding ancillas. For translation-invariant p-ary CSS codes, where p is prime (p=2 for qubits), we require the circuit to commute with the translations of a superlattice. In two dimensions, such a decoupling exists once these translations act trivially on every anyon type. In higher dimensions, excitations are sorted by their dimension into superselection layers, which can remain glued together even when translations act trivially on each layer. We show that this gluing is the only remaining obstruction: a code can be decoupled on a superlattice exactly when, after coarse-graining to it, translations act trivially on every layer and the gluing vanishes. Moreover, for a code with finitely many excitation types in each layer and m nonzero layers, once translations act trivially on every layer, further coarse-graining by a factor of p m-1 in every direction removes the aforementioned gluing. Physically, the same criterion determines when the code encodes the maximal number of logical qudits on a finite torus. Finally, we give an explicit algorithm that constructs the decoupling as a circuit of SUM (qudit CNOT) and SWAP gates.
Sources
- Fault-tolerant quantum computation by anyons
- Topological quantum memory
- Topological Computation without Braiding
- Universal transversal gates with color codes - a simplified approach
- Unfolding the color code
- Single-shot fault-tolerant quantum error correction
- Single-Shot Decoding and Fault-tolerant Gates with Trivariate Tricycle Codes
- Multivariate Multicycle Codes for Complete Single-Shot Decoding
- Efficient color code decoders in $d\geq 2$ dimensions from toric code decoders
- Local unitary transformation, long-range quantum entanglement, wave function renormalization, and topological order
- Good Quantum Error-Correcting Codes Exist
- High-threshold and low-overhead fault-tolerant quantum memory
- Superselection Rigidity of Topological Calderbank--Shor--Steane Codes: From Koszul-Complex Models to Nonsplit Extensions
- Quantum orders in an exact soluble model
- Anyons in an exactly solved model and beyond
- Theory of weak symmetry breaking of translations in $\mathbb{Z}_2$ topologically ordered states and its relation to topological superconductivity from an exact lattice $\mathbb{Z}_2$ charge-flux attachment
- Universal topological phase of 2D stabilizer codes
- Structure of 2D Topological Stabilizer Codes
- Algebraic Methods for Quantum Codes on Lattices
- Classification of translation invariant topological Pauli stabilizer codes for prime dimensional qudits on two-dimensional lattices
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements