Subsystem Codes

Simple item page
dc.creatorAly, Salah A.
dc.creatorKlappenecker, Andreas
dc.creatorSarvepalli, Pradeep Kiran
dc.date2006-10-18
dc.date.accessioned2026-07-07T08:17:14Z
dc.date.available2026-07-07T08:17:14Z
dc.descriptionWe investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem codes using a counting argument similar to the quantum Gilbert-Varshamov bound. We derive linear programming bounds and other upper bounds. We answer the question whether or not there exist [[n,n-2d+2,r>0,d]]<sub>q</sub> subsystem codes. Finally, we compare stabilizer and subsystem codes with respect to the required number of syndrome qudits.
dc.description8 pages; 44th Allerton Conference
dc.identifierhttps://arxiv.org/abs/quant-ph/0610153
dc.identifierhttp://arxiv.org/abs/quant-ph/0610153
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134058
dc.subjectQuantum Physics
dc.subjectInformation Theory
dc.titleSubsystem Codes
dc.typetext

Files

Collections

arXiv