Homological Error Correction: Classical and Quantum Codes TeX Export

@article{citeulike:5998472, abstract = {We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming bound. In the quantum case, we show that for non-orientable surfaces it is impossible to construct homological codes based on qudits of dimension \$D\>2\$, while for orientable surfaces with boundaries it is possible to construct them for arbitrary dimension \$D\$. We give a method to obtain planar homological codes based on the construction of quantum codes on compact surfaces without boundaries. We show how the original Shor's 9-qubit code can be visualized as a homological quantum code. We study the problem of constructing quantum codes with optimal encoding rate. In the particular case of toric codes we construct an optimal family and give an explicit proof of its optimality. For homological quantum codes on surfaces of arbitrary genus we also construct a family of codes asymptotically attaining the maximum possible encoding rate. We provide the tools of homology group theory for graphs embedded on surfaces in a self-contained manner.}, archivePrefix = {arXiv}, author = {Bombin, H. and Martin-Delgado, M. A.}, citeulike-article-id = {5998472}, citeulike-linkout-0 = {http://arxiv.org/abs/quant-ph/0605094}, citeulike-linkout-1 = {http://arxiv.org/pdf/quant-ph/0605094}, citeulike-linkout-2 = {http://dx.doi.org/10.1063/1.2731356}, day = {10}, doi = {10.1063/1.2731356}, eprint = {quant-ph/0605094}, keywords = {codes, topological}, month = {May}, posted-at = {2009-10-23 20:26:36}, priority = {3}, title = {Homological Error Correction: Classical and Quantum Codes}, url = {http://dx.doi.org/10.1063/1.2731356}, year = {2006} }

TY - JOUR ID - citeulike:5998472 L3 - citeulike-article-id:5998472 N2 - We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming bound. In the quantum case, we show that for non-orientable surfaces it is impossible to construct homological codes based on qudits of dimension $D>2$, while for orientable surfaces with boundaries it is possible to construct them for arbitrary dimension $D$. We give a method to obtain planar homological codes based on the construction of quantum codes on compact surfaces without boundaries. We show how the original Shor's 9-qubit code can be visualized as a homological quantum code. We study the problem of constructing quantum codes with optimal encoding rate. In the particular case of toric codes we construct an optimal family and give an explicit proof of its optimality. For homological quantum codes on surfaces of arbitrary genus we also construct a family of codes asymptotically attaining the maximum possible encoding rate. We provide the tools of homology group theory for graphs embedded on surfaces in a self-contained manner. TI - Homological Error Correction: Classical and Quantum Codes KW - codes KW - topological AU - Bombin, H AU - Martin-Delgado, MA PY - 2006/May/10/ UR - http://dx.doi.org/10.1063/1.2731356 ER -