On the iterative deconding of sparse quantum codes

MaRDI QIDQ3604070zbMATH OpenFDO

Authors David Poulin, Yeojin Chung

Publication date 24 February 2009

Full work available at URL https://arxiv.org/abs/0801.1241

zbMATH Keywords

quantum error correctionbelief propagationiterative decodinglow density parity check codessparse code

Mathematics Subject Classification ID

Quantum computation (81P68) Other types of codes (94B60)

Recommendations

• Feedback iterative decoding of sparse quantum codes
• Sparse-Graph Codes for Quantum Error Correction
• Belief propagation decoding of quantum channels by passing quantum messages
• Good codes based on very sparse matrices
• Decay of Correlations for Sparse Graph Error Correcting Codes

Cited in

(10)

• Belief propagation decoding of quantum channels by passing quantum messages
• Feedback iterative decoding of sparse quantum codes
• On quantum SPC product codes
• Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes
• On the hardnesses of several quantum decoding problems
• A class of quantum low-density parity check codes by combining seed graphs
• Quasi-cyclic constructions of asymmetric quantum error-correcting codes
• On the construction of stabilizer codes with an arbitrary binary matrix
• Sparse-Graph Codes for Quantum Error Correction
• Single-shot decoding of good quantum LDPC codes

This page was built for publication: On the iterative deconding of sparse quantum codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604070)