Two infinite families of nonadditive quantum error-correcting codes

Simple item page
dc.creatorYu, Sixia
dc.creatorChen, Qing
dc.creatorOh, C. H.
dc.date2009-01-14
dc.date.accessioned2026-07-07T12:29:28Z
dc.date.available2026-07-07T12:29:28Z
dc.descriptionWe construct explicitly two infinite families of genuine nonadditive 1-error correcting quantum codes and prove that their coding subspaces are 50% larger than those of the optimal stabilizer codes of the same parameters via the linear programming bound. All these nonadditive codes can be characterized by a stabilizer-like structure and thus their encoding circuits can be designed in a straightforward manner.
dc.description4 pages with 1 figure and 1 table
dc.identifierhttps://arxiv.org/abs/0901.1935
dc.identifierhttp://arxiv.org/abs/0901.1935
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/215888
dc.subjectQuantum Physics
dc.titleTwo infinite families of nonadditive quantum error-correcting codes
dc.typetext

Files

Collections

arXiv