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:2110.00769

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

Lin Sok

Published Oct 2, 2021• 1 citation
arXivHTMLPDF

Abstract

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

DOI
10.48550/arxiv.2110.00769

Related papers

Four New Families of Quantum Stabilizer Codes from Hermitian Self-Orthogonal MDS codes

Lin Sok, Martianus Frederic Ezerman, San Ling

We construct codes from rational function fields and provide sufficient conditions for a rational algebraic geometry code to be Hermitian self-orthogonal. A method to embed such codes yields new families of Hermitian self-orthogonal MDS codes with large dimensions. Using the stabilizer formalism, we construct four new families of quantum MDS codes with parameters $[N, N-2 K, K+1]_{q}$. We give conditions on the length N and the values of K of the dimension N-2K. Parameter comparisons over small fields highlight the novelty of the quantum codes that we obtain.

International Symposium on Turbo Codes and Iterative Information Processing•Sep 4, 2023•6 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•33 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•78 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

Explicit constructions of optimal linear codes with Hermitian hulls and their application to quantum codes

Lin Sok

We prove that any Hermitian self-orthogonal $[n,k,d]_{q^2}$ code gives rise to an $[n,k,d]_{q^2}$ code with $\ell$ dimensional Hermitian hull for $0\le \ell \le k$. We present a new method to construct Hermitian self-orthogonal $[n,k]_{q^2}$ codes with large dimensions $k>\frac{n+q-1}{q+1}$. New families of Hermitian self-orthogonal codes with good parameters are obtained; more precisely those containing almost MDS codes. By applying a puncturing technique to Hermitian self-orthogonal codes, MDS $[n,k]_{q^2}$ linear codes with Hermitian hull having large dimensions $k>\frac{n+q-1}{q+1}$ are also derived. New families of MDS, almost MDS and optimal codes with arbitrary Hermitian hull dimensions are explicitly constructed from algebraic curves. As an application, we provide entanglement-assisted quantum error correcting codes with new parameters.

arXiv:2105.00513•May 2, 2021•0 citations

New quantum MDS codes with flexible parameters from Hermitian self-orthogonal GRS codes

Oisin Campion, Fernando Hernando, Gary McGuire

Abstract Let q be a prime power. Let $$\lambda >1$$ λ > 1 be a divisor of $$q-1$$ q - 1 and $$\tau >1$$ τ > 1 be a divisor of $$q+1$$ q + 1 . Under certain conditions we prove that there exists an MDS stabilizer quantum code with length $$n=\lambda \tau \sigma $$ n = λ τ σ for a range of values of $$\sigma $$ σ . This is a flexible construction, which includes previously known families and also new MDS parameters not known before.

arXiv:2501.17010•Cryptography and Communications•Aug 13, 2025•3 citations
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.
We construct codes from rational function fields and provide sufficient conditions for a rational algebraic geometry code to be Hermitian self-orthogonal. A method to embed such codes yields new families of Hermitian self-orthogonal MDS codes with large dimensions. Using the stabilizer formalism, we construct four new families of quantum MDS codes with parameters [N,N−2K,K+1]q[N, N-2 K, K+1]_{q}[N,N−2K,K+1]q​. We give conditions on the length N and the values of K of the dimension N-2K. Parameter comparisons over small fields highlight the novelty of the quantum codes that we obtain.
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.
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.
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.
We prove that any Hermitian self-orthogonal [n,k,d]q2[n,k,d]_{q^2}[n,k,d]q2​ code gives rise to an [n,k,d]q2[n,k,d]_{q^2}[n,k,d]q2​ code with ℓ\ellℓ dimensional Hermitian hull for 0≤ℓ≤k0\le \ell \le k0≤ℓ≤k. We present a new method to construct Hermitian self-orthogonal [n,k]q2[n,k]_{q^2}[n,k]q2​ codes with large dimensions k>n+q−1q+1k>\frac{n+q-1}{q+1}k>q+1n+q−1​. New families of Hermitian self-orthogonal codes with good parameters are obtained; more precisely those containing almost MDS codes. By applying a puncturing technique to Hermitian self-orthogonal codes, MDS [n,k]q2[n,k]_{q^2}[n,k]q2​ linear codes with Hermitian hull having large dimensions k>n+q−1q+1k>\frac{n+q-1}{q+1}k>q+1n+q−1​ are also derived. New families of MDS, almost MDS and optimal codes with arbitrary Hermitian hull dimensions are explicitly constructed from algebraic curves. As an application, we provide entanglement-assisted quantum error correcting codes with new parameters.
Abstract Let q be a prime power. Let λ>1\lambda >1λ>1 λ > 1 be a divisor of q−1q-1q−1 q - 1 and τ>1\tau >1τ>1 τ > 1 be a divisor of q+1q+1q+1 q + 1 . Under certain conditions we prove that there exists an MDS stabilizer quantum code with length n=λτσn=\lambda \tau \sigma n=λτσ n = λ τ σ for a range of values of σ\sigma σ σ . This is a flexible construction, which includes previously known families and also new MDS parameters not known before.