Upper bounds on the size of quantum codes

DOI10.1109/18.761270MaRDI QIDQ4701371zbMATH OpenOpenAlexFDO

Authors Alexei Ashikhmin, Simon Litsyn

Publication date 21 November 1999

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/9709049

zbMATH Keywords

boundslinear programmingquantum error-correcting codesquantum MacWilliams identities

Mathematics Subject Classification ID

Quantum computation (81P68) Other types of codes (94B60) Bounds on codes (94B65)

Abstract: Several upper bounds on the size of quantum codes are derived using the linear programming approach. These bounds are strengthened for the linear quantum codes.

Recommendations

• Quantum error detection .II. Bounds
• Monotonicity of the quantum linear programming bound
• Quantum shadow enumerators

Cited in

(15)

• Entanglement-assisted quantum MDS codes constructed from negacyclic codes
• Maximality of quantum error-correcting code spaces
• New constructions of entanglement-assisted quantum codes
• Weight enumerators for nonbinary asymmetric quantum codes and their applications
• Quantum codes from affine variety codes and their subfield-subcodes
• Dualities and identities for entanglement-assisted quantum codes
• The asymptotic probability distribution of the relative distance of additive quantum codes
• On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound
• Strengthened quantum Hamming bound
• Quantum shadow enumerators
• Monotonicity of the quantum linear programming bound
• Quantum error detection .II. Bounds
• On subsystem codes beating the quantum Hamming or Singleton bound
• Quantum codes from trace codes
• Construction of good cyclic codes and quantum error correcting codes using reversed Dickson polynomials

This page was built for publication: Upper bounds on the size of quantum codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701371)