Exact Recovery for Non-Abelian Surface Codes
quant-ph, cond-mat.str-el, hep-th, math.QA
Submitted: 2026-10-02
Updated: 2026-10-02
Comments: 22 pages
License: http://creativecommons.org/licenses/by/4.0/
The gist: We study exact recovery for non-Abelian topological surface codes based on the quantum double D(G) of any finite group G.
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.
Sources
- Fault-tolerant quantum computation by anyons
- Classification of topologically protected gates for local stabilizer codes
- Magic state cultivation: growing T states as cheap as CNOT gates
- Long-range entanglement from measuring symmetry-protected topological phases
- Efficiently preparing Schr\"odinger's cat, fractons and non-Abelian topological order in quantum devices
- Adaptive constant-depth circuits for manipulating non-abelian anyons
- Shortest Route to Non-Abelian Topological Order on a Quantum Processor
- Hierarchy of topological order from finite-depth unitaries, measurement and feedforward
- Non-Abelian Topological Order and Anyons on a Trapped-Ion Processor
- Universal Gates from Braiding and Fusing Anyons on Quantum Hardware
- Universal fault tolerant quantum computation in 2D without getting tied in knots
- Generating logical magic states with the aid of non-Abelian topological order
- Hybrid Lattice Surgery: Non-Clifford Gates via Non-Abelian Surface Codes
- Universal quantum computation with group surface codes
- Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic
- Constant-Depth Clifford-Hierarchy Gates via Non-Abelian Surface Codes
- Clifford-hierarchy stabilizer formalism with applications to twisted quantum doubles
- High-threshold decoding of non-Pauli codes for 2D universality
- Kitaev's quantum double model as an error correcting code
- Mixed-state topological order and error-correction thresholds in non-Abelian codes: rigorous results
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians