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

International Symposium on Turbo Codes and Iterative Information Processing

Two Families of Entanglement-Assisted Quantum Codes from Algebraic Plane Curves

Lin Sok, San Ling

Published Aug 18, 2025• 1 citation
Publisher

Abstract

This article studies the Hermitian hulls of linear codes from algebraic plane curves of a special type. We provide lower bounds on the hull dimension of one-point algebraic geometry codes. We derive two families of entanglement-assisted quantum codes from one-point algebraic geometry codes, using the Hermitian approach.
DOI
10.1109/istc65386.2025.11154485

Related papers

On the Hermitian Hulls of One-Point Algebraic Geometry Codes and Their Application to EAQECCs

Lin Sok, San Ling

Algebraic geometry (AG) codes are an important class of linear codes for building standard quantum error-correcting codes (QECCs) when the Hermitian approach is applied to the former codes. Determining the Hermitian dual of an AG code remains an open problem in classical coding theory. Because of the lack of formulae for the Hermitian dual of an AG code, its Euclidean dual is used to derive its Hermitian dual, and this reduces the dimension and minimum distance of the classical code when the self-orthogonal condition is required, resulting in QECCs with small quantum distances. This lack also gives a challenge to constructing other types of quantum codes, such as entanglement-assisted quantum error-correcting codes (EAQECCs). In this article, we study the Hermitian hulls of one-point AG codes of a specific type, where we focus on the dimensions of the hulls. We provide several lower bounds on the hull dimensions of the one-point AG code and give explicit constructions. From AG codes with lower-bounded Hermitian hull dimensions, we derive a number of families of entanglement-assisted quantum codes from one-point AG codes, using the Hermitian approach and some propagation rules.

IEEE Transactions on Information Theory•Jan 1, 2026•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

On Two-Point Rational AG Codes with Lower Bounded Hermitian Hull Dimension

Lin Sok, San Ling

Motivated by the Hermitian construction of quantum codes using classical linear codes as ingredients, we study the Hermitian hulls of two-point rational algebraic geometry (AG) codes Cℒ(D,G) with G = (k−1)O+rP for some positive integers k and r. We provide a lower bound on their Hermitian hull dimensions. Specifically, we prove that under certain conditions, the Hermitian hull dimensions of such AG codes are lower bounded by k−1−r, giving rise to linear codes of Hermitian hull dimension k−r−1 by some propagation rules. As an application, we derive two families of entanglement-assisted quantum error-correcting codes with new parameters.

IEEE Information Theory Workshop (ITW)•Sep 29, 2025•0 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

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•1 citation

Hulls of Projective Reed–Muller Codes over the Projective Plane

Diego Ruano, Rodrigo San–José

Abstract. By solving a problem regarding polynomials in a quotient ring, we obtain the relative hull and the Hermitian hull of projective Reed–Muller codes over the projective plane. The dimension of the hull determines the minimum number of maximally entangled pairs required for the corresponding entanglement-assisted quantum error-correcting code. Hence, by computing the dimension of the hull we now have all the parameters of the symmetric and asymmetric entanglement-assisted quantum error-correcting codes constructed with projective Reed–Muller codes over the projective plane. As a byproduct, we also compute the dimension of the Hermitian hull for affine Reed–Muller codes in two variables.

arXiv:2312.13921•SIAM Journal on Applied Algebra and Geometry•Nov 18, 2024•8 citations
Algebraic geometry (AG) codes are an important class of linear codes for building standard quantum error-correcting codes (QECCs) when the Hermitian approach is applied to the former codes. Determining the Hermitian dual of an AG code remains an open problem in classical coding theory. Because of the lack of formulae for the Hermitian dual of an AG code, its Euclidean dual is used to derive its Hermitian dual, and this reduces the dimension and minimum distance of the classical code when the self-orthogonal condition is required, resulting in QECCs with small quantum distances. This lack also gives a challenge to constructing other types of quantum codes, such as entanglement-assisted quantum error-correcting codes (EAQECCs). In this article, we study the Hermitian hulls of one-point AG codes of a specific type, where we focus on the dimensions of the hulls. We provide several lower bounds on the hull dimensions of the one-point AG code and give explicit constructions. From AG codes with lower-bounded Hermitian hull dimensions, we derive a number of families of entanglement-assisted quantum codes from one-point AG codes, using the Hermitian approach and some propagation rules.
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.
Motivated by the Hermitian construction of quantum codes using classical linear codes as ingredients, we study the Hermitian hulls of two-point rational algebraic geometry (AG) codes Cℒ(D,G) with G = (k−1)O+rP for some positive integers k and r. We provide a lower bound on their Hermitian hull dimensions. Specifically, we prove that under certain conditions, the Hermitian hull dimensions of such AG codes are lower bounded by k−1−r, giving rise to linear codes of Hermitian hull dimension k−r−1 by some propagation rules. As an application, we derive two families of entanglement-assisted quantum error-correcting codes with new parameters.
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.
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. By solving a problem regarding polynomials in a quotient ring, we obtain the relative hull and the Hermitian hull of projective Reed–Muller codes over the projective plane. The dimension of the hull determines the minimum number of maximally entangled pairs required for the corresponding entanglement-assisted quantum error-correcting code. Hence, by computing the dimension of the hull we now have all the parameters of the symmetric and asymmetric entanglement-assisted quantum error-correcting codes constructed with projective Reed–Muller codes over the projective plane. As a byproduct, we also compute the dimension of the Hermitian hull for affine Reed–Muller codes in two variables.