Sparse-Graph Codes for Quantum Error Correction
From MaRDI portal
Abstract: 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.
Recommendations
Cited in
(32)- Fast quantum codes based on Pauli block jacket matrices
- On the construction of stabilizer codes with an arbitrary binary matrix
- Explicit error syndrome calculation for quantum graph codes
- On quantum SPC product codes
- A performance analysis of quantum low-density parity-check codes for correcting correlated errors
- Quantum stabilizer codes, lattices, and CFTs
- New constructions of quantum stabilizer codes based on difference sets
- Nested quantum error correction codes via subgraphs
- A new approach to constructing CSS codes based on factor graphs
- On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound
- Bounding the distance of quantum surface codes
- New class of quantum codes constructed from cyclic difference set
- Graphical quantum error-correcting codes based on entanglement of subgraphs
- Sparse quantum codes from quantum circuits
- A construction of quantum turbo product codes based on CSS-type quantum convolutional codes
- Feedback iterative decoding of sparse quantum codes
- Decay of Correlations for Sparse Graph Error Correcting Codes
- Entanglement-assisted quantum error-correcting codes constructed from irregular repeat accumulate codes
- A class of quantum low-density parity check codes by combining seed graphs
- Polar quantum channel coding with optical multi-qubit entangling gates for capacity-achieving channels
- On the iterative deconding of sparse quantum codes
- Graphical quantum low-density parity-check codes
- NEW QUANTUM CODES CONSTRUCTED FROM A CLASS OF IMPRIMITIVE BCH CODES
- On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction
- Hypermap-homology quantum codes
- Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes
- Quantum codes based on fast Pauli block transforms in the finite field
- Fast constructions of quantum codes based on residues Pauli block matrices
- Some quantum synchronizable codes with explicit distance
- Syndrome decoding by quantum approximate optimization
- Absorbing sets in quantum LDPC codes
- Error-correcting codes and cryptography
This page was built for publication: Sparse-Graph Codes for Quantum Error Correction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547332)
