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

Wiley eBooks

EXIT‐chart‐aided Design of Irregular Multiple‐rate Quantum Turbo Block Codes

Zunaira Babar, Daryus Chandra, Soon Xin Ng, Lajos Hanzo

Published Dec 18, 2025• 0 citations
Publisher

Abstract

Extrinsic information transfer (EXIT) chart-aided irregular multiple-rate quantum turbo short-block codes (MR-QSBC-QURCs) are designed that operate near the quantum hashing bound. A single-encoder framework is developed for multiple-rate quantum short-block codes (QSBCs), enabling the support of a wide range of coding rates. By concatenating MR-QSBCs as outer codes with a quantum unity-rate code (QURC) as the inner code, the design achieves flexible rate-compatibility and low-complexity iterative decoding. EXIT-chart based heuristic optimization is applied for attaining near-capacity performance. Simulation results confirm that the proposed MR-QSBC-QURC schemes have qubit error ratio (QBER) curves close to the quantum hashing bound. Overall, this chapter provides a practical approach to designing scalable, adaptable quantum turbo codes having near-optimal error-correction capability.

DOI
10.1002/9781394331963.ch13

Related papers

EXIT-Chart Aided Design of Irregular Multiple-Rate Quantum Turbo Block Codes

Daryus Chandra, Soon Xin Ng, Lajos Hanzo

We propose a novel quantum turbo short-block code, which subsumes multiple-rate quantum short-block codes (MR-QSBCs) as the outer codes and a quantum unity-rate code (QURC) as the inner code. The proposed design is denoted as MR-QSBC-QURC. More specifically, the proposed design exhibits multiple quantum coding rates despite relying only on a single quantum encoder. Moreover, the flexibility offered by the single-encoder MR-QSBCs enables us to leverage extrinsic information transfer (EXIT)-chart based heuristic optimization for determining the optimal weighting in the fractional encoding of MR-QSBCs. Our simulation results show that the MR-QSBC-QURC scheme conceived performs relatively close to the ultimate limit of the quantum hashing bound. Specifically, when considering the target quantum coding rates of$r_{Q} = \lbrace 0.3, 0.4, 0.5, 0.6, 0.7 \rbrace $, the MR-QSBC-QURC operates at a distance of$D = \lbrace 0.042, 0.029, 0.030, 0.024, 0.017 \rbrace $from the quantum hashing bound, respectively, at a quantum bit error ratio (QBER) of 10−3.

IEEE Access•Jan 1, 2023•4 citations

Near‐hashing‐bound Quantum Turbo Short‐block Codes

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

This chapter introduces a family of near-hashing-bound, multiple-rate quantum turbo codes (QTCs) that combine quantum short-block codes (QSBCs) with quantum unity-rate codes (QURCs). The framework is based on transforming classical short-block codes into their quantum counterparts, yielding high-rate, scalable encoders having a minimum distance of d = 2. By concatenating QSBCs as outer codes with QURCs as inner codes, the proposed QSBC-QURC schemes support low-complexity, high-rate quantum error correction while operating very close to the quantum hashing bound. They also outperform the best-known QIrCC-QURC design. Their extrinsic information transfer (EXIT) chart analysis and the associated Monte Carlo simulations characterize their convergence behavior and their quantum bit error ratio (QBER) performance. The achievable goodput is also quantified. Furthermore, the multi-rate QTC concept is introduced, showing how the coding rate can be adaptively switched based on prevalent depolarizing probability to maintain specific fidelity or QBER levels, thereby providing a flexible and efficient design for quantum communication systems.

Wiley eBooks•Dec 18, 2025•0 citations

EXIT‐chart Aided Near‐hashing‐bound Concatenated Quantum Codes

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

A suite of concatenated quantum error correction codes is designed for closely approaching the quantum Hashing bound. We begin with the design objectives to be met in the face of quantum depolarizing channels, characterizing the achievable capacity region as a function of coding rate, depolarizing probability, and entanglement consumption. The chapter describes the circuit-based representation of quantum convolutional codes and their role in enabling degenerate iterative decoding. A detailed formulation of Clifford unitary encoders is provided, along with their binary equivalents. The structure and decoding of concatenated quantum codes, referred to as quantum turbo codes, are discussed, followed by the introduction of extrinsic information transfer (EXIT) chart-aided design principles. The chapter introduces quantum-domain irregular convolutional codes as outer components and evaluates their performance through simulations. The results demonstrate that they are capable of approaching the Hashing bound and highlight the associated trade-offs between coding rate, minimum distance, and entanglement usage.

Wiley eBooks•Dec 18, 2025•0 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

The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure

Zunaira Babar, Panagiotis Botsinis, Dimitrios Alanis +2 more

Powerful quantum error correction codes (QECCs) are required for stabilizing and protecting fragile qubits against the undesirable effects of quantum decoherence. Similar to classical codes, hashing bound approaching QECCs may be designed by exploiting a concatenated code structure, which invokes iterative decoding. Therefore, in this paper, we provide an extensive step-by-step tutorial for designing extrinsic information transfer (EXIT) chart-aided concatenated quantum codes based on the underlying quantum-to-classical isomorphism. These design lessons are then exemplified in the context of our proposed quantum irregular convolutional code (QIRCC), which constitutes the outer component of a concatenated quantum code. The proposed QIRCC can be dynamically adapted to match any given inner code using EXIT charts, hence achieving a performance close to the hashing bound. It is demonstrated that our QIRCC-based optimized design is capable of operating within 0.4 dB of the noise limit.

arXiv:1503.02372•IEEE Access•Jan 1, 2015•42 citations

EXIT-Chart-Aided Near-Capacity Quantum Turbo Code Design

Zunaira Babar, Soon Xin Ng, Lajos Hanzo

High detection complexity is the main impediment in future gigabit-wireless systems. However, a quantum-based detector is capable of simultaneously detecting hundreds of user signals by virtue of its inherent parallel nature. This, in turn, requires near-capacity quantum error correction codes for protecting the constituent qubits of the quantum detector against undesirable environmental decoherence. In this quest, we appropriately adapt the conventional nonbinary EXtrinsic Information Transfer (EXIT) charts for quantum turbo codes (QTCs) by exploiting the intrinsic quantum-to-classical isomorphism. The EXIT chart analysis not only allows us to dispense with the time-consuming Monte Carlo simulations but facilitates the design of near-capacity codes without resorting to the analysis of their distance spectra as well. We have demonstrated that our EXIT chart predictions are in line with the Monte Carlo simulation results. We have also optimized the entanglement-assisted QTC using EXIT charts, which outperforms the existing distance-spectra-based QTCs. More explicitly, the performance of our optimized QTC is as close as 0.3 dB to the corresponding hashing bound.

arXiv:1502.00910•IEEE Transactions on Vehicular Technology•Jun 6, 2014•55 citations
Extrinsic information transfer (EXIT) chart-aided irregular multiple-rate quantum turbo short-block codes (MR-QSBC-QURCs) are designed that operate near the quantum hashing bound. A single-encoder framework is developed for multiple-rate quantum short-block codes (QSBCs), enabling the support of a wide range of coding rates. By concatenating MR-QSBCs as outer codes with a quantum unity-rate code (QURC) as the inner code, the design achieves flexible rate-compatibility and low-complexity iterative decoding. EXIT-chart based heuristic optimization is applied for attaining near-capacity performance. Simulation results confirm that the proposed MR-QSBC-QURC schemes have qubit error ratio (QBER) curves close to the quantum hashing bound. Overall, this chapter provides a practical approach to designing scalable, adaptable quantum turbo codes having near-optimal error-correction capability.
We propose a novel quantum turbo short-block code, which subsumes multiple-rate quantum short-block codes (MR-QSBCs) as the outer codes and a quantum unity-rate code (QURC) as the inner code. The proposed design is denoted as MR-QSBC-QURC. More specifically, the proposed design exhibits multiple quantum coding rates despite relying only on a single quantum encoder. Moreover, the flexibility offered by the single-encoder MR-QSBCs enables us to leverage extrinsic information transfer (EXIT)-chart based heuristic optimization for determining the optimal weighting in the fractional encoding of MR-QSBCs. Our simulation results show that the MR-QSBC-QURC scheme conceived performs relatively close to the ultimate limit of the quantum hashing bound. Specifically, when considering the target quantum coding rates of$r_{Q} = \lbrace 0.3, 0.4, 0.5, 0.6, 0.7 \rbrace ,theMR−QSBC−QURCoperatesatadistanceof, the MR-QSBC-QURC operates at a distance of,theMR−QSBC−QURCoperatesatadistanceofD = \lbrace 0.042, 0.029, 0.030, 0.024, 0.017 \rbrace $from the quantum hashing bound, respectively, at a quantum bit error ratio (QBER) of 10−3.
This chapter introduces a family of near-hashing-bound, multiple-rate quantum turbo codes (QTCs) that combine quantum short-block codes (QSBCs) with quantum unity-rate codes (QURCs). The framework is based on transforming classical short-block codes into their quantum counterparts, yielding high-rate, scalable encoders having a minimum distance of d = 2. By concatenating QSBCs as outer codes with QURCs as inner codes, the proposed QSBC-QURC schemes support low-complexity, high-rate quantum error correction while operating very close to the quantum hashing bound. They also outperform the best-known QIrCC-QURC design. Their extrinsic information transfer (EXIT) chart analysis and the associated Monte Carlo simulations characterize their convergence behavior and their quantum bit error ratio (QBER) performance. The achievable goodput is also quantified. Furthermore, the multi-rate QTC concept is introduced, showing how the coding rate can be adaptively switched based on prevalent depolarizing probability to maintain specific fidelity or QBER levels, thereby providing a flexible and efficient design for quantum communication systems.
A suite of concatenated quantum error correction codes is designed for closely approaching the quantum Hashing bound. We begin with the design objectives to be met in the face of quantum depolarizing channels, characterizing the achievable capacity region as a function of coding rate, depolarizing probability, and entanglement consumption. The chapter describes the circuit-based representation of quantum convolutional codes and their role in enabling degenerate iterative decoding. A detailed formulation of Clifford unitary encoders is provided, along with their binary equivalents. The structure and decoding of concatenated quantum codes, referred to as quantum turbo codes, are discussed, followed by the introduction of extrinsic information transfer (EXIT) chart-aided design principles. The chapter introduces quantum-domain irregular convolutional codes as outer components and evaluates their performance through simulations. The results demonstrate that they are capable of approaching the Hashing bound and highlight the associated trade-offs between coding rate, minimum distance, and entanglement usage.
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.
Powerful quantum error correction codes (QECCs) are required for stabilizing and protecting fragile qubits against the undesirable effects of quantum decoherence. Similar to classical codes, hashing bound approaching QECCs may be designed by exploiting a concatenated code structure, which invokes iterative decoding. Therefore, in this paper, we provide an extensive step-by-step tutorial for designing extrinsic information transfer (EXIT) chart-aided concatenated quantum codes based on the underlying quantum-to-classical isomorphism. These design lessons are then exemplified in the context of our proposed quantum irregular convolutional code (QIRCC), which constitutes the outer component of a concatenated quantum code. The proposed QIRCC can be dynamically adapted to match any given inner code using EXIT charts, hence achieving a performance close to the hashing bound. It is demonstrated that our QIRCC-based optimized design is capable of operating within 0.4 dB of the noise limit.
High detection complexity is the main impediment in future gigabit-wireless systems. However, a quantum-based detector is capable of simultaneously detecting hundreds of user signals by virtue of its inherent parallel nature. This, in turn, requires near-capacity quantum error correction codes for protecting the constituent qubits of the quantum detector against undesirable environmental decoherence. In this quest, we appropriately adapt the conventional nonbinary EXtrinsic Information Transfer (EXIT) charts for quantum turbo codes (QTCs) by exploiting the intrinsic quantum-to-classical isomorphism. The EXIT chart analysis not only allows us to dispense with the time-consuming Monte Carlo simulations but facilitates the design of near-capacity codes without resorting to the analysis of their distance spectra as well. We have demonstrated that our EXIT chart predictions are in line with the Monte Carlo simulation results. We have also optimized the entanglement-assisted QTC using EXIT charts, which outperforms the existing distance-spectra-based QTCs. More explicitly, the performance of our optimized QTC is as close as 0.3 dB to the corresponding hashing bound.