Graphical Quantum Error-Correcting Codes
| dc.creator | Yu, Sixia | |
| dc.creator | Chen, Qing | |
| dc.creator | Oh, C. H. | |
| dc.date | 2007-09-12 | |
| dc.date.accessioned | 2026-07-07T08:29:02Z | |
| dc.date.available | 2026-07-07T08:29:02Z | |
| dc.description | We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes, which are potentially more efficient, is not as well understood as that of stabilizer codes. Our graphical approach provides a unified and classical way to construct both stabilizer and nonadditive codes. In particular we have explicitly constructed the optimal ((10,24,3)) code and a family of 1-error detecting nonadditive codes with the highest encoding rate so far. In the case of stabilizer codes a thorough search becomes tangible and we have classified all the extremal stabilizer codes up to 8 qubits. | |
| dc.description | 7 pages and 3 figures | |
| dc.identifier | https://arxiv.org/abs/0709.1780 | |
| dc.identifier | http://arxiv.org/abs/0709.1780 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/137827 | |
| dc.subject | Quantum Physics | |
| dc.title | Graphical Quantum Error-Correcting Codes | |
| dc.type | text |