© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

IEEE International Conference on Quantum Computing and Engineering (QCE)

Performance of non-CSS LDGM-based quantum codes over the misidentified depolarizing channel

Patricio Fuentes, Josu Etxezarreta Martínez, Pedro M. Crespo, Javier Garcia‐Frias

Published Oct 1, 2020• 8 citations

Abstract

Quantum Low Density Generator Matrix (QLDGM) codes based on Calderbank-Steane-Shor (CSS) constructions have shown unprecedented error correction capabilities in the paradigm of quantum communication. Recently, a strategy based on non-CSS quantum codes derived from QLDGM CSS codes has been shown to surpass other Quantum Low Density Parity Check (QLDPC) schemes proposed in the literature over the depolarizing channel. Given the importance of quantum channel estimation and the impact it has on the performance of QLDPC codes, in this article, we study the behaviour of non-CSS QLDGM codes under the umbrella of channel mismatch. We begin by showing how a relatively accurate estimate of the quantum channel is pivotal for these codes to perform appropriately. We follow this by analyzing an off-line and an on-line quantum channel parameter estimation technique, as well as discussing how these methods affect the Quantum Error Correction (QEC) codes under consideration. Finally, we show how the on-line methodology yields similar performance to the perfect channel knowledge scenario despite its relative simplicity.

DOI: 10.1109/qce49297.2020.00022

Related papers

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•15 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

Design of low-density-generator-matrix–based quantum codes for asymmetric quantum channels

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

Quantum low-density-generator-matrix (QLDGM) codes are known to exhibit great error correction capabilities, surpassing existing quantum low-density-parity-check (QLDPC) codes and other sparse-graph schemes over the depolarizing channel. Most of the research on QLDPC codes and quantum error correction (QEC) is conducted for the symmetric instance of the generic Pauli channel, which incurs bit flips, phase flips, or a combination of both with the same probability. However, due to the behavior of the materials they are built from, some quantum devices must be modelled using a different channel model capable of accurately representing asymmetric scenarios in which the likelihood of a phase flip is higher than that of a bit flip. In this work, we study the design of QLDGM CSS codes for such Pauli channels. We show how codes tailored to the depolarizing channel are not well suited to these asymmetric environments and we derive methods to aptly design QLDGM CSS codes for this paradigm.

Physical Review A•Feb 26, 2021•9 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

Quantum CSS LDPC Codes based on Dyadic Matrices for Belief Propagation-based Decoding

Alessio Baldelli, Massimo Battaglioni, Jonathan Mandelbaum +2 more

Quantum low-density parity-check (QLDPC) codes provide a practical balance between error-correction capability and implementation complexity in quantum error correction (QEC). In this paper, we propose an algebraic construction based on dyadic matrices for designing both classical and quantum LDPC codes. The method first generates classical binary quasi-dyadic LDPC codes whose Tanner graphs have girth 6. It is then extended to the Calderbank-Shor-Steane (CSS) framework, where the two component parity-check matrices are built to satisfy the compatibility condition required by the recently introduced CAMEL-ensemble quaternary belief propagation decoder. This compatibility condition ensures that all unavoidable cycles of length 4 are assembled in a single variable node, allowing the mitigation of their detrimental effects by decimating that variable node.

cs.ITCross-listedarXiv:2601.08636•IEEE International Symposium on Information Theory (ISIT)•Jan 14, 2026•0 citations

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•13 citations

Quantum Low Density Generator Matrix (QLDGM) codes based on Calderbank-Steane-Shor (CSS) constructions have shown unprecedented error correction capabilities in the paradigm of quantum communication. Recently, a strategy based on non-CSS quantum codes derived from QLDGM CSS codes has been shown to surpass other Quantum Low Density Parity Check (QLDPC) schemes proposed in the literature over the depolarizing channel. Given the importance of quantum channel estimation and the impact it has on the performance of QLDPC codes, in this article, we study the behaviour of non-CSS QLDGM codes under the umbrella of channel mismatch. We begin by showing how a relatively accurate estimate of the quantum channel is pivotal for these codes to perform appropriately. We follow this by analyzing an off-line and an on-line quantum channel parameter estimation technique, as well as discussing how these methods affect the Quantum Error Correction (QEC) codes under consideration. Finally, we show how the on-line methodology yields similar performance to the perfect channel knowledge scenario despite its relative simplicity.

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 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 are known to exhibit great error correction capabilities, surpassing existing quantum low-density-parity-check (QLDPC) codes and other sparse-graph schemes over the depolarizing channel. Most of the research on QLDPC codes and quantum error correction (QEC) is conducted for the symmetric instance of the generic Pauli channel, which incurs bit flips, phase flips, or a combination of both with the same probability. However, due to the behavior of the materials they are built from, some quantum devices must be modelled using a different channel model capable of accurately representing asymmetric scenarios in which the likelihood of a phase flip is higher than that of a bit flip. In this work, we study the design of QLDGM CSS codes for such Pauli channels. We show how codes tailored to the depolarizing channel are not well suited to these asymmetric environments and we derive methods to aptly design QLDGM CSS codes for this paradigm.

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.

Quantum low-density parity-check (QLDPC) codes provide a practical balance between error-correction capability and implementation complexity in quantum error correction (QEC). In this paper, we propose an algebraic construction based on dyadic matrices for designing both classical and quantum LDPC codes. The method first generates classical binary quasi-dyadic LDPC codes whose Tanner graphs have girth 6. It is then extended to the Calderbank-Shor-Steane (CSS) framework, where the two component parity-check matrices are built to satisfy the compatibility condition required by the recently introduced CAMEL-ensemble quaternary belief propagation decoder. This compatibility condition ensures that all unavoidable cycles of length 4 are assembled in a single variable node, allowing the mitigation of their detrimental effects by decimating that variable node.

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.