We present sparse graph codes appropriate for use in quantum error-correction.
Quantum error-correcting codes based on sparse graphs are of interest for three reasons. First, the best codes currently known for classical channels are based on sparse graphs. Second, sparse graph codes keep the number of quantum interactions associated with the quantum error correction process small: a constant number per quantum bit, independent of the blocklength. Third, sparse graph codes often offer great flexibility with respect to blocklength and rate.
We believe some of the codes we present are unsurpassed by previously published quantum error-correcting codes.
Journal submission (35 pages, large font): qecc.ps.gz. qecc.pdf. | <- UK | Canada -> | qecc.ps.gz. qecc.pdf.
Journal version (18 pages, double column, small font):
| <- UK | Canada -> | qecc.ps.gz.
To appear in IEEE Transactions on Information Theory
Extended version (40 pages, large font):
| <- UK | Canada -> | qeccE.ps.gz.
quant-ph/0304161. Extended version of paper submitted to IEEE Transactions on Information Theory.
All postscript files are compressed with gzip - see this page for advice about gzip, if needed.