Asymptotics of the quantum Hamming bound for subsystem codes

Simple item page
dc.creatorKlappenecker, Andreas
dc.creatorSarvepalli, Pradeep Kiran
dc.date2007-10-23
dc.date.accessioned2026-07-07T08:38:06Z
dc.date.available2026-07-07T08:38:06Z
dc.descriptionAshikhmin and Litsyn showed that all binary stabilizer codes - pure or impure - of sufficiently large length obey the quantum Hamming bound, ruling out the possibility that impure codes of large length can outperform pure codes with respect to sphere packing. In contrast we show that impure subsystem codes do not obey the quantum Hamming bound for pure subsystem codes, not even asymptotically. We show that there exist arbitrarily long Bacon-Shor codes that violate the quantum Hamming bound.
dc.description2 pages
dc.identifierhttps://arxiv.org/abs/0710.4271
dc.identifierhttp://arxiv.org/abs/0710.4271
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/140605
dc.subjectQuantum Physics
dc.titleAsymptotics of the quantum Hamming bound for subsystem codes
dc.typetext

Files

Collections

arXiv