An Algorithmic Approach to Entanglement-Assisted Quantum Error-Correcting Codes from the Hermitian Curve
arXiv:2105.02166 · doi:10.3934/amc.2021072
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 , 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 for this family of EAQECCs. As a result, this algorithm allows us to provide EAQECCs with excellent parameters over any field size.
arXiv comment23 pages
References in corpus (9)
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Correcting Quantum Errors with Entanglement
- Quantum Error Correction
- Entanglement-assisted quantum error-correcting codes over arbitrary finite fields
- Asymptotically Good Quantum Codes
- Algebraic geometric construction of a quantum stabilizer code
- Degenerate quantum codes and the quantum Hamming bound
- Quantum codes from a new construction of self-orthogonal algebraic geometry codes
- Entanglement-assisted Quantum Codes from Algebraic Geometry Codes