Entanglement-Assisted Quantum Codes From Algebraic Geometry Codes

DOI10.1109/TIT.2021.3113367MaRDI QIDQ5032560zbMATH OpenOpenAlexFDO

Authors Francisco Revson F. Pereira, Ruud Pellikaan, Giuliano G. La Guardia, Francisco M. De Assis

Publication date 17 February 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.06357

zbMATH Keywords

algebraic geometry codesentanglement-assisted quantum error-correcting codes

Mathematics Subject Classification ID

Computational stability and error-correcting codes for quantum computation and communication processing (81P73) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: 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 via the traditional stabilizer formalism. Such codes are called entanglement-assisted quantum (QUENTA) codes. In this paper, we use algebraic geometry codes to construct several families of QUENTA codes via the Euclidean and the Hermitian construction. Two of the families created have maximal entanglement and have quantum Singleton defect equal to zero or one. Comparing the other families with the codes with the respective quantum Gilbert-Varshamov bound, we show that our codes have a rate that surpasses that bound. At the end, asymptotically good towers of linear complementary dual codes are used to obtain asymptotically good families of maximal entanglement QUENTA codes. Furthermore, a simple comparison with the quantum Gilbert-Varshamov bound demonstrates that using our construction it is possible to create an asymptotically family of QUENTA codes that exceeds this bound.

Cited in

(20)

• The geometry of quantum codes
• New entanglement-assisted quantum codes from \(k\)-Galois dual codes
• AG codes and AG quantum codes from cyclic extensions of the Suzuki and Ree curves
• Entanglement-assisted quantum codes from matrix-product codes
• New constructions of entanglement-assisted quantum codes
• Dualities and identities for entanglement-assisted quantum codes
• Three classes of new EAQEC MDS codes
• scientific article; zbMATH DE number 5901462 (Why is no real title available?)
• Entanglement-assisted quantum MDS codes from generalized Reed-Solomon codes
• Non-binary quantum codes from cyclic codes over \(\mathbb{F}_p \times (\mathbb{F}_p +v\mathbb{F}_p)\)
• New MDS entanglement-assisted quantum codes from MDS Hermitian self-orthogonal codes
• An algorithmic approach to entanglement-assisted quantum error-correcting codes from the Hermitian curve
• Several new families of MDS EAQECCs with much larger dimensions and related application to EACQCs
• Hulls of linear codes from simplex codes
• Construction of some new entanglement-assisted quantum error-correcting codes of large lengths
• Entanglement-assisted quantum error-correcting codes using matrix-product codes
• The Euclidean hulls of matrix product codes and their applications to EAQEC codes
• On iso-dual MDS codes from elliptic curves
• Entanglement-assisted quantum codes from unitary matrices
• Hermitian hulls of rational algebraic geometry codes and applications in quantum codes

This page was built for publication: Entanglement-Assisted Quantum Codes From Algebraic Geometry Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5032560)