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 traditional stabilizer formalism. Such codes are called entanglement-assisted quantum (QUENTA) codes. In this paper, we use algebraic geometry codes to construct two families of QUENTA codes, where one of them has maximal entanglement and is maximal distance separable. In the end, we show that for any asymptotically good tower of algebraic function fields there is an asymptotically good family of maximal entanglement QUENTA codes with nonzero rate, relative minimal distance, and relative amount of entanglement.
Original language | English |
---|---|
Title of host publication | 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings |
Place of Publication | Piscataway |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 2559-2563 |
Number of pages | 5 |
ISBN (Electronic) | 9781538692912 |
DOIs | |
Publication status | Published - 1 Jul 2019 |
Event | 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France Duration: 7 Jul 2019 → 12 Jul 2019 |
Conference
Conference | 2019 IEEE International Symposium on Information Theory, ISIT 2019 |
---|---|
Country/Territory | France |
City | Paris |
Period | 7/07/19 → 12/07/19 |
Keywords
- Algebraic Geometry Codes
- Asymptotically Good
- Maximal Distance Separable
- Maximal Entanglement
- Quantum Codes