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:2105.02166 · Advances in Mathematics of Communications

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

René Bødker Christensen, Carlos Munuera, Francisco Revson F. Pereira, Diego Ruano, INFN, Sezione di Perugia, Via A. Pascoli, 06123 Perugia, Italy

Published Jan 12, 2022• 2 citations
arXivHTMLPDF

Abstract

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.

DOI
10.3934/amc.2021072

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

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

Entanglement-assisted quantum error-correcting codes over arbitrary finite fields

Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto +1 more

Abstract We prove that the known formulae for computing the optimal number of maximally entangled pairs required for entanglement-assisted quantum error-correcting codes (EAQECCs) over the binary field hold for codes over arbitrary finite fields as well. We also give a Gilbert–Varshamov bound for EAQECCs and constructions of EAQECCs coming from punctured self-orthogonal linear codes which are valid for any finite field.

arXiv:1812.05312•Quantum Information Processing•Mar 4, 2019•121 citations

Entanglement-Assisted Concatenated Quantum Codes: Parameters and Asymptotic Performance

Jihao Fan, Wei Cheng, Gaojun Luo +2 more

Entanglement-assisted concatenated quantum codes (EACQCs) are constructed by concatenating two entanglement-assisted quantum error-correcting codes (EAQECCs). By selecting the inner and outer component codes carefully, it is able to construct state-of-the-art EACQCs with parameters better than previous quantum codes. In this work, we use almost maximum-distance-separable (MDS) codes and $\hbar$-MDS codes as the outer codes to construct EACQCs. Because the range of code length of almost MDS and $\hbar$-MDS codes is much more free than that of the commonly used MDS codes. We derive several families of new EACQCs with parameters better than the previously best known EAQECCs and standard quantum error-correcting codes (QECCs) of the same length and net transmissions. Moreover, we demonstrate that EACQCs are with maximal entanglement if both the inner and outer component codes are with maximal entanglement. As a result, we construct three new maximal-entanglement EACQCs which have optimal parameters. In addition, we present several new maximal-entanglement EACQCs whose minimum distance is only one less than the minimum distance of the optimal codes. In particular, we propose two new families of asymptotically good maximal-entanglement EACQCs with explicit constructions by using entanglement-assisted quantum algebraic geometry codes as the outer codes. At last, we prove that EACQCs can attain the quantum Gilbert-Varshamov bound for EAQECCs asymptotically.

arXiv:2501.04921•Jan 9, 2025•2 citations

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

Lin Sok, San Ling

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.

International Symposium on Turbo Codes and Iterative Information Processing•Aug 18, 2025•1 citation

Entanglement-assisted Quantum Error Correcting Code Saturating The Classical Singleton Bound

Soham Ghosh, Evagoras Stylianou, Holger Boche

We introduce a construction for entanglement-assisted quantum error-correcting codes (EAQECCs) that saturates the classical Singleton bound with less shared entanglement than any known method for code rates below $ \frac{k}{n} = \frac{1}{3} $. For higher rates, our EAQECC also meets the Singleton bound, although with increased entanglement requirements. Additionally, we demonstrate that any classical $[n,k,d]_q$ code can be transformed into an EAQECC with parameters $[[n,k,d;2k]]_q$ using $2k$ pre-shared maximally entangled pairs. The complexity of our encoding protocol for $k$-qudits with $q$ levels is $\mathcal{O}(k \log_{\frac{q}{q-1}}(k))$, excluding the complexity of encoding and decoding the classical MDS code. While this complexity remains linear in $k$ for systems of reasonable size, it increases significantly for larger-levelled systems, highlighting the need for further research into complexity reduction.

arXiv:2410.04130•Oct 5, 2024•0 citations
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 ccc, 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 ccc for this family of EAQECCs. As a result, this algorithm allows us to provide EAQECCs with excellent parameters over any field size.
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.
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.
Entanglement-assisted concatenated quantum codes (EACQCs) are constructed by concatenating two entanglement-assisted quantum error-correcting codes (EAQECCs). By selecting the inner and outer component codes carefully, it is able to construct state-of-the-art EACQCs with parameters better than previous quantum codes. In this work, we use almost maximum-distance-separable (MDS) codes and ℏ\hbarℏ-MDS codes as the outer codes to construct EACQCs. Because the range of code length of almost MDS and ℏ\hbarℏ-MDS codes is much more free than that of the commonly used MDS codes. We derive several families of new EACQCs with parameters better than the previously best known EAQECCs and standard quantum error-correcting codes (QECCs) of the same length and net transmissions. Moreover, we demonstrate that EACQCs are with maximal entanglement if both the inner and outer component codes are with maximal entanglement. As a result, we construct three new maximal-entanglement EACQCs which have optimal parameters. In addition, we present several new maximal-entanglement EACQCs whose minimum distance is only one less than the minimum distance of the optimal codes. In particular, we propose two new families of asymptotically good maximal-entanglement EACQCs with explicit constructions by using entanglement-assisted quantum algebraic geometry codes as the outer codes. At last, we prove that EACQCs can attain the quantum Gilbert-Varshamov bound for EAQECCs asymptotically.
We introduce a construction for entanglement-assisted quantum error-correcting codes (EAQECCs) that saturates the classical Singleton bound with less shared entanglement than any known method for code rates below $ \frac{k}{n} = \frac{1}{3} $. For higher rates, our EAQECC also meets the Singleton bound, although with increased entanglement requirements. Additionally, we demonstrate that any classical [n,k,d]q[n,k,d]_q[n,k,d]q​ code can be transformed into an EAQECC with parameters [[n,k,d;2k]]q[[n,k,d;2k]]_q[[n,k,d;2k]]q​ using 2k2k2k pre-shared maximally entangled pairs. The complexity of our encoding protocol for kkk-qudits with qqq levels is O(klog⁡qq−1(k))\mathcal{O}(k \log_{\frac{q}{q-1}}(k))O(klogq−1q​​(k)), excluding the complexity of encoding and decoding the classical MDS code. While this complexity remains linear in kkk for systems of reasonable size, it increases significantly for larger-levelled systems, highlighting the need for further research into complexity reduction.