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

Exact Recovery for Non-Abelian Surface Codes

Alison Warman, Nathanan Tantivasadakarn, Sakura Schafer-Nameki

quant-phcond-mat.str-elhep-thmath.QASubmitted Oct 2, 2026• Announced Oct 5, 2026• 3 citations
arXivHTMLPDF

Abstract

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$.

AI Summary

The paper addresses explicit recovery for Kitaev quantum-double surface codes $D(G)$ for arbitrary finite groups, including non-Abelian and non-solvable groups. It assumes that neutral, correctable error clusters have already been identified and constructs recovery circuits for errors within those supplied supports. The construction starts from a single-edge orthogonal operator basis $E^{h,\mu}=L^h\sqrt{d_\Gamma}Z^\Gamma_{ab}$, combining group multiplication with irreducible-representation matrix elements. Vertex and plaquette constraints create redundancies on multi-edge supports. A gauge-fixing procedure removes multiplication labels and representation labels on selected edges. For a completed, bulk support of $N$ edges, the resulting family has $|G|^{2N-|\vec i_A|-|\vec i_B|}$ elements. The paper proves completeness and an identity Knill–Laflamme matrix for supports carrying no logical operator, using stabilizer identities, Schur orthogonality, and checks incident on a single remaining error. Recovery first transfers multiplication errors to plaquette ancillas through controlled-holonomy circuits, then transfers representation errors to vertex ancillas through controlled vertex operations and group multiplication. Each free label is transferred to one $|G|$-dimensional ancilla, restoring the encoded state exactly. Related constructions treat ribbon errors using two ancillas per ribbon. The protocol assumes perfect operations and syndrome measurements. Identifying neutral clusters, integrating recovery with a decoder, establishing thresholds for particular noise models, and handling measurement errors remain open. Recovery proceeds sequentially inward through clusters, so circuit depth can grow with cluster size; no size-independent-depth recovery or complete fault-tolerant decoding scheme is established.

No sign of AI-generated textStrong assumptionsOverclaims

Error found: The displayed gauge-fixed family and Knill–Laflamme theorem do not consistently implement the boundary-label reduction that the paper itself identifies, and retaining the displayed G-irrep labels gives nonorthogonal errors on rough boundary edges. For a proper-subgroup boundary K, the proposed unrestricted vertex gauge fixing and full-G charge-transfer derivation are not justified by the available K-only stabilizer invariance.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
22 pages

Related papers

Qudit surface codes and gauge theory with finite cyclic groups

Stephen S Bullock, Gavin K. Brennen

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.

arXiv:quant-ph/0609070•Journal of Physics A Mathematical and Theoretical•Mar 14, 2007•81 citations

Engineering logical gates with irrep surface codes

Yabo Li, Zijian Song, Vieri Mattei +3 more

Fault-tolerant quantum computation can incur a substantial resource cost when a desired logical operation must be constructed from a restricted set of logical primitives. To make such operations directly available, we introduce irrep surface codes (ISCs), two-dimensional topological quantum error-correcting codes engineered to transversally implement a prescribed set of logical gates. The target logical gates only need to satisfy two conditions: (i) they generate a finite group, which, up to global phases, is forced by the Eastin-Knill theorem, and (ii) they are irreducible, meaning that any operator commuting with the set of gates must be proportional to the identity. This accommodates arbitrary finite groups of diagonal gates and arbitrary reversible classical gates, since each can be embedded into a larger irreducible finite group of gates. It also enables logical gates outside every finite level of the Clifford hierarchy. To incorporate these operations into surface-code computations, we further develop lattice-surgery protocols to transfer the encoded information between surface codes and ISCs obeying one of two sufficient conditions. Together, these results establish a systematic method for tailoring topological codes to desired logical operations and integrating them into conventional computations.

quant-pharXiv:2610.06775•Oct 6, 2026•2 citations

Non-Pauli topological stabilizer codes from twisted quantum doubles

Julio Carlos Magdalena de la Fuente, Nicolas Tarantino, Jens Eisert

It has long been known that long-ranged entangled topological phases can be exploited to protect quantum information against unwanted local errors. Indeed, conditions for intrinsic topological order are reminiscent of criteria for faithful quantum error correction. At the same time, the promise of using general topological orders for practical error correction remains largely unfulfilled to date. In this work, we significantly contribute to establishing such a connection by showing that Abelian twisted quantum double models can be used for quantum error correction. By exploiting the group cohomological data sitting at the heart of these lattice models, we transmute the terms of these Hamiltonians into full-rank, pairwise commuting operators, defining commuting stabilizers. The resulting codes are defined by non-Pauli commuting stabilizers, with local systems that can either be qubits or higher dimensional quantum systems. Thus, this work establishes a new connection between condensed matter physics and quantum information theory, and constructs tools to systematically devise new topological quantum error correcting codes beyond toric or surface code models.

arXiv:2001.11516•Quantum•Feb 17, 2021•14 citations

Non-Pauli topological stabilizer codes from twisted quantum doubles

Julio C. Magdalena de la Fuente, Nicolas Tarantino, Jens Eisert

It has long been known that long-ranged entangled topological phases can be exploited to protect quantum information against unwanted local errors. Indeed, conditions for intrinsic topological order are reminiscent of criteria for faithful quantum error correction. At the same time, the promise of using general topological orders for practical error correction remains largely unfulfilled to date. In this work, we significantly contribute to establishing such a connection by showing that Abelian twisted quantum double models can be used for quantum error correction. By exploiting the group cohomological data sitting at the heart of these lattice models, we transmute the terms of these Hamiltonians into full-rank, pairwise commuting operators, defining commuting stabilizers. The resulting codes are defined by commuting non-Pauli stabilizers, with local systems that can either be qubits or higher dimensional quantum systems. Thus, this work establishes a new connection between condensed matter physics and quantum information theory, and constructs tools to systematically devise new topological quantum error correcting codes beyond toric or surface code models.

•Jan 1, 2021•11 citations

Error Correction in Lattice Quantum Electrodynamics with Quantum Reference Frames

Elias Rothlin, Carla Ferradini, Lin-Qing Chen

Is gauge symmetry merely a redundancy in our description, or does it carry a deeper information-theoretic significance? Quantum error-correcting codes (QECCs) show that redundancy can serve as a resource for protecting information against noise. In this work, we ask whether gauge theories can be understood in similar terms, and make this idea concrete in lattice quantum electrodynamics (QED), building on and extending earlier works that established a bridge between gauge systems, stabilizer codes, and quantum reference frames (QRFs). For Abelian gauge groups, we show that explicit recovery operations can be constructed using group-theoretical methods for error sets determined by both ideal and non-ideal QRFs. Applied to lattice QED, this yields two QECC structures: one in the pure-gauge sector and one including fermions. We construct a gauge-field QRF based on spanning trees of the lattice and a fermionic field QRF from the matter field, thereby making explicit how physical information is encoded. While the syndromes of gauge-violating errors associated with constraint measurements are generically degenerate, QRFs resolve this degeneracy and single out families of correctable errors. This establishes lattice QED as a QECC beyond the stabilizer setting and shows concretely how gauge symmetry provides an encoding structure that supports error correction.

quant-pharXiv:2604.06149•Apr 8, 2026•7 citations

Non-invertible Lattice 1-Form Symmetries for Non-Abelian Topological Order

Rafael Flores-Calderón, Frank Pollmann, Michael Knap

Higher-form symmetries generalize conventional global symmetries and act on lower-dimensional submanifolds of a quantum system. While Abelian topological phases can be organized by 1-form symmetries that form a group, non-Abelian topological phases based on finite groups require 1-form symmetry operators governed by non-invertible fusion algebras. In this work, we make this statement precise in quantum double lattice models $\mathcal D(G)$ for finite non-Abelian groups $G$. We construct the electric, magnetic, and dyonic 1-form operators directly at the lattice fixed point and show that together they form a complete nonlocal diagnostic algebra for the topological Hilbert space. Using these operators, we explicitly determine the cylinder and torus ground-state subspaces for arbitrary finite $G$. Furthermore, we calculate the microscopic fusion and gluing of the 1-form symmetries and show that their topological deformation properties emerge after projection to the defect-free topological subspace. Our results establish ground states of non-Abelian quantum double models as a concrete microscopic realization of spontaneous non-invertible 1-form symmetry breaking and provide an operator language that may be useful for characterizing such states in quantum processors.

cond-mat.str-elCross-listedarXiv:2608.16520•Aug 18, 2026•1 citation
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.
The paper addresses explicit recovery for Kitaev quantum-double surface codes D(G)D(G)D(G) for arbitrary finite groups, including non-Abelian and non-solvable groups. It assumes that neutral, correctable error clusters have already been identified and constructs recovery circuits for errors within those supplied supports.
The construction starts from a single-edge orthogonal operator basis Eh,μ=LhdΓZabΓE^{h,\mu}=L^h\sqrt{d_\Gamma}Z^\Gamma_{ab}Eh,μ=LhdΓ​​ZabΓ​, combining group multiplication with irreducible-representation matrix elements. Vertex and plaquette constraints create redundancies on multi-edge supports. A gauge-fixing procedure removes multiplication labels and representation labels on selected edges. For a completed, bulk support of NNN edges, the resulting family has ∣G∣2N−∣i⃗A∣−∣i⃗B∣|G|^{2N-|\vec i_A|-|\vec i_B|}∣G∣2N−∣iA​∣−∣iB​∣ elements. The paper proves completeness and an identity Knill–Laflamme matrix for supports carrying no logical operator, using stabilizer identities, Schur orthogonality, and checks incident on a single remaining error.
Recovery first transfers multiplication errors to plaquette ancillas through controlled-holonomy circuits, then transfers representation errors to vertex ancillas through controlled vertex operations and group multiplication. Each free label is transferred to one ∣G∣|G|∣G∣-dimensional ancilla, restoring the encoded state exactly. Related constructions treat ribbon errors using two ancillas per ribbon.
The protocol assumes perfect operations and syndrome measurements. Identifying neutral clusters, integrating recovery with a decoder, establishing thresholds for particular noise models, and handling measurement errors remain open. Recovery proceeds sequentially inward through clusters, so circuit depth can grow with cluster size; no size-independent-depth recovery or complete fault-tolerant decoding scheme is established.
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.
Fault-tolerant quantum computation can incur a substantial resource cost when a desired logical operation must be constructed from a restricted set of logical primitives. To make such operations directly available, we introduce irrep surface codes (ISCs), two-dimensional topological quantum error-correcting codes engineered to transversally implement a prescribed set of logical gates. The target logical gates only need to satisfy two conditions: (i) they generate a finite group, which, up to global phases, is forced by the Eastin-Knill theorem, and (ii) they are irreducible, meaning that any operator commuting with the set of gates must be proportional to the identity. This accommodates arbitrary finite groups of diagonal gates and arbitrary reversible classical gates, since each can be embedded into a larger irreducible finite group of gates. It also enables logical gates outside every finite level of the Clifford hierarchy. To incorporate these operations into surface-code computations, we further develop lattice-surgery protocols to transfer the encoded information between surface codes and ISCs obeying one of two sufficient conditions. Together, these results establish a systematic method for tailoring topological codes to desired logical operations and integrating them into conventional computations.
It has long been known that long-ranged entangled topological phases can be exploited to protect quantum information against unwanted local errors. Indeed, conditions for intrinsic topological order are reminiscent of criteria for faithful quantum error correction. At the same time, the promise of using general topological orders for practical error correction remains largely unfulfilled to date. In this work, we significantly contribute to establishing such a connection by showing that Abelian twisted quantum double models can be used for quantum error correction. By exploiting the group cohomological data sitting at the heart of these lattice models, we transmute the terms of these Hamiltonians into full-rank, pairwise commuting operators, defining commuting stabilizers. The resulting codes are defined by non-Pauli commuting stabilizers, with local systems that can either be qubits or higher dimensional quantum systems. Thus, this work establishes a new connection between condensed matter physics and quantum information theory, and constructs tools to systematically devise new topological quantum error correcting codes beyond toric or surface code models.
It has long been known that long-ranged entangled topological phases can be exploited to protect quantum information against unwanted local errors. Indeed, conditions for intrinsic topological order are reminiscent of criteria for faithful quantum error correction. At the same time, the promise of using general topological orders for practical error correction remains largely unfulfilled to date. In this work, we significantly contribute to establishing such a connection by showing that Abelian twisted quantum double models can be used for quantum error correction. By exploiting the group cohomological data sitting at the heart of these lattice models, we transmute the terms of these Hamiltonians into full-rank, pairwise commuting operators, defining commuting stabilizers. The resulting codes are defined by commuting non-Pauli stabilizers, with local systems that can either be qubits or higher dimensional quantum systems. Thus, this work establishes a new connection between condensed matter physics and quantum information theory, and constructs tools to systematically devise new topological quantum error correcting codes beyond toric or surface code models.
Is gauge symmetry merely a redundancy in our description, or does it carry a deeper information-theoretic significance? Quantum error-correcting codes (QECCs) show that redundancy can serve as a resource for protecting information against noise. In this work, we ask whether gauge theories can be understood in similar terms, and make this idea concrete in lattice quantum electrodynamics (QED), building on and extending earlier works that established a bridge between gauge systems, stabilizer codes, and quantum reference frames (QRFs). For Abelian gauge groups, we show that explicit recovery operations can be constructed using group-theoretical methods for error sets determined by both ideal and non-ideal QRFs. Applied to lattice QED, this yields two QECC structures: one in the pure-gauge sector and one including fermions. We construct a gauge-field QRF based on spanning trees of the lattice and a fermionic field QRF from the matter field, thereby making explicit how physical information is encoded. While the syndromes of gauge-violating errors associated with constraint measurements are generically degenerate, QRFs resolve this degeneracy and single out families of correctable errors. This establishes lattice QED as a QECC beyond the stabilizer setting and shows concretely how gauge symmetry provides an encoding structure that supports error correction.
Higher-form symmetries generalize conventional global symmetries and act on lower-dimensional submanifolds of a quantum system. While Abelian topological phases can be organized by 1-form symmetries that form a group, non-Abelian topological phases based on finite groups require 1-form symmetry operators governed by non-invertible fusion algebras. In this work, we make this statement precise in quantum double lattice models D(G)\mathcal D(G)D(G) for finite non-Abelian groups GGG. We construct the electric, magnetic, and dyonic 1-form operators directly at the lattice fixed point and show that together they form a complete nonlocal diagnostic algebra for the topological Hilbert space. Using these operators, we explicitly determine the cylinder and torus ground-state subspaces for arbitrary finite GGG. Furthermore, we calculate the microscopic fusion and gluing of the 1-form symmetries and show that their topological deformation properties emerge after projection to the defect-free topological subspace. Our results establish ground states of non-Abelian quantum double models as a concrete microscopic realization of spontaneous non-invertible 1-form symmetry breaking and provide an operator language that may be useful for characterizing such states in quantum processors.