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

IEEE International Symposium on Information Theory (ISIT)

A family of quantum codes with performances close to the hashing bound under iterative decoding

Denise Maurice, Jean–Pierre Tillich, Iryna Andriyanova

Published Jul 1, 2013• 8 citations
Publisher

Abstract

We propose here a new construction of quantum codes combining an improved version of a family of spatially coupled quantum LDPC codes, suggested in [1], with a family of error reducing turbo-codes of [2]. This new construction displays outstanding performances under iterative decoding for noise levels very close to the hashing bound, without needing qubits, protected from noise as in [1].

DOI
10.1109/isit.2013.6620358

Related papers

Quantum turbo codes with unbounded minimum distance and excellent error-reducing performance

Mamdouh Abbara, Jean–Pierre Tillich

We construct here a new family of quantum codes related to serial turbo-codes which are excellent error-reducing codes under iterative decoding for very large channel noise values. Moreover we also show that this family of codes has unbounded minimum distance.

IEEE Information Theory Workshop (ITW)•Oct 1, 2011•3 citations

Spatially coupled quantum LDPC codes

Iryna Andriyanova, Denise Maurice, Jean–Pierre Tillich

We propose here a new construction of spatially coupled quantum LDPC codes using a small amount of entangled qubit pairs shared between the encoder and the decoder which improves quite significantly all other constructions of quantum LDPC codes or turbo-codes with the same rate.

IEEE Information Theory Workshop (ITW)•Sep 1, 2012•14 citations

Quantum serial turbo-codes

David Poulin, Jean–Pierre Tillich, Harold Ollivier

We present a theory of quantum serial turbo-codes and study their performance numerically on a depolarization channel. These codes can be considered as a generalization of classical serial turbo-codes. As their classical cousins, they can be iteratively decoded and with well chosen constituent convolutional codes, we observe an important reduction of the word error rate as the number of encoded qubits increases. Our construction offers several advantages over quantum LDPC codes. First, the Tanner graph used for decoding can be chosen to be free of 4-cycles that deteriorate the performances of iterative decoding. Secondly, the iterative decoder makes explicit use of the code's degeneracy. Finally, there is complete freedom in the code design in terms of length, rate, memory size, and interleaver choice. We address two issues related to the encoding of convolutional codes that are directly relevant for turbo-codes, namely the character of being recursive and non-catastrophic. We define a quantum analogue of a state diagram that provides an efficient way to verify these properties on a given quantum convolutional encoder. Unfortunately, we also prove that all recursive quantum convolutional encoder have catastrophic error propagation. In our constructions, the convolutional codes have thus been chosen to be non-catastrophic and non-recursive. While the resulting families of turbo-codes have bounded minimum distance, from a pragmatic point of view the effective minimum distances of the codes that we have simulated are large enough for not degrading iterative decoding performance up to reasonable word error rates and block sizes.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•33 citations

Quantum error correction near the coding theoretical bound

Daiki Komoto, Kenta Kasai

Abstract Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits1. However, many impactful applications demand quantum computations with millions of logical qubits2, necessitating highly scalable quantum error correction. In classical information theory, low-density parity-check (LDPC) codes3 can approach channel capacity efficiently4. Yet, no quantum error-correcting codes with efficient decoding have been shown to approach the hashing bound—a fundamental limit on quantum capacity—despite decades of research5–7. Here, we present quantum LDPC codes that not only approach the hashing bound but also allow decoding with computational cost linear in the number of physical qubits. This breakthrough paves the way for large-scale, fault-tolerant quantum computation. Combined with emerging hardware that manages many qubits, our approach brings quantum solutions to important real-world problems significantly closer to reality.

arXiv:2412.21171•npj Quantum Information•Sep 30, 2025•15 citations

Protograph-Based LDPC Codes with Local Irregularity

Vincent Wüst, Erdem Eray Cil, Laurent Schmalen

Forward error correcting (FEC) codes are used in many communication standards with a wide range of requirements. FEC codes should work close to capacity, achieve low error floors, and have low decoding complexity. In this paper, we propose a novel category of low-density parity-check (LDPC) codes, based on protograph codes with local irregularity. This new code family generalizes conventional protograph-based LDPC codes and is capable of reducing the iterative decoding threshold of the conventional counterpart. We introduce an adapted version of the protograph extrinsic information transfer (PEXIT) algorithm to estimate decoding thresholds on the binaryinput additive white Gaussian noise channel, perform optimizations on the local irregularity, and simulate the performance of some constructed codes.

IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•0 citations

On unequal error protection LDPC codes based on Plotkin-type constructions

A family of unequal error-protection (UEP) low-density parity-check (LDPC) codes, based on Plotkin-type constructions, is introduced. The codes are decoded in multiple stages in such a manner that the order of decoding determines the level of error protection. The level of UEP among the code bits can be further increased by properly combining structured and random-like LDPC component codes with carefully chosen properties, and by using some new reliability features. The proposed scheme also offers a good trade-off between code performance on the one hand and encoding/decoding and storage complexity on the other. To the best of our knowledge, the proposed approach represents the first iterative UEP method with analytically provable properties.

Globecom•Jan 1, 2004•3 citations
We propose here a new construction of quantum codes combining an improved version of a family of spatially coupled quantum LDPC codes, suggested in [1], with a family of error reducing turbo-codes of [2]. This new construction displays outstanding performances under iterative decoding for noise levels very close to the hashing bound, without needing qubits, protected from noise as in [1].
We present a theory of quantum serial turbo-codes and study their performance numerically on a depolarization channel. These codes can be considered as a generalization of classical serial turbo-codes. As their classical cousins, they can be iteratively decoded and with well chosen constituent convolutional codes, we observe an important reduction of the word error rate as the number of encoded qubits increases. Our construction offers several advantages over quantum LDPC codes. First, the Tanner graph used for decoding can be chosen to be free of 4-cycles that deteriorate the performances of iterative decoding. Secondly, the iterative decoder makes explicit use of the code's degeneracy. Finally, there is complete freedom in the code design in terms of length, rate, memory size, and interleaver choice. We address two issues related to the encoding of convolutional codes that are directly relevant for turbo-codes, namely the character of being recursive and non-catastrophic. We define a quantum analogue of a state diagram that provides an efficient way to verify these properties on a given quantum convolutional encoder. Unfortunately, we also prove that all recursive quantum convolutional encoder have catastrophic error propagation. In our constructions, the convolutional codes have thus been chosen to be non-catastrophic and non-recursive. While the resulting families of turbo-codes have bounded minimum distance, from a pragmatic point of view the effective minimum distances of the codes that we have simulated are large enough for not degrading iterative decoding performance up to reasonable word error rates and block sizes.
Abstract Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits1. However, many impactful applications demand quantum computations with millions of logical qubits2, necessitating highly scalable quantum error correction. In classical information theory, low-density parity-check (LDPC) codes3 can approach channel capacity efficiently4. Yet, no quantum error-correcting codes with efficient decoding have been shown to approach the hashing bound—a fundamental limit on quantum capacity—despite decades of research5–7. Here, we present quantum LDPC codes that not only approach the hashing bound but also allow decoding with computational cost linear in the number of physical qubits. This breakthrough paves the way for large-scale, fault-tolerant quantum computation. Combined with emerging hardware that manages many qubits, our approach brings quantum solutions to important real-world problems significantly closer to reality.
Forward error correcting (FEC) codes are used in many communication standards with a wide range of requirements. FEC codes should work close to capacity, achieve low error floors, and have low decoding complexity. In this paper, we propose a novel category of low-density parity-check (LDPC) codes, based on protograph codes with local irregularity. This new code family generalizes conventional protograph-based LDPC codes and is capable of reducing the iterative decoding threshold of the conventional counterpart. We introduce an adapted version of the protograph extrinsic information transfer (PEXIT) algorithm to estimate decoding thresholds on the binaryinput additive white Gaussian noise channel, perform optimizations on the local irregularity, and simulate the performance of some constructed codes.
A family of unequal error-protection (UEP) low-density parity-check (LDPC) codes, based on Plotkin-type constructions, is introduced. The codes are decoded in multiple stages in such a manner that the order of decoding determines the level of error protection. The level of UEP among the code bits can be further increased by properly combining structured and random-like LDPC component codes with carefully chosen properties, and by using some new reliability features. The proposed scheme also offers a good trade-off between code performance on the one hand and encoding/decoding and storage complexity on the other. To the best of our knowledge, the proposed approach represents the first iterative UEP method with analytically provable properties.