Homological quantum error correction uses tools of algebraic topology and homological algebra to derive Calderbank-Shor-Steane quantum error correcting codes from cellulations of topological spaces. This work is an exploration of the relevant topics, a journey from classical error correction, through homology theory, to CSS codes acting on qudit systems. Qudit codes have torsion in their logical spaces. This is interesting to study because it gives us extra logical qudits, of possibly different dimension. Apart from examples and comments on the topic, we prove an original result, the Structure Theorem for the Qudit Logical Space, an application of the Universal Coefficient Theorem from homological algebra, which gives us information about the logical space when torsion is involved, and that improves on a previous result in the literature. Furthermore, this work introduces our own abstracted and restricted version of the general notion of a cell complex, suited exactly to our needs.
The gauge field formalism, or operator-valued cochain formalism, has recently emerged as a powerful framework for describing quantum Calderbank-Shor-Steane (CSS) codes. In this work, we extend this framework to construct a broad class of logical gates for general CSS codes, including the S, Hadamard, T, and (multi)controlled-Z gates, under the condition where fault-tolerance or circuit-depth optimality is not necessarily imposed. We show that these logical gates can be expressed as exponentials of polynomial functions of the electric and magnetic gauge fields, which allows us to derive explicit decompositions into physical gates. We further prove that their logical action depends only on the (co)homology classes of the corresponding logical qubits, establishing consistency as logical operations. Our results provide a systematic method for formulating logical gates for general CSS codes, offering new insights into the interplay between quantum error correction, algebraic topology, and quantum field theory.
We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming bound. In the quantum case, we show that for non-orientable surfaces it is impossible to construct homological codes based on qudits of dimension
D>2, while for orientable surfaces with boundaries it is possible to construct them for arbitrary dimension
D. We give a method to obtain planar homological codes based on the construction of quantum codes on compact surfaces without boundaries. We show how the original Shor's 9-qubit code can be visualized as a homological quantum code. We study the problem of constructing quantum codes with optimal encoding rate. In the particular case of toric codes we construct an optimal family and give an explicit proof of its optimality. For homological quantum codes on surfaces of arbitrary genus we also construct a family of codes asymptotically attaining the maximum possible encoding rate. We provide the tools of homology group theory for graphs embedded on surfaces in a self-contained manner.
We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming bound. In the quantum case, we show that for nonorientable surfaces it is impossible to construct homological codes based on qudits of dimension D>2, while for orientable surfaces with boundaries it is possible to construct them for arbitrary dimension D. We give a method to obtain planar homological codes based on the construction of quantum codes on compact surfaces without boundaries. We show how the original Shor’s 9-qubit code can be visualized as a homological quantum code. We study the problem of constructing quantum codes with optimal encoding rate. In the particular case of toric codes we construct an optimal family and give an explicit proof of its optimality. For homological quantum codes on surfaces of arbitrary genus we also construct a family of codes asymptotically attaining the maximum possible encoding rate. We provide the tools of homology group theory for graphs embedded on surfaces in a self-contained manner.
We study the algebraic compatibility between quantum homomorphic encryption and stabilizer quantum error correction in an honest-but-curious model, restricting the encryption to the transversal block-Pauli mask
(XaZb)⊗n controlled by two secret key bits
a and
b. We prove a necessary and sufficient criterion for an
[[n,1,d]] stabilizer code to remain compatible with this mask, namely that the transversal
X and
Z operators commute with every stabilizer generator, and we specialize it to a classical-code criterion for Calderbank--Shor--Steane codes. Combining code-space preservation with the logical action of the mask, every stabilizer code falls, with respect to each of the two transversal mask operators, into exactly one of three classes: incompatible, compatible but trivially acting, or compatible with a nontrivial logical Pauli action; the two operators need not fall into the same class. We verify this classification by exact symplectic computation for rotated and planar surface codes, toric codes, triangular and toric color codes, the
[[15,1,3]] code and several small codes, and find that the class is fixed by the lattice size and the boundary presentation rather than by the topological phase: the surface-code family realizes all three classes, whereas color codes realize only the two compatible ones. For encrypted computation we show that the Shor code does not implement the logical
T gate by a transversal
T⊗9, whereas suitable triorthogonal codes do so up to a Clifford correction. We formulate logical-Pauli masking as a code-independent algebraic template. Syndrome extraction and recovery are key-independent whenever the mask preserves the code space, so that the client only needs the block size and the class of the code to decrypt.
Quantum error correction (QEC) is crucial for realizing scalable quantum technologies, and topological quantum error correction (TQEC) has emerged as the most experimentally advanced paradigm of QEC. Existing homological and topological code constructions, however, are largely confined to orientable two-manifolds with simple boundary conditions. In this work, we develop a unified algebraic-topological framework for TQEC based on homology, cohomology, and intersection theory, which characterizes exactly when an arbitrary-dimensional manifold (with or without boundary) can serve as a quantum memory, thereby extending the standard 2D homological-code picture to arbitrary dimension and to manifolds with boundary via Poincaré-Lefschetz duality. Building on this classification, we introduce concrete code families that exploit nontrivial topology beyond the planar and toric settings. These include ``3-torus code'' and higher-dimensional ``volume codes'' on compact manifolds with mixed
X- and
Z-type boundaries. We further give a topological construction of qudit TQEC codes on general two-dimensional cell complexes using group presentation complexes, which unifies and extends several known quantum LDPC and homological-product-like constructions within a single geometric language. Finally, we combine the theoretical framework with numerical simulations to demonstrate that changing only the global topology can yield improved logical performance at fixed entanglement resources. Taken together, our results provide a systematic set of topological design principles for constructing and analyzing TQEC codes across dimensions and boundaries, and they open new avenues for topology-aware fault-tolerant quantum architectures.
Calderbank-Shor-Steane (CSS) codes are a versatile quantum error-correcting family built out of commuting
X- and
Z-type checks. We introduce CSS-like codes on
G-valued qudits for any finite group
G that reduce to qubit CSS codes for
G=Z2 yet generalize the Kitaev quantum double model for general groups. The
X-checks of our group-CSS codes correspond to left and/or right multiplication by group elements, while
Z-checks project onto solutions to group word equations. We describe quantum-double models on oriented two-dimensional CW complexes (which need not cellulate a manifold) and prove that, when
G is non-Abelian and simple, every
G-covariant group-CSS code with suitably upper-bounded
Z-check weight and lower-bounded
Z-distance reduces to a CW quantum double. We describe the codespace and logical operators of CW quantum doubles via the same intuition used to obtain logical structure of surface codes. We obtain distance bounds for codes on non-Abelian simple groups from the graph underlying the CW complex, and construct intrinsically non-Abelian code families with asymptotically optimal rate and distances. Adding "ghost vertices" to the CW complex generalizes quantum double models with defects and rough boundary conditions whose logical structure can be understood without reference to non-Abelian anyons or defects. Several non-invertible symmetry-protected topological states, both with ordinary and higher-form symmetries, are the unique codewords of simply-connected CW quantum doubles with a single ghost vertex.