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 three families of QUENTA codes, where one of them has maximal entanglement and is maximal distance separable. At 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 | Proceedings of the WCC 2019: The Eleventh International Workshop on Coding and Cryptography |
| Chapter | 33 |
| Number of pages | 10 |
| Publication status | Published - 2019 |
| Event | The Eleventh International Workshop on Coding and Cryptography - Saint-Jacut- de-la-Mer, France Duration: 31 Mar 2019 → 5 Apr 2019 https://www.lebesgue.fr/content/sem2019-WCC |
Conference
| Conference | The Eleventh International Workshop on Coding and Cryptography |
|---|---|
| Country/Territory | France |
| City | Saint-Jacut- de-la-Mer |
| Period | 31/03/19 → 5/04/19 |
| Internet address |