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

Series on coding theory and cryptology

Quantum Error-Correcting Codes from Algebraic Curves

Jon-Lark Kim, Gretchen L. Matthews

Published Oct 1, 2008• 14 citations
Publisher

Abstract

This chapter discusses quantum error-correcting codes constructed from algebraic curves. We give an introduction to quantum coding theory including bounds on quantum codes. We describe stabilizer codes which are the quantum analog of classical linear codes and discuss the binary and q-ary CSS construction. Then we focus on quantum codes from algebraic curves including the projective line, Hermitian curves, and hyperelliptic curves. In addition, we describe the asymptotic behaviors of quantum codes from the Garcia-Stichtenoth tower attaining the Drinfeld-Vlăduţ bound.

DOI
10.1142/9789812794017_0012

Related papers

New families of quantum stabilizer codes from Hermitian self-orthogonal algebraic geometry codes

Lin Sok

There has been a lot of effort to construct good quantum codes from the classical error correcting codes. Constructing new quantum codes, using Hermitian self-orthogonal codes, seems to be a difficult problem in general. In this paper, Hermitian self-orthogonal codes are studied from algebraic function fields. Sufficient conditions for the Hermitian self-orthogonality of an algebraic geometry code are presented. New Hermitian self-orthogonal codes are constructed from projective lines, elliptic curves, hyper-elliptic curves, Hermitian curves, and Artin-Schreier curves. In addition, over the projective lines, we construct new families of MDS quantum codes with parameters $[[N,N-2K,K+1]]_q$ under the following conditions: i) $N=t(q-1)+1$ or $t(q-1)+2$ with $t|(q+1)$ and $K=\lfloor\frac{t(q-1)+1}{2t}\rfloor+1$; ii) $(n-1)|(q^2-1)$, $N=n$ or $N=n+1$, $K_0=\lfloor\frac{n+q-1}{q+1}\rfloor$, and $K\ge K_0+1$; iii) $N=tq+1$, $\forall~1\le t\le q$ and $K=\lfloor\frac{tq+q-1}{q+1}\rfloor+1$; iv) $n|(q^2-1)$, $n_2=\frac{n}{\gcd (n,q+1)}$, $\forall~ 1\le t\le \frac{q-1}{n_2}-1$, $N=(t+1)n+2$ and $K=\lfloor \frac{(t+1)n+1+q-1}{q+1}\rfloor+1$.

arXiv:2110.00769•Oct 2, 2021•3 citations

Quantum Stabilizer Codes From Maximal Curves

Lingfei Jin

A curve attaining the Hasse-Weil bound is called a maximal curve. Usually, classical error-correcting codes obtained from a maximal curve have good parameters. However, the quantum stabilizer codes obtained from such classical error-correcting codes via Euclidean or Hermitian self-orthogonality do not always possess good parameters. In this paper, the Hermitian self-orthogonality of algebraic geometry codes obtained from two maximal curves is investigated. It turns out that the stabilizer quantum codes produced from such Hermitian self-orthogonal classical codes have good parameters.

arXiv:1311.2705•IEEE Transactions on Information Theory•Nov 19, 2013•34 citations

Quantum Algebraic-Geometric Codes

Chiu Fan Lee

This is a Part III essay aiming to discuss the contruction of quantum error-correcting codes through the use of the theory of algebraic function fields, which produces codes with asymptotically good parameters. This exposition emphasises constructibility and several applications of the main theorem (theorem 6.2) are given. Prerequisites are the first 12 lectures of the Part III course Quantum Information Theory [16] or chapter 7 of Preskill’s Lecture Notes [15], and the first two chapters of Stichtenoth’s Algebraic Function Fields and Codes [19].

•Jan 1, 2003•0 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•28 citations

Entanglement-Assisted Quantum Codes From Algebraic Geometry Codes

Francisco Revson F. Pereira, Ruud Pellikaan, Giuliano G. La Guardia +1 more

Quantum error-correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a way for quantum error-correcting codes to achieve higher rates than the one obtained by means of the traditional stabilizer formalism. Such codes are called entanglement-assisted quantum error-correcting (EAQEC) codes. In this paper, we utilize algebraic geometry codes to construct several families of EAQEC codes derived from the Euclidean and the Hermitian construction. Three families constructed here consist of codes whose quantum Singleton defect is equal to zero, one, or two. We also construct families of EAQEC codes with an encoding rate exceeding the quantum Gilbert-Varshamov bound. Additionally, asymptotically good towers of linear complementary dual codes are used to obtain asymptotically good families of EAQEC codes consuming maximal entanglement. Furthermore, a simple comparison with the quantum Gilbert-Varshamov bound demonstrates that, by utilizing the proposed construction, it is possible to generate an asymptotically family of EAQEC codes that exceeds this bound.

arXiv:1907.06357•IEEE Transactions on Information Theory•Sep 16, 2021•4 citations

Error Correcting Quantum Codes and Algebraic Curves

Artur Elezi

The goal of this paper is twofold. First, to provide a self contained, detailed and rigorous mathematical introduction to some aspects of the quantum error-correcting codes and especially quantum stabilizer codes and their connection to self-orthogonal linear codes. This has been done without venturing that 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, some of which are new, that we present here. Techniques from algebra of finite fields as well as representations of finite abelian groups have been employed. The second goal is the construction of some stabilizer codes via self-orthogonal linear codes associated to algebraic curves.

NATO science for peace and security series. D, Information and communication security•Jan 1, 2015•0 citations
This chapter discusses quantum error-correcting codes constructed from algebraic curves. We give an introduction to quantum coding theory including bounds on quantum codes. We describe stabilizer codes which are the quantum analog of classical linear codes and discuss the binary and q-ary CSS construction. Then we focus on quantum codes from algebraic curves including the projective line, Hermitian curves, and hyperelliptic curves. In addition, we describe the asymptotic behaviors of quantum codes from the Garcia-Stichtenoth tower attaining the Drinfeld-Vlăduţ bound.
There has been a lot of effort to construct good quantum codes from the classical error correcting codes. Constructing new quantum codes, using Hermitian self-orthogonal codes, seems to be a difficult problem in general. In this paper, Hermitian self-orthogonal codes are studied from algebraic function fields. Sufficient conditions for the Hermitian self-orthogonality of an algebraic geometry code are presented. New Hermitian self-orthogonal codes are constructed from projective lines, elliptic curves, hyper-elliptic curves, Hermitian curves, and Artin-Schreier curves. In addition, over the projective lines, we construct new families of MDS quantum codes with parameters [[N,N−2K,K+1]]q[[N,N-2K,K+1]]_q[[N,N−2K,K+1]]q​ under the following conditions: i) N=t(q−1)+1N=t(q-1)+1N=t(q−1)+1 or t(q−1)+2t(q-1)+2t(q−1)+2 with t∣(q+1)t|(q+1)t∣(q+1) and K=⌊t(q−1)+12t⌋+1K=\lfloor\frac{t(q-1)+1}{2t}\rfloor+1K=⌊2tt(q−1)+1​⌋+1; ii) (n−1)∣(q2−1)(n-1)|(q^2-1)(n−1)∣(q2−1), N=nN=nN=n or N=n+1N=n+1N=n+1, K0=⌊n+q−1q+1⌋K_0=\lfloor\frac{n+q-1}{q+1}\rfloorK0​=⌊q+1n+q−1​⌋, and K≥K0+1K\ge K_0+1K≥K0​+1; iii) N=tq+1N=tq+1N=tq+1, ∀ 1≤t≤q\forall~1\le t\le q∀ 1≤t≤q and K=⌊tq+q−1q+1⌋+1K=\lfloor\frac{tq+q-1}{q+1}\rfloor+1K=⌊q+1tq+q−1​⌋+1; iv) n∣(q2−1)n|(q^2-1)n∣(q2−1), n2=ngcd⁡(n,q+1)n_2=\frac{n}{\gcd (n,q+1)}n2​=gcd(n,q+1)n​, ∀ 1≤t≤q−1n2−1\forall~ 1\le t\le \frac{q-1}{n_2}-1∀ 1≤t≤n2​q−1​−1, N=(t+1)n+2N=(t+1)n+2N=(t+1)n+2 and K=⌊(t+1)n+1+q−1q+1⌋+1K=\lfloor \frac{(t+1)n+1+q-1}{q+1}\rfloor+1K=⌊q+1(t+1)n+1+q−1​⌋+1.
A curve attaining the Hasse-Weil bound is called a maximal curve. Usually, classical error-correcting codes obtained from a maximal curve have good parameters. However, the quantum stabilizer codes obtained from such classical error-correcting codes via Euclidean or Hermitian self-orthogonality do not always possess good parameters. In this paper, the Hermitian self-orthogonality of algebraic geometry codes obtained from two maximal curves is investigated. It turns out that the stabilizer quantum codes produced from such Hermitian self-orthogonal classical codes have good parameters.
This is a Part III essay aiming to discuss the contruction of quantum error-correcting codes through the use of the theory of algebraic function fields, which produces codes with asymptotically good parameters. This exposition emphasises constructibility and several applications of the main theorem (theorem 6.2) are given. Prerequisites are the first 12 lectures of the Part III course Quantum Information Theory [16] or chapter 7 of Preskill’s Lecture Notes [15], and the first two chapters of Stichtenoth’s Algebraic Function Fields and Codes [19].
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.
Quantum error-correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a way for quantum error-correcting codes to achieve higher rates than the one obtained by means of the traditional stabilizer formalism. Such codes are called entanglement-assisted quantum error-correcting (EAQEC) codes. In this paper, we utilize algebraic geometry codes to construct several families of EAQEC codes derived from the Euclidean and the Hermitian construction. Three families constructed here consist of codes whose quantum Singleton defect is equal to zero, one, or two. We also construct families of EAQEC codes with an encoding rate exceeding the quantum Gilbert-Varshamov bound. Additionally, asymptotically good towers of linear complementary dual codes are used to obtain asymptotically good families of EAQEC codes consuming maximal entanglement. Furthermore, a simple comparison with the quantum Gilbert-Varshamov bound demonstrates that, by utilizing the proposed construction, it is possible to generate an asymptotically family of EAQEC codes that exceeds this bound.
The goal of this paper is twofold. First, to provide a self contained, detailed and rigorous mathematical introduction to some aspects of the quantum error-correcting codes and especially quantum stabilizer codes and their connection to self-orthogonal linear codes. This has been done without venturing that 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, some of which are new, that we present here. Techniques from algebra of finite fields as well as representations of finite abelian groups have been employed. The second goal is the construction of some stabilizer codes via self-orthogonal linear codes associated to algebraic curves.