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

arXiv:2611.12190

High Rate Quantum Block Turbo Codes

Khaled Jebari, Luiz Anet Neto, Ramesh Mahendra Pyndiah, Jean-Louis de Bougrenet de la Tocnaye

Published Nov 9, 2026• 1 citation
arXivHTMLPDF

Abstract

Quantum Block Turbo Code is an iterative decoding technique for concatenated quantum error correction codes in product form. In this paper, we study new high rate quantum block turbo codes with different constituent codes. We examine the impact of the change of codes parameters and the order of constituent codes on turbo performance.
DOI
10.48550/arxiv.2611.12190

Related papers

Quantum Block Turbo Codes

Khaled Jebari, Luiz Anet Neto, Ramesh Pyndiah +1 more

In the early nineties, the introduction of turbo codes revolutionized classical error correction. The idea was mainly applied on two types of codes: convolutional turbo codes and turbo product codes. The first type of codes was adapted to quantum error correction which initiated the theory of quantum serial turbo codes. In this paper, we present a theory for quantum block turbo codes, the quantum analog of the second type of turbo codes. We describe their iterative decoding algorithm and simulate their performances on a depolarizing channel for different constituent codes.

quant-pharXiv:2608.30775•Sep 1, 2026•2 citations

Multidimensional Quantum Block Turbo Codes

Khaled Jebari, Luiz Anet Neto, Ramesh Mahendra Pyndiah +1 more

The theory of turbo iterative decoding was brought into the quantum coding framework through the development of quantum serial turbo codes and quantum block turbo codes. In this paper, we present a theory for multidimensional quantum block turbo codes, a turbo decoding technique for multi layer product codes. We describe its algorithm and simulate the performance for the 3D case on a depolarizing channel.

arXiv:2611.14406•Nov 10, 2026•0 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 Serial Turbo Codes

David Poulin, Jean–Pierre Tillich, Harold Ollivier

In this paper, we present a theory of quantum serial turbo codes, describe their iterative decoding algorithm, and study their performances numerically on a depolarization channel. Our construction offers several advantages over quantum low-density parity-check (LDPC) codes. First, the Tanner graph used for decoding is free of 4-cycles that deteriorate the performances of iterative decoding. Second, 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 define a quantum analogue of a state diagram that provides an efficient way to verify the properties of a quantum convolutional code, and in particular, its recursiveness and the presence of catastrophic error propagation. We prove that all recursive quantum convolutional encoders have catastrophic error propagation. In our constructions, the convolutional codes have thus been chosen to be noncatastrophic and nonrecursive. 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 not to degrade the iterative decoding performance up to reasonable word error rates and block sizes. With well-chosen constituent convolutional codes, we observe an important reduction of the word error rate as the code length increases.

arXiv:0712.2888•IEEE Transactions on Information Theory•May 19, 2009•122 citations

Near-Hashing-Bound Multiple-Rate Quantum Turbo Short-Block Codes

Daryus Chandra, Zunaira Babar, Soon Xin Ng +1 more

Quantum stabilizer codes (QSCs) suffer from a low quantum coding rate since they have to recover the quantum bits (qubits) in the face of both bit-flip and phase-flip errors. In this treatise, we conceive a low-complexity concatenated quantum turbo code (QTC) design exhibiting a high quantum coding rate. The high quantum coding rate is achieved by combining the quantum-domain version of short-block codes (SBCs) also known as single parity check (SPC) codes as the outer codes and quantum unity-rate codes (QURCs) as the inner codes. Despite its design simplicity, the proposed QTC yields a near-hashing-bound error correction performance. For instance, compared to the best half-rate QTC known in the literature, namely the QIrCC-QURC scheme, which operates at the distance of D = 0.037 from the quantum hashing bound, our novel QSBC-QURC scheme can operate at the distance of D = 0.029. In addition, it is worth mentioning that this is the first instantiation of QTCs capable of adjusting the quantum encoders according to the quantum coding rate required for mitigating the Pauli errors, given the different depolarizing probabilities of the quantum channel.

arXiv:1903.10927•IEEE Access•Jan 1, 2019•22 citations

Iterative quantum coding systems

David Poulin

Introduction This chapter concerns quantum coding schemes based on iterative decoding. So far, most of the focus of this book has been on quantum error-correcting codes (QECCs) that use a relatively small number of qubits, and concatenation thereof. The decoding strategy adopted for these codes consists of identifying the lowest-weight error that is consistent with the syndrome and reversing its effect. The lowest-weight error associated with each syndrome can, in the worst case, be found by exhaustive search and stored in a look-up table for future reference. Each time a syndrome is measured, the appropriate recovery can be rapidly extracted from the table to complete the error-correction cycle. In contrast, the codes described in this chapter use a very large number of qubits; the larger the better! For a fixed rate r = k / n , the performance of the codes improves as n increases. For such large codes however, more clever decoding schemes are required. For a code with parameters [[ n, k, d ]], the size of the look-up table – i.e. the number of distinct syndromes – is 2 n−k = 2(1− r ) n . Thus, look-up tables are only suitable for codes of a few dozen qubits. For larger codes, the decoding process involves a highly nontrivial computation that needs to be executed “on the fly,” so fast and reliable algorithms are needed. Iterative decoding is one such algorithm and it has produced some of the best coding schemes – in particular turbo-codes and sparse codes – widely used in classical wireless communication.

Cambridge University Press eBooks•Sep 5, 2013•0 citations
In the early nineties, the introduction of turbo codes revolutionized classical error correction. The idea was mainly applied on two types of codes: convolutional turbo codes and turbo product codes. The first type of codes was adapted to quantum error correction which initiated the theory of quantum serial turbo codes. In this paper, we present a theory for quantum block turbo codes, the quantum analog of the second type of turbo codes. We describe their iterative decoding algorithm and simulate their performances on a depolarizing channel for different constituent codes.
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.
In this paper, we present a theory of quantum serial turbo codes, describe their iterative decoding algorithm, and study their performances numerically on a depolarization channel. Our construction offers several advantages over quantum low-density parity-check (LDPC) codes. First, the Tanner graph used for decoding is free of 4-cycles that deteriorate the performances of iterative decoding. Second, 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 define a quantum analogue of a state diagram that provides an efficient way to verify the properties of a quantum convolutional code, and in particular, its recursiveness and the presence of catastrophic error propagation. We prove that all recursive quantum convolutional encoders have catastrophic error propagation. In our constructions, the convolutional codes have thus been chosen to be noncatastrophic and nonrecursive. 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 not to degrade the iterative decoding performance up to reasonable word error rates and block sizes. With well-chosen constituent convolutional codes, we observe an important reduction of the word error rate as the code length increases.
Quantum stabilizer codes (QSCs) suffer from a low quantum coding rate since they have to recover the quantum bits (qubits) in the face of both bit-flip and phase-flip errors. In this treatise, we conceive a low-complexity concatenated quantum turbo code (QTC) design exhibiting a high quantum coding rate. The high quantum coding rate is achieved by combining the quantum-domain version of short-block codes (SBCs) also known as single parity check (SPC) codes as the outer codes and quantum unity-rate codes (QURCs) as the inner codes. Despite its design simplicity, the proposed QTC yields a near-hashing-bound error correction performance. For instance, compared to the best half-rate QTC known in the literature, namely the QIrCC-QURC scheme, which operates at the distance of D = 0.037 from the quantum hashing bound, our novel QSBC-QURC scheme can operate at the distance of D = 0.029. In addition, it is worth mentioning that this is the first instantiation of QTCs capable of adjusting the quantum encoders according to the quantum coding rate required for mitigating the Pauli errors, given the different depolarizing probabilities of the quantum channel.
Introduction This chapter concerns quantum coding schemes based on iterative decoding. So far, most of the focus of this book has been on quantum error-correcting codes (QECCs) that use a relatively small number of qubits, and concatenation thereof. The decoding strategy adopted for these codes consists of identifying the lowest-weight error that is consistent with the syndrome and reversing its effect. The lowest-weight error associated with each syndrome can, in the worst case, be found by exhaustive search and stored in a look-up table for future reference. Each time a syndrome is measured, the appropriate recovery can be rapidly extracted from the table to complete the error-correction cycle. In contrast, the codes described in this chapter use a very large number of qubits; the larger the better! For a fixed rate r = k / n , the performance of the codes improves as n increases. For such large codes however, more clever decoding schemes are required. For a code with parameters [[ n, k, d ]], the size of the look-up table – i.e. the number of distinct syndromes – is 2 n−k = 2(1− r ) n . Thus, look-up tables are only suitable for codes of a few dozen qubits. For larger codes, the decoding process involves a highly nontrivial computation that needs to be executed “on the fly,” so fast and reliable algorithms are needed. Iterative decoding is one such algorithm and it has produced some of the best coding schemes – in particular turbo-codes and sparse codes – widely used in classical wireless communication.