Quantum Weight Enumerators

Simple item page
dc.creatorRains, Eric M.
dc.date1996-12-02
dc.date.accessioned2026-07-07T06:14:05Z
dc.date.available2026-07-07T06:14:05Z
dc.descriptionIn a recent paper ([quant-ph/9610040]), Shor and Laflamme define two ``weight enumerators'' for quantum error correcting codes, connected by a MacWilliams transform, and use 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.
dc.description15 pages, AMSTeX, no figures
dc.identifierhttps://arxiv.org/abs/quant-ph/9612015
dc.identifierhttp://arxiv.org/abs/quant-ph/9612015
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93330
dc.subjectQuantum Physics
dc.titleQuantum Weight Enumerators
dc.typetext

Files

Collections

arXiv