Quantum weight 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 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.
Recommendations
Cited in
(26)- Quantum stabilizer codes, lattices, and CFTs
- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
- MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes
- Weight enumerators for nonbinary asymmetric quantum codes and their applications
- Inhomogeneous quantum codes. III: The asymmetric case
- Dualities and identities for entanglement-assisted quantum codes
- Probabilities of failure for quantum error correction
- New monogamy relations for multiqubit systems
- Nonadditive quantum error-correcting code
- Some Ulam's reconstruction problems for quantum states
- Quantum shadow enumerators
- Polynomial invariants of quantum codes
- Quantum error detection .I. Statement of the problem
- Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
- Positive maps and trace polynomials from the symmetric group
- Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)
- Quantum error-correcting codes and their geometries
- Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
- New quantum codes and entanglement-assisted quantum codes from repeated-root cyclic codes of length 2rp^s
- Structure theorem for quantum replacer codes
- Four-qubit critical states
- Three MacWilliams type identities and quantum error-correcting G-codes
- New EAQEC codes from LCP of codes over finite non-chain rings
- AMDS codes and quantum AMDS codes of length \(3p^s\) over \(\mathbb{F}_{p^m}\)
- Detecting entanglement from few partial transpose moments and their decay via weight enumerators
- Some constructions of quantum MDS codes
This page was built for publication: Quantum weight enumerators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701111)
