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

IEEE Transactions on Information Theory

Some good quantum error-correcting codes from algebraic-geometric codes

Hao Chen

Published Jul 1, 2001• 57 citations
Publisher

Abstract

It is shown that quantum error correction can be achieved by the use of classical binary codes or additive codes over F/sub 4/. In this correspondence, with the help of some algebraic techniques the theory of algebraic-geometric codes is used to construct an asymptotically good family of quantum error-correcting codes and other classes of good quantum error-correcting codes. Our results are compared with the known best quantum codes.

DOI
10.1109/18.930942

Related papers

Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound

Hao Chen, San Ling, Chaoping Xing

It is known that quantum error correction can be achieved using classical binary codes or additive codes over F/sub 4/. Asymptotically good quantum codes have been constructed from algebraic-geometry codes and a bound on (/spl delta/, R) was computed from the Tsfasman-Vladut-Zink bound of the theory of classical algebraic-geometry codes. In this correspondence, by the use of a concatenation technique we construct a family of asymptotically good quantum codes exceeding the bound in a small interval.

IEEE Transactions on Information Theory•Jul 1, 2001•50 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 Codes From Concatenated Algebraic-Geometric Codes

H. Chen, San Ling, Chaoping Xing

We apply Steane's enlargement of the Calderbank-Shor-Steane (CSS) codes and additive codes over F/sub 4/ to concatenated algebraic-geometric codes to construct many good quantum codes with fewer restrictions on the parameters compared to some known quantum codes. Some of the quantum codes we have constructed are either optimal or have parameters as good as the best known codes, while some have parameters better than those obtained from other known constructions.

IEEE Transactions on Information Theory•Jul 19, 2005•70 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

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

Quantum Algebraic-Geometric Codes

Chiu Fan Lee

This is a Part III essay aiming to discuss the contruction of quantum error-correcting codes through the use of the theory of algebraic function fields, which produces codes with asymptotically good parameters. This exposition emphasises constructibility and several applications of the main theorem (theorem 6.2) are given. Prerequisites are the first 12 lectures of the Part III course Quantum Information Theory [16] or chapter 7 of Preskill’s Lecture Notes [15], and the first two chapters of Stichtenoth’s Algebraic Function Fields and Codes [19].

•Jan 1, 2003•0 citations
It is shown that quantum error correction can be achieved by the use of classical binary codes or additive codes over F/sub 4/. In this correspondence, with the help of some algebraic techniques the theory of algebraic-geometric codes is used to construct an asymptotically good family of quantum error-correcting codes and other classes of good quantum error-correcting codes. Our results are compared with the known best quantum codes.
It is known that quantum error correction can be achieved using classical binary codes or additive codes over F/sub 4/. Asymptotically good quantum codes have been constructed from algebraic-geometry codes and a bound on (/spl delta/, R) was computed from the Tsfasman-Vladut-Zink bound of the theory of classical algebraic-geometry codes. In this correspondence, by the use of a concatenation technique we construct a family of asymptotically good quantum codes exceeding the bound in a small interval.
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.
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.
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.
This is a Part III essay aiming to discuss the contruction of quantum error-correcting codes through the use of the theory of algebraic function fields, which produces codes with asymptotically good parameters. This exposition emphasises constructibility and several applications of the main theorem (theorem 6.2) are given. Prerequisites are the first 12 lectures of the Part III course Quantum Information Theory [16] or chapter 7 of Preskill’s Lecture Notes [15], and the first two chapters of Stichtenoth’s Algebraic Function Fields and Codes [19].