Sharp Error-Rate Transitions in Quantum QC-LDPC Codes under Joint BP Decoding
By: Daiki Komoto, Kenta Kasai
Potential Business Impact:
Fixes errors in quantum computers better.
In this study, we report that quantum quasi-cyclic low-density parity-check codes decoded via joint belief propagation (BP) exhibit steep error-rate curves, despite the presence of error floors. To the best of our knowledge, this is the first observation of such threshold-like behavior for quantum LDPC codes with non-vanishing coding rate, excluding those decoded with non-binary BP decoders. Moreover, we find that dominant error events contributing to the error floor typically involve only a small number of bits. These findings suggest that the error floor is caused by trapping sets--specific subgraph structures in the Tanner graph--and indicate that identifying and avoiding such structures may lead to further reduction of the error floor.
Similar Papers
Linear Time Iterative Decoders for Hypergraph-Product and Lifted-Product Codes
Information Theory
Fixes quantum computers to work better.
Pseudocodewords of quantum, quasi-cyclic, and spatially-coupled LDPC codes: a fundamental cone perspective
Information Theory
Finds hidden errors in digital messages.
Quantum Low-Density Parity-Check Codes
Quantum Physics
Makes quantum computers work without errors.