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/9610023 · Physical Review A

Correcting quantum errors in higher spin systems

H. F. Chau

Published Feb 1, 1997• 40 citations
arXivHTMLPDF

Abstract

I consider the theory of the quantum error correcting code (QECC), where each quantum particle has more than two possible eigenstates. In this higher spin system, I report an explicit QECC that is related to the symmetry group ${\mathrm{Z}}_{2}^{\ensuremath{\bigotimes}(\mathrm{N}\mathrm{\ensuremath{-}}1)}$\ensuremath{\bigotimes}${\mathrm{S}}_{\mathrm{N}}$. This QECC, which generalizes Shor's simple majority vote code [Phys. Rev. A 52, 2493 (1995)], is able to correct errors arising from exactly one quantum particle. I also provide a simple encoding algorithm.

DOI
10.1103/physreva.55.r839

Related papers

Five quantum register error correction code for higher spin systems

H. F. Chau

I construct a quantum error correction code (QECC) in higher spin systems using the idea of multiplicative group character. Each $N$-state quantum particle is encoded as five $N$-state quantum registers. By doing so, this code can correct any quantum error arising from any one of the five quantum registers. This code generalizes the well-known five qubit perfect code in spin-1/2 systems and is shown to be optimal for higher spin systems. I also report a simple algorithm for encoding. The importance of multiplicative group character in constructing QECCs will be addressed.

arXiv:quant-ph/9702033•Physical Review A•Jul 1, 1997•47 citations

Algorithmic aspects of quantum error-correcting codes

Markus Grassl

Abstract We show how quantum algorithms for encoding and decoding of quantum error-correcting codes (QECC) can be derived from the underlying mathematical structure. For this, we first characterize general quantum error-correcting codes, followed by the discussion of CSS codes and additive quantum error-correcting codes. For the last two families, examples are given that illustrate the constructions.

Chapman & Hall/CRC eBooks•Feb 14, 2002•10 citations

Quantum Error Correcting Codes in Eigenstates of Translation-Invariant Spin Chains

Fernando G. S. L. Brandão, Elizabeth Crosson, M. Burak Şahinoğlu +1 more

Quantum error correction was invented to allow for fault-tolerant quantum computation. Systems with topological order turned out to give a natural physical realization of quantum error correcting codes (QECC) in their ground spaces. More recently, in the context of the anti-de Sitter/conformal field theory correspondence, it has been argued that eigenstates of CFTs with a holographic dual should also form QECCs. These two examples raise the question of how generally eigenstates of many-body models form quantum codes. In this Letter we establish new connections between quantum chaos and translation invariance in many-body spin systems, on one hand, and approximate quantum error correcting codes (AQECC), on the other hand. We first observe that quantum chaotic systems obeying the eigenstate thermalization hypothesis have eigenstates forming approximate quantum error-correcting codes. Then we show that AQECC can be obtained probabilistically from translation-invariant energy eigenstates of every translation-invariant spin chain, including integrable models. Applying this result to 1D classical systems, we describe a method for using local symmetries to construct parent Hamiltonians that embed these codes into the low-energy subspace of gapless 1D quantum spin chains. As explicit examples we obtain local AQECC in the ground space of the 1D ferromagnetic Heisenberg model and the Motzkin spin chain model with periodic boundary conditions, thereby yielding nonstabilizer codes in the ground space and low energy subspace of physically plausible 1D gapless models.

arXiv:1710.04631•Physical Review Letters•Sep 11, 2019•79 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

QUANTUM ERROR CORRECTION AND STABILIZER CODES

Artur Elezi

The goal of this paper is to provide a self contained detailed and rigorous mathematical introduction to some aspects of the quantum error-correcting codes and especially quantum stabilizer codes without venturing much, if at all, into the world of physics. While most of the results presented are not new, it is not easy to extract a precise mathematical formulation of results and to provide their rigorous proofs by reading the vast number of papers in the field, quite a few of which are written by computer scientists or physicists. It is this formulation and proofs - quite a few of of them new - that we present here. The connections between (a) quantum stabilizer codes and classical self-orthogonal codes and (b) between error correction and error detection have been established in details. Techniques from algebra of finite fields as well as representations of finite abelian groups have been employed here.

International Journal of Pure and Apllied Mathematics•Jan 1, 2015•0 citations

Entropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes

Markus Grassl, Felix Huber, Andreas Winter

We show that a relatively simple reasoning using von Neumann entropy inequalities yields a robust proof of the quantum Singleton bound for quantum error-correcting codes (QECC). For entanglement-assisted quantum error-correcting codes (EAQECC) and catalytic codes (CQECC), a type of generalized quantum Singleton bound [Brunet al., IEEE Trans. Inf. Theory 60(6):3073–3089 (2014)] was believed to hold for many years until recently one of us found a counterexample [MG, Phys. Rev. A 103, 020601 (2021)]. Here, we rectify this state of affairs by proving the correct generalized quantum Singleton bound, extending the above-mentioned proof method for QECC; we also prove information-theoretically tight bounds on the entanglement-communication tradeoff for EAQECC. All of the bounds relate block length$n$and code length$k$for given minimum distance$d$and we show that they are robust, in the sense that they hold with small perturbations for codes which only correct most of the erasure errors of less than$d$letters. In contrast to the classical case, the bounds take on qualitatively different forms depending on whether the minimum distance is smaller or larger than half the block length. We also provide a propagation rule: any pure QECC yields an EAQECC with the same distance and dimension, but of shorter block length.

arXiv:2010.07902•IEEE Transactions on Information Theory•Feb 7, 2022•83 citations
I consider the theory of the quantum error correcting code (QECC), where each quantum particle has more than two possible eigenstates. In this higher spin system, I report an explicit QECC that is related to the symmetry group Z2\ensuremath⨂(N\ensuremath−1){\mathrm{Z}}_{2}^{\ensuremath{\bigotimes}(\mathrm{N}\mathrm{\ensuremath{-}}1)}Z2\ensuremath⨂(N\ensuremath−1)​\ensuremath{\bigotimes}SN{\mathrm{S}}_{\mathrm{N}}SN​. This QECC, which generalizes Shor's simple majority vote code [Phys. Rev. A 52, 2493 (1995)], is able to correct errors arising from exactly one quantum particle. I also provide a simple encoding algorithm.
I construct a quantum error correction code (QECC) in higher spin systems using the idea of multiplicative group character. Each NNN-state quantum particle is encoded as five NNN-state quantum registers. By doing so, this code can correct any quantum error arising from any one of the five quantum registers. This code generalizes the well-known five qubit perfect code in spin-1/2 systems and is shown to be optimal for higher spin systems. I also report a simple algorithm for encoding. The importance of multiplicative group character in constructing QECCs will be addressed.
Quantum error correction was invented to allow for fault-tolerant quantum computation. Systems with topological order turned out to give a natural physical realization of quantum error correcting codes (QECC) in their ground spaces. More recently, in the context of the anti-de Sitter/conformal field theory correspondence, it has been argued that eigenstates of CFTs with a holographic dual should also form QECCs. These two examples raise the question of how generally eigenstates of many-body models form quantum codes. In this Letter we establish new connections between quantum chaos and translation invariance in many-body spin systems, on one hand, and approximate quantum error correcting codes (AQECC), on the other hand. We first observe that quantum chaotic systems obeying the eigenstate thermalization hypothesis have eigenstates forming approximate quantum error-correcting codes. Then we show that AQECC can be obtained probabilistically from translation-invariant energy eigenstates of every translation-invariant spin chain, including integrable models. Applying this result to 1D classical systems, we describe a method for using local symmetries to construct parent Hamiltonians that embed these codes into the low-energy subspace of gapless 1D quantum spin chains. As explicit examples we obtain local AQECC in the ground space of the 1D ferromagnetic Heisenberg model and the Motzkin spin chain model with periodic boundary conditions, thereby yielding nonstabilizer codes in the ground space and low energy subspace of physically plausible 1D gapless 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.
The goal of this paper is to provide a self contained detailed and rigorous mathematical introduction to some aspects of the quantum error-correcting codes and especially quantum stabilizer codes without venturing much, if at all, into the world of physics. While most of the results presented are not new, it is not easy to extract a precise mathematical formulation of results and to provide their rigorous proofs by reading the vast number of papers in the field, quite a few of which are written by computer scientists or physicists. It is this formulation and proofs - quite a few of of them new - that we present here. The connections between (a) quantum stabilizer codes and classical self-orthogonal codes and (b) between error correction and error detection have been established in details. Techniques from algebra of finite fields as well as representations of finite abelian groups have been employed here.
We show that a relatively simple reasoning using von Neumann entropy inequalities yields a robust proof of the quantum Singleton bound for quantum error-correcting codes (QECC). For entanglement-assisted quantum error-correcting codes (EAQECC) and catalytic codes (CQECC), a type of generalized quantum Singleton bound [Brunet al., IEEE Trans. Inf. Theory 60(6):3073–3089 (2014)] was believed to hold for many years until recently one of us found a counterexample [MG, Phys. Rev. A 103, 020601 (2021)]. Here, we rectify this state of affairs by proving the correct generalized quantum Singleton bound, extending the above-mentioned proof method for QECC; we also prove information-theoretically tight bounds on the entanglement-communication tradeoff for EAQECC. All of the bounds relate block lengthnnnand code lengthkkkfor given minimum distancedddand we show that they are robust, in the sense that they hold with small perturbations for codes which only correct most of the erasure errors of less thandddletters. In contrast to the classical case, the bounds take on qualitatively different forms depending on whether the minimum distance is smaller or larger than half the block length. We also provide a propagation rule: any pure QECC yields an EAQECC with the same distance and dimension, but of shorter block length.