Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published November 1999 | Submitted + Published
Journal Article Open

Quantum shadow enumerators

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] errors.

Additional Information

© 1999 IEEE. Manuscript received November 20, 1996; revised January 12, 1999. The author wish to thank P. Shor and N. Sloane for many helpful discussions.

Attached Files

Published - 00796376.pdf

Submitted - 9611001.pdf

Files

00796376.pdf
Files (297.1 kB)
Name Size Download all
md5:78529cf224ca3d60630bbcf409b47c3c
150.6 kB Preview Download
md5:95753856194e9499eaf000b42b589e83
146.5 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
March 5, 2024