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

Springer proceedings in mathematics & statistics

Quantum Error-Correcting Codes Over Small Fields From AG Codes

Heeralal Janwa, Fernando Piñero González

Published Jan 1, 2024• 1 citation
Publisher
DOI
10.1007/978-3-031-52969-6_36

Related papers

On certain self-orthogonal AG codes with applications to Quantum error-correcting codes

Daniele Bartoli, Maria Montanucci, Giovanni Zini

arXiv:1912.08021•Designs Codes and Cryptography•Apr 6, 2021•12 citations

A survey on quantum error correcting codes

황규호

•Jan 1, 2018•0 citations

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

Quantum Error-Correcting Codes

Dan Cristian Marinescu, Gabriela M. Marinescu

Elsevier eBooks•Feb 15, 2011•7 citations

A generator of algebraic quantum error correction codes

Ichio Kikuchi, Akihito Kikuchi

In this article, we report the development of a computer program to build quantum error correction codes (QECC). It enables us to generate a QECC from an algebraic geometry code (AGC). We demonstrate how to incarnate the abstract idea (by which AG codes are extended to QEC codes) into an executable program, which systematically yields QECC over a range of adjustable parameters.

•Mar 9, 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
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.