Trapping Sets of Quantum LDPC Codes
arXiv:2012.15297 · doi:10.22331/q-2021-10-14-562
Abstract
Iterative decoders for finite length quantum low-density parity-check (QLDPC) codes are attractive because their hardware complexity scales only linearly with the number of physical qubits. However, they are impacted by short cycles, detrimental graphical configurations known as trapping sets (TSs) present in a code graph as well as symmetric degeneracy of errors. These factors significantly degrade the decoder decoding probability performance and cause so-called error floor. In this paper, we establish a systematic methodology by which one can identify and classify quantum trapping sets (QTSs) according to their topological structure and decoder used. The conventional definition of a TS from classical error correction is generalized to address the syndrome decoding scenario for QLDPC codes. We show that the knowledge of QTSs can be used to design better QLDPC codes and decoders. Frame error rate improvements of two orders of magnitude in the error floor regime are demonstrated for some practical finite-length QLDPC codes without requiring any post-processing.
arXiv commentRevised version - 19 pages, 12 figures - Accepted for publication in Quantum
References in corpus (16)
- Good Quantum Error-Correcting Codes Exist
- Sparse Graph Codes for Quantum Error-Correction
- Degenerate Quantum LDPC Codes With Good Finite Length Performance
- Decoding Across the Quantum LDPC Code Landscape
- Quantum LDPC Codes with Almost Linear Minimum Distance
- Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
- Quantum "hyperbicycle" low-density parity check codes with finite rate
- Quantum Expander Codes
- Quantum Quasi-Cyclic LDPC Codes
- Improved quantum hypergraph-product LDPC codes
- Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes
- Enhanced Feedback Iterative Decoding of Sparse Quantum Codes
- The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
- On the logical operators of quantum codes
- Modified belief propagation decoders for quantum low-density parity-check codes
- Log-domain decoding of quantum LDPC codes over binary finite fields
Cited by in corpus (5)
- Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes
- Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound
- Tailoring three-dimensional topological codes for biased noise
- Generalized Belief Propagation Algorithms for Decoding of Surface Codes
- Decoding of Quantum Data-Syndrome Codes via Belief Propagation