# Log-Domain Decoding of Quantum LDPC Codes Over Binary Finite Fields

@article{Kuo2021LogDomainDO,
title={Log-Domain Decoding of Quantum LDPC Codes Over Binary Finite Fields},
author={Kao-Yueh Kuo and C. Lai},
journal={IEEE Transactions on Quantum Engineering},
year={2021},
volume={2},
pages={1-15}
}
• Published 1 April 2021
• Computer Science, Mathematics, Physics
• IEEE Transactions on Quantum Engineering
A quantum stabilizer code over <inline-formula><tex-math notation="LaTeX">$\operatorname{GF}(q)$</tex-math></inline-formula> corresponds to a classical additive code over <inline-formula><tex-math notation="LaTeX">$\operatorname{GF}(q^2)$</tex-math></inline-formula> that is self-orthogonal with respect to a symplectic inner product. We study the decoding of quantum low-density parity-check (LDPC) codes over binary finite fields <inline-formula><tex-math notation="LaTeX">$\operatorname{GF}(q=2^l… 2 Citations ## Figures from this paper Trapping Sets of Quantum LDPC Codes • Computer Science, Mathematics Quantum • 2021 This paper establishes a systematic methodology by which one can identify and classify quantum trapping sets (QTSs) according to their topological structure and decoder used, and shows that the knowledge of QTSs can be used to design better QLDPC codes and decoders. Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes • Computer Science, Physics ArXiv • 2021 This paper proposes a decoding algorithm for quantum codes based on quaternary BP but with additional memory effects (called MBP), like a recursive neural network with inhibition between neurons (edges with negative weights) during recursion, which enhances the network’s perception capability. ## References SHOWING 1-10 OF 66 REFERENCES Modified belief propagation decoders for quantum low-density parity-check codes • Physics, Mathematics Physical Review A • 2019 Quantum low-density parity-check codes can be decoded using a syndrome based$\mathrm{GF}(4)$belief propagation decoder. However, the performance of this decoder is limited both by unavoidable Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)\$
• Mathematics, Computer Science
IEEE Transactions on Communications
• 2007
This letter addresses the problem of decoding nonbinary low-density parity-check (LDPC) codes over finite fields GF(q), with reasonable complexity and good performance, and introduces a simplified decoder which is inspired by the min-sum decoder for binary LDPC codes.
Nonbinary Stabilizer Codes Over Finite Fields
• Mathematics, Physics
IEEE Transactions on Information Theory
• 2006
The basic theory of stabilizer codes over finite fields is described and a Galois theory for these objects is introduced, which generalizes the well-known notion of additive codes over F4 of the binary case.
Degenerate Quantum LDPC Codes With Good Finite Length Performance
• Physics, Computer Science
Quantum
• 2021
It is shown that with the help of OSD-like post-processing the performance of the standard belief propagation (BP) decoder on many QLDPC codes can be improved by several orders of magnitude.
Quantum Kronecker sum-product low-density parity-check codes with finite rate
• Physics
• 2013
We introduce a "hyperbicycle" ansatz for quantum codes which gives the hypergraph-product (generalized toric) codes by Tillich and Z\'emor and generalized bicycle codes by MacKay et al. as limiting
Trapping Sets of Quantum LDPC Codes
• Computer Science, Mathematics
Quantum
• 2021
This paper establishes a systematic methodology by which one can identify and classify quantum trapping sets (QTSs) according to their topological structure and decoder used, and shows that the knowledge of QTSs can be used to design better QLDPC codes and decoders.
Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes
• Computer Science, Physics
ArXiv
• 2021
This paper proposes a decoding algorithm for quantum codes based on quaternary BP but with additional memory effects (called MBP), like a recursive neural network with inhibition between neurons (edges with negative weights) during recursion, which enhances the network’s perception capability.
Reduced-complexity decoding of LDPC codes
• Mathematics, Computer Science
IEEE Transactions on Communications
• 2005
The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from performance, latency, computational-complexity, and memory-requirement perspectives.
Fifteen Years of Quantum LDPC Coding and Improved Decoding Strategies
• Mathematics, Computer Science
IEEE Access
• 2015
This paper conceive a modified non-binary decoding algorithm for homogeneous Calderbank-Shor-Steane-type QLDPC codes, which is capable of alleviating the problems imposed by the unavoidable length-four cycles.
Low-density parity check codes over GF(q)
• Mathematics, Computer Science
IEEE Communications Letters
• 1998
A significant improvement over the performance of the binary codes is found, including a rate 1/4 code with bit error probability <10/sup -5/ at E/sub b//N/sub 0/=0.2 dB.