Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Conference on Information Sciences and Systems

Asymptotic analysis of LDGM-based quantum codes

Kejing Liu, Javier Garcia‐Frias

Published Mar 1, 2009• 2 citations
Publisher

Abstract

We study the error floor performance of a proposed family of LDGM-based quantum codes. LDGM-based quantum codes are Calderbank-Shor-Steane (CSS) codes based on the generator and parity-check matrices of a classical LDGM code. Decoding is performed in an iterative manner, by applying message passing over the corresponding graphs. The proposed codes allow greater flexibility and are easier to design than existing sparse-graph CSS quantum codes, while leading to better performance.

DOI
10.1109/ciss.2009.5054696

Related papers

Design of near-optimum quantum error-correcting codes based on generator and parity-check matrices of LDGM codes

Javier Garcia‐Frias, Kejing Liu

We study the design of near-optimum quantum error correcting codes based on the use of sparse matrices. The basic idea is to construct a Calderbank-Shor-Steane (CSS) code based on the generator and parity-check matrices of a classical channel code with low density generator matrix (LDGM code), which is designed with a specific structure inspired in the parallel concatenation of regular LDGM codes. Then, row operations are performed in both matrices to achieve the desired quantum rate. Decoding is performed in an iterative manner, by applying message passing over the corresponding graphs. The proposed codes allow greater flexibility and are easier to design than existing sparse-graph quantum codes, while leading to better performance.

Conference on Information Sciences and Systems•Mar 1, 2008•14 citations

LDGM-Based Quantum Codes for Fault-Tolerant Quantum Computation

Yumin Li, Kejing Liu, Hanqing Lou +1 more

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.

quant-pharXiv:2607.15159•Jul 17, 2026•0 citations

Approach for the construction of non-Calderbank-Steane-Shor low-density-generator-matrix–based quantum codes

Patricio Fuentes, Josu Etxezarreta Martínez, Pedro M. Crespo +1 more

Quantum low-density generator matrix (QLDGM) codes based on Calderbank-Steane-Shor (CSS) constructions have shown unprecedented error correction capabilities, displaying much improved performance in comparison to other sparse-graph codes. However, the nature of CSS designs and the manner in which they must be decoded limit the performance that is attainable with codes that are based on this construction. This motivates the search for quantum code design strategies capable of avoiding the drawbacks associated with CSS codes. In this article, we introduce non-CSS quantum code constructions based on classical LDGM codes. The proposed codes are derived from CSS QLDGM designs by performing specific row operations on their quantum parity check matrices to modify the associated decoding graphs. The application of this method results in performance improvements in comparison to CSS QLDGM codes, while also allowing for greater flexibility in the design process. The proposed non-CSS QLDGM scheme outperforms the best quantum low-density parity check codes that have appeared in the literature.

Physical Review A•Jul 22, 2020•18 citations

On the Application of Error-Correcting Codes with Low-Density Generator Matrix over Different Quantum Channels

Hanqing Lou, Javier Garcia‐Frias

We propose the use of linear codes with low-density generator matrix in the context of error correction over different quantum channels. The basic idea is to construct a Calderbank-Shor-Steane (CSS) code based on the generator matrix and the parity-check matrix of an LDGM code, applying row operations in both matrices to achieve the desired quantum rate. Decoding is performed in an iterative manner, using message passing over the corresponding graphs. The proposed codes allow greater flexibility and are easier to design than existing sparse-graph quantum codes, while leading to better performance.

•Apr 3, 2006•23 citations

Achievability of CSS codes performance limits over Pauli channels under separate ML decoding with bounded graphical complexity

Gulnihal Mercanoglu, Achilleas Anastasopoulos, S. Sandeep Pradhan

Capacity-approaching quantum error correction faces a fundamental tension: the required parity-check matrices need to become increasingly dense, while practical decoding and syndrome extraction favor sparse, bounded-degree structures. Reconciling these competing requirements remains an important open problem in quantum code design. We construct Calderbank-Shor-Steane (CSS) code ensembles that approach the CSS rate over memoryless Pauli channels under maximum-likelihood decoding while retaining sparse, bounded-degree graphical representations. The construction separates parity-check density from graphical complexity: although capacity-approaching components may require dense parity-check matrices, they are represented by sparse concatenated factor graphs. We first study a construction combining low-density parity-check (LDPC) and low-density generator-matrix (LDGM) component codes and numerically analyze the average weight distributions of the resulting codes. Motivated by these results, we introduce a second construction based on concatenated LDPC and LDGM codes and generalized irregular repeat-accumulate (GIRA) codes. We derive bounds on the average weight distribution of the resulting sum ensemble and use the Miller-Burshtein framework to prove simultaneous reliability of the two CSS decoding components. Consequently, the proposed ensemble achieves rates arbitrarily close to the CSS hashing bound under separate bit- and phase-error correction, while maintaining bounded graphical complexity, thus providing a foundation for future iterative decoders and indirect syndrome-extraction architectures.

cs.ITCross-listedarXiv:2611.02339•Nov 3, 2026•0 citations

Optimization of LDGM-based quantum codes using Density Evolution

Kejing Liu, Javier Garcia‐Frias

We introduce the use of Discrete Density Evolution (DDE) to optimize LDGM-based quantum codes. These are Calderbank-Shor-Steane (CSS) codes based on the generator and parity-check matrices of an LDGM code, which is designed with a specific structure inspired in the parallel concatenation of LDGM codes. The proposed codes allow greater flexibility and are easier to design than existing sparse-graph CSS quantum codes, while leading to better performance.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2010•6 citations
We study the error floor performance of a proposed family of LDGM-based quantum codes. LDGM-based quantum codes are Calderbank-Shor-Steane (CSS) codes based on the generator and parity-check matrices of a classical LDGM code. Decoding is performed in an iterative manner, by applying message passing over the corresponding graphs. The proposed codes allow greater flexibility and are easier to design than existing sparse-graph CSS quantum codes, while leading to better performance.
We study the design of near-optimum quantum error correcting codes based on the use of sparse matrices. The basic idea is to construct a Calderbank-Shor-Steane (CSS) code based on the generator and parity-check matrices of a classical channel code with low density generator matrix (LDGM code), which is designed with a specific structure inspired in the parallel concatenation of regular LDGM codes. Then, row operations are performed in both matrices to achieve the desired quantum rate. Decoding is performed in an iterative manner, by applying message passing over the corresponding graphs. The proposed codes allow greater flexibility and are easier to design than existing sparse-graph quantum codes, while leading to better performance.
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.
Quantum low-density generator matrix (QLDGM) codes based on Calderbank-Steane-Shor (CSS) constructions have shown unprecedented error correction capabilities, displaying much improved performance in comparison to other sparse-graph codes. However, the nature of CSS designs and the manner in which they must be decoded limit the performance that is attainable with codes that are based on this construction. This motivates the search for quantum code design strategies capable of avoiding the drawbacks associated with CSS codes. In this article, we introduce non-CSS quantum code constructions based on classical LDGM codes. The proposed codes are derived from CSS QLDGM designs by performing specific row operations on their quantum parity check matrices to modify the associated decoding graphs. The application of this method results in performance improvements in comparison to CSS QLDGM codes, while also allowing for greater flexibility in the design process. The proposed non-CSS QLDGM scheme outperforms the best quantum low-density parity check codes that have appeared in the literature.
We propose the use of linear codes with low-density generator matrix in the context of error correction over different quantum channels. The basic idea is to construct a Calderbank-Shor-Steane (CSS) code based on the generator matrix and the parity-check matrix of an LDGM code, applying row operations in both matrices to achieve the desired quantum rate. Decoding is performed in an iterative manner, using message passing over the corresponding graphs. The proposed codes allow greater flexibility and are easier to design than existing sparse-graph quantum codes, while leading to better performance.
Capacity-approaching quantum error correction faces a fundamental tension: the required parity-check matrices need to become increasingly dense, while practical decoding and syndrome extraction favor sparse, bounded-degree structures. Reconciling these competing requirements remains an important open problem in quantum code design. We construct Calderbank-Shor-Steane (CSS) code ensembles that approach the CSS rate over memoryless Pauli channels under maximum-likelihood decoding while retaining sparse, bounded-degree graphical representations. The construction separates parity-check density from graphical complexity: although capacity-approaching components may require dense parity-check matrices, they are represented by sparse concatenated factor graphs. We first study a construction combining low-density parity-check (LDPC) and low-density generator-matrix (LDGM) component codes and numerically analyze the average weight distributions of the resulting codes. Motivated by these results, we introduce a second construction based on concatenated LDPC and LDGM codes and generalized irregular repeat-accumulate (GIRA) codes. We derive bounds on the average weight distribution of the resulting sum ensemble and use the Miller-Burshtein framework to prove simultaneous reliability of the two CSS decoding components. Consequently, the proposed ensemble achieves rates arbitrarily close to the CSS hashing bound under separate bit- and phase-error correction, while maintaining bounded graphical complexity, thus providing a foundation for future iterative decoders and indirect syndrome-extraction architectures.