Quantum shadow enumerators
- 1 January 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (7) , 2361-2366
- https://doi.org/10.1109/18.796376
Abstract
In a previous paper, Shor and Laflamme (see Phys. Rev. Lett., vol.78, p.1600-02, 1997) define two “weight enumerators” for quantum error-correcting codes, connected by a MacWilliams (1977) transform, and use them to give a linear-programming bound for quantum codes. We extend their work by introducing another enumerator, based on the classical theory of shadow codes, that tightens their bounds significantly. In particular, nearly all of the codes known to be optimal among additive quantum codes (codes derived from orthogonal geometry) can be shown to be optimal among all quantum codes. We also use the shadow machinery to extend a bound on additive codes to general codes, obtaining as a consequence that any code of length, can correct at most [(n+1)/6] errorsKeywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Quantum error correction via codes over GF(4)IEEE Transactions on Information Theory, 1998
- Quantum weight enumeratorsIEEE Transactions on Information Theory, 1998
- Shadow bounds for self-dual codesIEEE Transactions on Information Theory, 1998
- Quantum Analog of the MacWilliams Identities for Classical Coding TheoryPhysical Review Letters, 1997
- Theory of quantum error-correcting codesPhysical Review A, 1997
- A new upper bound on the minimal distance of self-dual codesIEEE Transactions on Information Theory, 1990