Published July 1998
| Submitted + Published
Journal Article
Open
Quantum weight enumerators
- Creators
- Rains, Eric M.
Abstract
In a recent paper, Shor and Laflamme (see Phys. Rev. Lett., vol.78, p.1600-2, 1997) defined two "weight enumerators" for quantum error-correcting codes, connected by a MacWilliams transform, and used them to give a linear programming bound for quantum codes. We introduce two new enumerators which, while much less powerful at producing bounds, are useful tools nonetheless. The new enumerators are connected by a much simpler duality transform, clarifying the duality between Shor and Laflamme's enumerators. We also use the new enumerators to give a simpler condition for a quantum code to have specified minimum distance, and to extend the enumerator theory to codes with block size greater than 2.
Additional Information
© 1998 IEEE. Manuscript received December 20, 1996; revised December 31, 1997. The author wishes to thank P. Shor and N. Sloane for many helpful discussions; he would also like to thank C. Bennett for a helpful discussion on erasures.Attached Files
Published - 00681316.pdf
Submitted - 9612015.pdf
Files
00681316.pdf
Files
(557.8 kB)
Name | Size | Download all |
---|---|---|
md5:8775cfc546c5132712c50e9d2678dfbd
|
399.9 kB | Preview Download |
md5:a8a44d744bed29d9638fc8ee6f3420b7
|
157.9 kB | Preview Download |
Additional details
- Eprint ID
- 81818
- Resolver ID
- CaltechAUTHORS:20170925-154039545
- Created
-
2017-09-25Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field