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

Quantum codes are quantized codes: Stabilizer codes from quantization over finite fields

Michael Zurel

quant-phSubmitted Oct 5, 2026• Announced Oct 6, 2026• 0 citations
arXivHTMLPDF

Abstract

We present a discrete analogue of geometric quantization over finite fields which, when applied to certain classical error-correcting codes, yields quantum error-correcting codes. This provides a physical interpretation for a previously known quantum-classical correspondence in coding theory.
Comments
9 pages

Related papers

An Introduction to Quantum Error Correction

Daniel Gottesman

Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences from the theory of classical error-correcting codes. Many quantum codes can be described in terms of the stabilizer of the codewords. The stabilizer is a finite Abelian group, and allows a straightforward characterization of the error-correcting properties of the code. The stabilizer formalism for quantum codes also illustrates the relationships to classical coding theory, particularly classical codes over GF(4), the finite field with four elements.

arXiv:quant-ph/0004072•Apr 18, 2000•77 citations

A Theory of the Quantum Error-Correcting Codes

Fang Li

Quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error correcting codes has some close ties to and some striking differences from the theory of classical error correcting codes. Many quantum codes can be described in terms of the stabilizer of the codewords. The stabilizer is a finite Abelian group, Clifford codes are stabilizer codes.

Journalof Southwest China Normal University•Jan 1, 2001•18 citations

The geometry of quantum stabiliser codes

Aina Centelles

The aim of this project is to bring together quantum error-correcting codes theory and the study of finite geometries. A quantum code is used to protect quantum information from errors that may occur due to quantum decoherence. We give a geometric interpretation of the codes as sets of lines in certain finite projective spaces. We exploit the geometric aspect of codes to rewrite proofs in a more intuitive way and explore their properties through visualization. Some examples of stabiliser codes and their associated quantum sets of lines are presented. We also discuss how to build nonadditive codes as the union of stabiliser codes. Finite geometry has proved to be a powerful tool to work on quantum error-correcting codes. Some of its applications include finding new codes or proving the non-existence of codes with certain parameters.

•May 1, 2020•0 citations

Quantum Reed-Solomon Codes

Markus Grassl, Willi Geiselmann, Thomas Beth +1 more

. We introduce a new class of quantum error--correcting codes derived from (classical) Reed--Solomon codes over finite fields of characteristic two. Quantum circuits for encoding and decoding based on the discrete cyclic Fourier transform over finite fields are presented. 1 Introduction During the last years it has been shown that computers taking advantage of quantum mechanical phenomena outperform currently used computers. The striking examples are integer factoring in polynomial time (see [18]) and finding pre--images of an n--ary Boolean function ("searching") in time O( p 2 n ) (see [12]). Quantum computers are not only of theoretical nature---there are several suggestions how to physically realize them (see, e. g., [6, 7]). On the way towards building a quantum computer, one very important problem is to stabilize quantum mechanical systems since they are very vulnerable. A theory of quantum error--correcting codes has already been established (see [15]). Nevertheless, the pr...

•Jan 1, 1999•73 citations

Algebraic quantum codes: linking quantum mechanics and discrete mathematics

Markus Grassl

We discuss the connection between quantum error-correcting codes (QECCS) and algebraic coding theory. We start with an introduction to the relevant concepts of quantum mechanics, including the general error model. A quantum error-correcting code is a subspace of a complex Hilbert space, and its error-correcting properties are characterized by the Knill-Laflamme conditions. Using the stabilizer formalism, we illustrate how QECCs for can be constructed using techniques from algebraic coding theory. We also sketch how the information obtained via a quantum measurement can be interpreted as syndrome of the related classical code. Additionally, we present secondary constructions for QECCs, leading to propagation rules for the parameters of QECCs. This includes the puncture code by Rains and construction X for quantum codes.

arXiv:2011.06996•International Journal of Computer Mathematics Computer Systems Theory•Nov 17, 2020•21 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
Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences from the theory of classical error-correcting codes. Many quantum codes can be described in terms of the stabilizer of the codewords. The stabilizer is a finite Abelian group, and allows a straightforward characterization of the error-correcting properties of the code. The stabilizer formalism for quantum codes also illustrates the relationships to classical coding theory, particularly classical codes over GF(4), the finite field with four elements.
The aim of this project is to bring together quantum error-correcting codes theory and the study of finite geometries. A quantum code is used to protect quantum information from errors that may occur due to quantum decoherence. We give a geometric interpretation of the codes as sets of lines in certain finite projective spaces. We exploit the geometric aspect of codes to rewrite proofs in a more intuitive way and explore their properties through visualization. Some examples of stabiliser codes and their associated quantum sets of lines are presented. We also discuss how to build nonadditive codes as the union of stabiliser codes. Finite geometry has proved to be a powerful tool to work on quantum error-correcting codes. Some of its applications include finding new codes or proving the non-existence of codes with certain parameters.
. We introduce a new class of quantum error--correcting codes derived from (classical) Reed--Solomon codes over finite fields of characteristic two. Quantum circuits for encoding and decoding based on the discrete cyclic Fourier transform over finite fields are presented. 1 Introduction During the last years it has been shown that computers taking advantage of quantum mechanical phenomena outperform currently used computers. The striking examples are integer factoring in polynomial time (see [18]) and finding pre--images of an n--ary Boolean function ("searching") in time O( p 2 n ) (see [12]). Quantum computers are not only of theoretical nature---there are several suggestions how to physically realize them (see, e. g., [6, 7]). On the way towards building a quantum computer, one very important problem is to stabilize quantum mechanical systems since they are very vulnerable. A theory of quantum error--correcting codes has already been established (see [15]). Nevertheless, the pr...
We discuss the connection between quantum error-correcting codes (QECCS) and algebraic coding theory. We start with an introduction to the relevant concepts of quantum mechanics, including the general error model. A quantum error-correcting code is a subspace of a complex Hilbert space, and its error-correcting properties are characterized by the Knill-Laflamme conditions. Using the stabilizer formalism, we illustrate how QECCs for can be constructed using techniques from algebraic coding theory. We also sketch how the information obtained via a quantum measurement can be interpreted as syndrome of the related classical code. Additionally, we present secondary constructions for QECCs, leading to propagation rules for the parameters of QECCs. This includes the puncture code by Rains and construction X for quantum codes.
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.