Upper bounds on the size of quantum codes

DOI10.1109/18.761270zbMath0958.94039arXivquant-ph/9709049OpenAlexW2114999643MaRDI QIDQ4701371

Alexei Ashikhmin, Simon N. 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

linear programmingboundsquantum error-correcting codesquantum MacWilliams identities

Mathematics Subject Classification ID

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

Related Items (9)

On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound ⋮ New constructions of entanglement-assisted quantum codes ⋮ Quantum codes from trace codes ⋮ Entanglement-assisted quantum MDS codes constructed from negacyclic codes ⋮ Weight enumerators for nonbinary asymmetric quantum codes and their applications ⋮ Dualities and identities for entanglement-assisted quantum codes ⋮ The asymptotic probability distribution of the relative distance of additive quantum codes ⋮ On subsystem codes beating the quantum Hamming or Singleton bound ⋮ Quantum codes from affine variety codes and their subfield-subcodes

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