|
| related topics |
| {let, theorem, proof} |
| {error, code, errors} |
| {operator, operators, space} |
| {states, state, optimal} |
|
Quantum shadow enumerators
E. M. Rains
abstract: In 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 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 ([quant-ph/9608006])) can be
shown to be optimal among all quantum codes. We also use the shadow machinery
to extend a bound on additive codes (E. M. Rains, manuscript in preparation) to
general codes, obtaining as a consequence that any code of length n can correct
at most floor((n+1)/6) errors.
- oai_identifier:
- oai:arXiv.org:quant-ph/9611001
- categories:
- quant-ph
- comments:
- AMSTeX, 10 pages, no figures, submitted to IEEE Trans. Inf. Theory
Updated 2/19/97 to reflect strengthening of the n/6 bound to impure codes, as
well as minor typographical changes and bibliographical updates
- arxiv_id:
- quant-ph/9611001
- journal_ref:
- IEEE Trans.Info.Theor. 45 (1999) 2361-2366
- created:
- 1996-11-01
- updated:
- 1997-02-19
Full article ▸
|
|
| related documents |
| 0006061v1 |
| 0304013v1 |
| 0606077v1 |
| 0006049v2 |
| 0211003v1 |
| 0208130v1 |
| 0002058v1 |
| 0406226v1 |
| 0308034v1 |
| 0402060v2 |
| 0208167v1 |
| 0101106v3 |
| 0312164v1 |
| 0701065v2 |
| 9711049v1 |
| 0211034v2 |
| 0512100v1 |
| 0107111v2 |
| 0012088v1 |
| 0210100v3 |
| 0503094v2 |
| 0703061v1 |
| 0202081v4 |
| 0411027v1 |
| 0504169v1 |
|