Description
A quantum turbo code which uses pre-shared entanglement. This allows its encoder to be both recursive and non-catastrophic.
Rate
Maximal-entanglement EA quantum turbo codes come close to achieving the EA hashing bound [2]; see [3; Footnote 2].
Encoding
As opposed to quantum turbo codes with no pre-shared entanglement, EA encoders can be both recursive and non-catastrophic [2].
Parent
Cousins
- Turbo code
- Quantum turbo code
- Maximal-entanglement EA Galois-qudit stabilizer code — Maximal-entanglement EA quantum turbo codes come close to achieving the EA hashing bound [2]; see [3; Footnote 2].
References
- [1]
- M. M. Wilde and M.-H. Hsieh, “Entanglement boosts quantum turbo codes”, 2011 IEEE International Symposium on Information Theory Proceedings (2011) DOI
- [2]
- M. M. Wilde, M.-H. Hsieh, and Z. Babar, “Entanglement-Assisted Quantum Turbo Codes”, IEEE Transactions on Information Theory 60, 1203 (2014) arXiv:1010.1256 DOI
- [3]
- C.-Y. Lai, T. A. Brun, and M. M. Wilde, “Duality in Entanglement-Assisted Quantum Error Correction”, IEEE Transactions on Information Theory 59, 4020 (2013) arXiv:1302.4150 DOI
Page edit log
- Victor V. Albert (2023-05-06) — most recent
Cite as:
“EA quantum turbo code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/ea_turbo