Communication Links for Distributed Quantum Computation
IEEE Transactions on Computers
A new approach to constructing CSS codes based on factor graphs
Information Sciences: an International Journal
On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Fast quantum codes based on Pauli block jacket matrices
Quantum Information Processing
IEEE Transactions on Information Theory
Quantum LDPC codes with positive rate and minimum distance proportional to n 1/2
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Quantum error-correction codes based on multilevel constructions of hadamard matrices
ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
Quantum quasi-cyclic low-density parity-check codes
ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications
Efficient quantum stabilizer codes: LDPC and LDPC-convolutional constructions
IEEE Transactions on Information Theory
Quantum codes based on fast pauli block transforms in the finite field
Quantum Information Processing
Quantum Information Processing
A comparative code study for quantum fault tolerance
Quantum Information & Computation
On the iterative decoding of sparse quantum codes
Quantum Information & Computation
On the construction of stabilizer codes with an arbitrary binary matrix
Quantum Information Processing
Quantum Information Processing
A class of quantum low-density parity check codes by combining seed graphs
Quantum Information Processing
Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel
Quantum Information & Computation
| Hi-index | 754.96 |
Sparse-graph codes appropriate for use in quantum error-correction are presented. 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 block length. Third, sparse-graph codes often offer great flexibility with respect to block length and rate. We believe some of the codes we present are unsurpassed by previously published quantum error-correcting codes.