Quantum shadow enumerators
From MaRDI portal
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.
Recommendations
Cited in
(15)- Comments on the holographic description of Narain theories
- On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound
- Quantum error detection .II. Bounds
- Quantum stabilizer codes, lattices, and CFTs
- Weight enumerators for nonbinary asymmetric quantum codes and their applications
- Characterizing quantum states via sector lengths
- Optimal quantum error correcting codes from absolutely maximally entangled states
- Positive maps and trace polynomials from the symmetric group
- Monotonicity of the quantum linear programming bound
- Pauli manipulation detection codes and applications to quantum communication over adversarial channels
- Polynomial invariants of quantum codes
- Quantum error correcting codes from the compression formalism
- Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
- Quantum weight enumerators
- Upper bounds on the size of quantum codes
This page was built for publication: Quantum shadow enumerators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503434)
