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:quant-ph/0609070 · Journal of Physics A Mathematical and Theoretical

Qudit surface codes and gauge theory with finite cyclic groups

Stephen S Bullock, Gavin K. Brennen

Published Mar 14, 2007• 68 citations
arXivHTMLPDF

Abstract

Surface codes describe quantum memory stored as a global property of interacting spins on a surface. The state space is fixed by a complete set of quasi-local stabilizer operators and the code dimension depends on the first homology group of the surface complex. These code states can be actively stabilized by measurements or, alternatively, can be prepared by cooling to the ground subspace of a quasi-local spin Hamiltonian. In the case of spin-1/2 (qubit) lattices, such ground states have been proposed as topologically protected memory for qubits. We extend these constructions to lattices or more generally cell complexes with qudits, either of prime level or of level d ℓ for d prime and ℓ ⩾ 0, and therefore under tensor decomposition, to arbitrary finite levels. The Hamiltonian describes an exact gauge theory whose excitations correspond to Abelian anyons. We provide protocols for qudit storage and retrieval and propose an interferometric verification of topological order by measuring quasi-particle statistics.

DOI
10.1088/1751-8113/40/13/013

Related papers

Qudit surface codes and gauge theory with finite cyclic groups

Bullock, S S, Gavin K. Brennen

Surface codes describe quantum memory stored as a global property of a surface cellulated by interacting spins. The state space is fixed by a complete set of quasi-local stabilizer operators and the code dimension depends on the first homology group of the surface complex. These code states can be actively stabilized by measurements or, alternatively, can be prepared by cooling to the ground subspace of a quasi-local spin Hamiltonian. In the case of spin-1/2 (qubit) lattices, such ground states have been proposed as topologically protected memory for qubits. We extend these constructions to lattices or more generally cell complexes with qudits, either of prime level or of level $d^\\ell$ for $d$ prime and $\\ell \\geq 0$, and therefore under tensor decomposition, to arbitrary finite levels. The Hamiltonian describes an exact $\\mathbb{Z}_d\\cong\\mathbb{Z}/d\\mathbb{Z}$ gauge theory whose excitations correspond to abelian anyons. We provide protocols for qudit storage and retrieval and propose an interferometric verification of topological order by measuring quasi-particle statistics.

•Sep 10, 2006•30 citations

Exact Recovery for Non-Abelian Surface Codes

Alison Warman, Nathanan Tantivasadakarn, Sakura Schafer-Nameki

We study exact recovery for non-Abelian topological surface codes based on the quantum double $D(G)$ of any finite group $G$. We determine an orthogonal error basis, that is comprised of group multiplication and irreducible representation operators. Whenever the errors are supported on closed loops on the lattice or dual lattice, there is a redundancy in the basis, due to stabilizers. To remedy this, we introduce a gauge-fixing that results in a complete and orthogonal error basis on the code space. Assuming as input predetermined, neutral correctable error clusters, we construct charge and flux transfer circuits that move the errors onto ancillas that then get projected out. This is an exact and deterministic recovery protocol, applicable to surface codes for any finite, in particular non-Abelian, group $G$.

quant-pharXiv:2610.03677•Oct 5, 2026•0 citations

Classification of translation invariant topological Pauli stabilizer codes for prime dimensional qudits on two-dimensional lattices

Jeongwan Haah

We prove that on any two-dimensional lattice of qudits of a prime dimension, every translation invariant Pauli stabilizer group with local generators and with the code distance being the linear system size is decomposed by a local Clifford circuit of constant depth into a finite number of copies of the toric code stabilizer group (Abelian discrete gauge theory). This means that under local Clifford circuits, the number of toric code copies is the complete invariant of topological Pauli stabilizer codes. Previously, the same conclusion was obtained under the assumption of nonchirality for qubit codes or the Calderbank–Shor–Steane structure for prime qudit codes; we do not assume any of these.

arXiv:1812.11193•Journal of Mathematical Physics•Jan 1, 2021•35 citations

Universal quantum computation with group surface codes

Naren Manjunath, Vieri Mattei, Apoorv Tiwari +1 more

We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be leveraged to perform non-Clifford gates in $\mathbb{Z}_2$ surface codes, thus enabling universal computation along with established means of performing logical Clifford gates. Moreover, for suitably chosen groups, we demonstrate that arbitrary reversible classical gates can be implemented transversally in the group surface code. We present the logical operations in terms of a set of elementary logical operations, which include transversal logical gates, a means of transferring encoded information into and out of group surface codes, and preparation and readout. By composing these elementary operations, we implement a wide variety of logical gates and provide a unified perspective on recent constructions in the literature for sliding group surface codes and preparing magic states. We furthermore use tensor networks inspired by ZX-calculus to construct spacetime implementations of the elementary operations. This spacetime perspective also allows us to establish explicit correspondences with topological gauge theories. Our work extends recent efforts in performing universal quantum computation in topological orders without the braiding of anyons, and shows how certain group surface codes allow us to bypass the restrictions set by the Bravyi-König theorem, which limits the computational power of topological Pauli stabilizer models.

quant-pharXiv:2603.05502•Mar 6, 2026•0 citations

Pauli Stabilizer Models of Twisted Quantum Doubles

Tyler D. Ellison, Yu-An Chen, Arpit Dua +3 more

We construct a Pauli stabilizer model for every two-dimensional Abelian topological order that admits a gapped boundary.Our primary example is a Pauli stabilizer model on four-dimensional qudits that belongs to the double semion (DS) phase of matter.The DS stabilizer Hamiltonian is constructed by condensing an emergent boson in a Z 4 toric code, where the condensation is implemented at the level of the ground states by two-body measurements.We rigorously verify the topological order of the DS stabilizer model by identifying an explicit finite-depth quantum circuit (with ancillary qubits) that maps its ground-state subspace to that of a DS string-net model.We show that the construction of the DS stabilizer Hamiltonian generalizes to all twisted quantum doubles (TQDs) with Abelian anyons.This yields a Pauli stabilizer code on composite-dimensional qudits for each such TQD, implying that the classification of topological Pauli stabilizer codes extends well beyond stacks of toric codes-in fact, exhausting all Abelian anyon theories that admit a gapped boundary.We also demonstrate that symmetry-protected topological phases of matter characterized by type-I and type-II cocycles can be modeled by Pauli stabilizer Hamiltonians by gauging certain 1-form symmetries of the TQD stabilizer models.

arXiv:2112.11394•PRX Quantum•Mar 30, 2022•54 citations

Binary Gauss Stabilizers for Abelian Lattice Gauge Theories

Matteo Turco, Luca Spagnoli, Alessandro Roggero

Gauge theories and quantum error-correcting codes share the same underlying structure: both use constraints to identify a specific subspace of the full Hilbert space. In quantum error correction, these constraints are known as stabilizers, while in gauge theories they correspond to Gauss law. In this work, we consider a family of discrete Abelian lattice gauge theories described by a $\mathbb{Z}_{N}$ gauge group with $N$ an arbitrary power of two. In this setting, we find a set of stabilizers for the gauge-invariant subspace which is an alternative to the Gauss operators, and we call them binary Gauss stabilizers. We use this alternative stabilizer group to build practical error-correcting codes exploiting the gauge symmetries of the system without the addition of extra qubits. The applications of our finding are not limited to error correction though. We also provide a new strategy of gauge fixing to remove the redundancies based on our alternative stabilizer, which might provide advantages with respect to already-existing approaches such as the axial gauge. Our results provide new tools to study lattice gauge theories and their quantum simulation, and opens directions for future work at the interface of lattice gauge theory and quantum information.

quant-pharXiv:2607.14861•Jul 17, 2026•0 citations
Surface codes describe quantum memory stored as a global property of interacting spins on a surface. The state space is fixed by a complete set of quasi-local stabilizer operators and the code dimension depends on the first homology group of the surface complex. These code states can be actively stabilized by measurements or, alternatively, can be prepared by cooling to the ground subspace of a quasi-local spin Hamiltonian. In the case of spin-1/2 (qubit) lattices, such ground states have been proposed as topologically protected memory for qubits. We extend these constructions to lattices or more generally cell complexes with qudits, either of prime level or of level d ℓ for d prime and ℓ ⩾ 0, and therefore under tensor decomposition, to arbitrary finite levels. The Hamiltonian describes an exact gauge theory whose excitations correspond to Abelian anyons. We provide protocols for qudit storage and retrieval and propose an interferometric verification of topological order by measuring quasi-particle statistics.
Surface codes describe quantum memory stored as a global property of a surface cellulated by interacting spins. The state space is fixed by a complete set of quasi-local stabilizer operators and the code dimension depends on the first homology group of the surface complex. These code states can be actively stabilized by measurements or, alternatively, can be prepared by cooling to the ground subspace of a quasi-local spin Hamiltonian. In the case of spin-1/2 (qubit) lattices, such ground states have been proposed as topologically protected memory for qubits. We extend these constructions to lattices or more generally cell complexes with qudits, either of prime level or of level $d^\\ell$ for ddd prime and ellgeq0\\ell \\geq 0ellgeq0, and therefore under tensor decomposition, to arbitrary finite levels. The Hamiltonian describes an exact mathbbZdcongmathbbZ/dmathbbZ\\mathbb{Z}_d\\cong\\mathbb{Z}/d\\mathbb{Z}mathbbZd​congmathbbZ/dmathbbZ gauge theory whose excitations correspond to abelian anyons. We provide protocols for qudit storage and retrieval and propose an interferometric verification of topological order by measuring quasi-particle statistics.
We study exact recovery for non-Abelian topological surface codes based on the quantum double D(G)D(G)D(G) of any finite group GGG. We determine an orthogonal error basis, that is comprised of group multiplication and irreducible representation operators. Whenever the errors are supported on closed loops on the lattice or dual lattice, there is a redundancy in the basis, due to stabilizers. To remedy this, we introduce a gauge-fixing that results in a complete and orthogonal error basis on the code space. Assuming as input predetermined, neutral correctable error clusters, we construct charge and flux transfer circuits that move the errors onto ancillas that then get projected out. This is an exact and deterministic recovery protocol, applicable to surface codes for any finite, in particular non-Abelian, group GGG.
We prove that on any two-dimensional lattice of qudits of a prime dimension, every translation invariant Pauli stabilizer group with local generators and with the code distance being the linear system size is decomposed by a local Clifford circuit of constant depth into a finite number of copies of the toric code stabilizer group (Abelian discrete gauge theory). This means that under local Clifford circuits, the number of toric code copies is the complete invariant of topological Pauli stabilizer codes. Previously, the same conclusion was obtained under the assumption of nonchirality for qubit codes or the Calderbank–Shor–Steane structure for prime qudit codes; we do not assume any of these.
We introduce group surface codes, which are a natural generalization of the Z2\mathbb{Z}_2Z2​ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be leveraged to perform non-Clifford gates in Z2\mathbb{Z}_2Z2​ surface codes, thus enabling universal computation along with established means of performing logical Clifford gates. Moreover, for suitably chosen groups, we demonstrate that arbitrary reversible classical gates can be implemented transversally in the group surface code. We present the logical operations in terms of a set of elementary logical operations, which include transversal logical gates, a means of transferring encoded information into and out of group surface codes, and preparation and readout. By composing these elementary operations, we implement a wide variety of logical gates and provide a unified perspective on recent constructions in the literature for sliding group surface codes and preparing magic states. We furthermore use tensor networks inspired by ZX-calculus to construct spacetime implementations of the elementary operations. This spacetime perspective also allows us to establish explicit correspondences with topological gauge theories. Our work extends recent efforts in performing universal quantum computation in topological orders without the braiding of anyons, and shows how certain group surface codes allow us to bypass the restrictions set by the Bravyi-König theorem, which limits the computational power of topological Pauli stabilizer models.
We construct a Pauli stabilizer model for every two-dimensional Abelian topological order that admits a gapped boundary.Our primary example is a Pauli stabilizer model on four-dimensional qudits that belongs to the double semion (DS) phase of matter.The DS stabilizer Hamiltonian is constructed by condensing an emergent boson in a Z 4 toric code, where the condensation is implemented at the level of the ground states by two-body measurements.We rigorously verify the topological order of the DS stabilizer model by identifying an explicit finite-depth quantum circuit (with ancillary qubits) that maps its ground-state subspace to that of a DS string-net model.We show that the construction of the DS stabilizer Hamiltonian generalizes to all twisted quantum doubles (TQDs) with Abelian anyons.This yields a Pauli stabilizer code on composite-dimensional qudits for each such TQD, implying that the classification of topological Pauli stabilizer codes extends well beyond stacks of toric codes-in fact, exhausting all Abelian anyon theories that admit a gapped boundary.We also demonstrate that symmetry-protected topological phases of matter characterized by type-I and type-II cocycles can be modeled by Pauli stabilizer Hamiltonians by gauging certain 1-form symmetries of the TQD stabilizer models.
Gauge theories and quantum error-correcting codes share the same underlying structure: both use constraints to identify a specific subspace of the full Hilbert space. In quantum error correction, these constraints are known as stabilizers, while in gauge theories they correspond to Gauss law. In this work, we consider a family of discrete Abelian lattice gauge theories described by a ZN\mathbb{Z}_{N}ZN​ gauge group with NNN an arbitrary power of two. In this setting, we find a set of stabilizers for the gauge-invariant subspace which is an alternative to the Gauss operators, and we call them binary Gauss stabilizers. We use this alternative stabilizer group to build practical error-correcting codes exploiting the gauge symmetries of the system without the addition of extra qubits. The applications of our finding are not limited to error correction though. We also provide a new strategy of gauge fixing to remove the redundancies based on our alternative stabilizer, which might provide advantages with respect to already-existing approaches such as the axial gauge. Our results provide new tools to study lattice gauge theories and their quantum simulation, and opens directions for future work at the interface of lattice gauge theory and quantum information.