Duality in Entanglement-Assisted Quantum Error Correction
arXiv:1302.4150 · doi:10.1109/TIT.2013.2246274
Abstract
The dual of an entanglement-assisted quantum error-correcting (EAQEC) code is defined from the orthogonal group of a simplified stabilizer group. From the Poisson summation formula, this duality leads to the MacWilliams identities and linear programming bounds for EAQEC codes. We establish a table of upper and lower bounds on the minimum distance of any maximal-entanglement EAQEC code with length up to 15 channel qubits.
This paper is a compact version of arXiv:1010.5506
References in corpus (4)
Cited by in corpus (14)
- Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators
- New entanglement-assisted MDS quantum codes from constacyclic codes
- On the MacWilliams Identity for Classical and Quantum Convolutional Codes
- Entanglement-assisted concatenated quantum codes
- Two families of Entanglement-assisted quantum MDS codes from constacyclic codes
- Optimal Quaternary Hermitian LCD codes
- Entanglement-assisted quantum MDS codes from constacyclic codes with large minimum distance
- Linear programming bounds for quantum amplitude damping codes
- Linear programming bounds for quantum channels acting on quantum error-correcting codes
- Two families of Entanglement-assisted Quantum MDS Codes from cyclic Codes
- Optimal Ternary Linear Complementary Dual Codes
- Semidefinite programming bounds on the size of entanglement-assisted codeword stabilized quantum codes
- New Classes of Entanglement-assisted Quantum MDS Codes
- New entanglement-assisted quantum MDS codes with length