LDGM-Based Quantum Codes for Fault-Tolerant Quantum Computation
Abstract
We construct a new family of Calderbank-Shor-Steane (CSS) codes using the generator and parity-check matrices of Low-Density Generator Matrix (LDGM) codes, with row operations applied to both matrices in order to achieve the desired quantum rate. Decoding is performed in an iterative manner, by applying message passing over the associated graph, and discrete Density Evolution (DDE) is used to optimize performance in the depolarizing channel. The proposed construction offers high flexibility and ...
Description / Details
We construct a new family of Calderbank-Shor-Steane (CSS) codes using the generator and parity-check matrices of Low-Density Generator Matrix (LDGM) codes, with row operations applied to both matrices in order to achieve the desired quantum rate. Decoding is performed in an iterative manner, by applying message passing over the associated graph, and discrete Density Evolution (DDE) is used to optimize performance in the depolarizing channel. The proposed construction offers high flexibility and easiness in the design, producing quantum codes that possess excellent error correction capabilities. By properly designing the structure of the code, we are able to control and bound the weight of the stabilizer generators to a small value, which results in codes particularly well suited for fault-tolerant quantum computation. At the same time, these codes achieve very good performance in terms of error correction capability.
Source: arXiv:2607.15159v1 - http://arxiv.org/abs/2607.15159v1 PDF: https://arxiv.org/pdf/2607.15159v1 Original Link: http://arxiv.org/abs/2607.15159v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Jul 17, 2026
Quantum Computing
Quantum Physics
0