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:1311.2705 · IEEE Transactions on Information Theory

Quantum Stabilizer Codes From Maximal Curves

Lingfei Jin

Published Nov 19, 2013• 34 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/tit.2013.2287694

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

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

Quantum Error-Correcting Codes from Algebraic Curves

Jon-Lark Kim, Gretchen L. Matthews

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.

Series on coding theory and cryptology•Oct 1, 2008•14 citations

Euclidean and Hermitian Self-Orthogonal Algebraic Geometry Codes and Their Application to Quantum Codes

Lingfei Jin, Chaoping Xing

In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characteristic is slightly less than n/2-g with n being the length of the code and g being the genus of the base curve, then it is equivalent to an Euclidean self-orthogonal code. Previously, such results required a strong condition on the existence of a certain differential. We also show a similar result on Hermitian self-orthogonal algebraic geometry codes. As a consequence, we can apply our result to quantum codes and obtain some good quantum codes. In particular, we obtain a q-ary quantum [[q+1,1]]-MDS code for an even power q which is essential for quantum secret sharing.

arXiv:1308.3575•IEEE Transactions on Information Theory•Dec 2, 2011•77 citations

Quantum Algebraic Geometry Codes

Zhengyi Han

Quantum error correction is an essential aspect of quantum information theory, providing protection for quantum states against noise and decoherence. This thesis investigates the construction of quantum error correction codes derived from classical algebraic geometry (AG) codes. We present two distinct construction techniques, highlighting the flexibility and self-orthogonality of AG codes, and demonstrate their ability to produce asymptotically good quantum codes. Additionally, we explore strategies to fine-tune the parameters of classical AG codes, ensuring they possess the desired properties for quantum code construction. This work serves as a comprehensive guide to the fundamental concepts and common methodologies underlying quantum algebraic geometry codes.

•Dec 1, 2024•0 citations

An algorithmic approach to entanglement-assisted quantum error-correcting codes from the Hermitian curve

René Bødker Christensen, Carlos Munuera, Francisco Revson F. Pereira +2 more

We study entanglement-assisted quantum error-correcting codes (EAQECCs) arising from classical one-point algebraic geometry codes from the Hermitian curve with respect to the Hermitian inner product. Their only unknown parameter is $ c $, the number of required maximally entangled quantum states since the Hermitian dual of an AG code is unknown. In this article, we present an efficient algorithmic approach for computing $ c $ for this family of EAQECCs. As a result, this algorithm allows us to provide EAQECCs with excellent parameters over any field size.

arXiv:2105.02166•Advances in Mathematics of Communications•Jan 12, 2022•2 citations
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.
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.
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.
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.
In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characteristic is slightly less than n/2-g with n being the length of the code and g being the genus of the base curve, then it is equivalent to an Euclidean self-orthogonal code. Previously, such results required a strong condition on the existence of a certain differential. We also show a similar result on Hermitian self-orthogonal algebraic geometry codes. As a consequence, we can apply our result to quantum codes and obtain some good quantum codes. In particular, we obtain a q-ary quantum [[q+1,1]]-MDS code for an even power q which is essential for quantum secret sharing.
Quantum error correction is an essential aspect of quantum information theory, providing protection for quantum states against noise and decoherence. This thesis investigates the construction of quantum error correction codes derived from classical algebraic geometry (AG) codes. We present two distinct construction techniques, highlighting the flexibility and self-orthogonality of AG codes, and demonstrate their ability to produce asymptotically good quantum codes. Additionally, we explore strategies to fine-tune the parameters of classical AG codes, ensuring they possess the desired properties for quantum code construction. This work serves as a comprehensive guide to the fundamental concepts and common methodologies underlying quantum algebraic geometry codes.
We study entanglement-assisted quantum error-correcting codes (EAQECCs) arising from classical one-point algebraic geometry codes from the Hermitian curve with respect to the Hermitian inner product. Their only unknown parameter is $ c $, the number of required maximally entangled quantum states since the Hermitian dual of an AG code is unknown. In this article, we present an efficient algorithmic approach for computing $ c $ for this family of EAQECCs. As a result, this algorithm allows us to provide EAQECCs with excellent parameters over any field size.