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:1903.10927 · IEEE Access

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

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

Published Jan 1, 2019• 22 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/access.2019.2911515

Related papers

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

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

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

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.

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

Quantum topological error correction codes for quantum computation and communication

Daryus Chandra

The employment of quantum error correction codes (QECCs) within quantum computers potentially offers a reliability improvement for both quantum computation and communications tasks. However, the laws of quantum mechanics prevent us from directly invoking the mature family of classical error correction codes in the quantum domain. In order to circumvent the associated problems, the notion of quantum stabilizer codes (QSCs) was proposed in conjunction with syndrome-based decoding in the quantum regime. However, most of the powerful QSC schemes require long codewords for achieving a high performance, which potentially imposes additional challenges for implementation concerning their implementation, since their decoding may require longer than the quantum circuit's coherence time. Hence at the time of writing, QSCs exhibiting short to moderate codeword lengths are preferable. We commence by describing the pivotal problem encountered by classical error-correction codes, which also emerges when designing the QSCs, namely the intrinsic trade-off between the minimum distance versus coding rate. The complete formulation of this particular trade-off does not exist, but several lower and upper bounds can be found in the literature. It has been shown that a substantial gap can be observed between the upper and lower bound of the minimum distance, given the codeword length and the quantum coding rate. Hence, we propose an appealingly simple and invertible analytical approximation, for characterizing the trade-off between the quantum coding rate and the minimum distance of QSCs as well as their corresponding quantum bit error rate (QBER) performance upper-bound. For example, for a half-rate QSC having a codeword length of n = 128, the minimum distance is bounded by 11 < d < 22, while our approximation yields a minimum distance of d = 17 for the above-mentioned code. Next, we link this parametric study of the minimum distance versus quantum coding rate to the popular QSCs, namely to the family of quantum topological error correction codes (QTECCs). In order to construct the classical-to-quantum isomorphism, we conceive and investigate the family of classical topological error correction codes (TECCs), assuming that the bits of a codeword can be arranged in a lattice structure. We then present the classical-to-quantum isomorphism to pave the way for constructing their dual pairs in the quantum domain, which are the QTECCs. Finally, we characterize the performance of QTECCs in the face of the quantum depolarizing channel in terms of both their QBER and fidelity. Specifically, we demonstrate that for quantum coding rate rQ ~ 0, the threshold probability of the QBER below which the colour, rotated-surface, surface, and toric codes become capable of improving the uncoded QBER are given by 1.8 ×10-2, 1.3 ×10-2, 6.3 ×10-2 and 6.8 ×10-2, respectively. Furthermore, we also demonstrate that we can achieve beneficial fidelity improvements above the minimum fidelity of 0.94, 0.97 and 0.99 by employing the rQ = 1/7 colour code, the rQ = 1/9 rotated-surface code, and the rQ = 1/13 surface code, respectively. However, QSCs require additional quantum gates for their employment. Incorporating more quantum gates for performing error correction potentially introduces further sources of quantum decoherence into quantum computers. In this scenario, the primary challenge is to find the sufficient condition required by each of the quantum gates for beneficially employing QECCs in order to yield reliability improvements, given that the quantum gates utilized by the QECCs also introduce quantum decoherence. In this treatise, we approach this problem by firstly presenting the general framework of protecting quantum gates by the amalgamation of the transversal configuration of quantum gates and QSCs, which can be viewed as syndrome-based QECCs. Secondly, we provide examples of the advocated framework by invoking QTECCs for protecting both transversal Hadamard gates and controlled (CNOT) gates. Both our simulation and analytical results explicitly show that by utilizing QTECCs, the fidelity of the quantum gates can be beneficially improved, provided that quantum gates satisfying a certain minimum depolarization fidelity threshold (Fth) are available. For instance, for protecting transversal Hadamard gates, the minimum fidelity values required for each of the gates in order to attain fidelity improvements are 99.74%, 99.73%, 99.87%, and 99.86%, when they are protected by colour, rotated-surface, surface, and toric codes, respectively. Unfortunately, these specific Fth values can only be obtained for a very large number of physical qubits (n → ∞), when the quantum coding rate of the QTECCs approaches zero (rQ → 0). Finally, in order to conceive QSCs exhibiting a high quantum coding rate, we modify the construction of QTECCs for conceiving a low-complexity concatenated quantum turbocode (QTC). The above-mentioned high quantum coding rate is obtained 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 quantum irregular convolutional codes (QIrCCs) combined with the 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 lower distance of D = 0:029. It is also 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 imposed by the time-variant depolarizing probabilities of the quantum channel.

•Jan 1, 2019•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
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.
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.
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.
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.
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.
The employment of quantum error correction codes (QECCs) within quantum computers potentially offers a reliability improvement for both quantum computation and communications tasks. However, the laws of quantum mechanics prevent us from directly invoking the mature family of classical error correction codes in the quantum domain. In order to circumvent the associated problems, the notion of quantum stabilizer codes (QSCs) was proposed in conjunction with syndrome-based decoding in the quantum regime. However, most of the powerful QSC schemes require long codewords for achieving a high performance, which potentially imposes additional challenges for implementation concerning their implementation, since their decoding may require longer than the quantum circuit's coherence time. Hence at the time of writing, QSCs exhibiting short to moderate codeword lengths are preferable. We commence by describing the pivotal problem encountered by classical error-correction codes, which also emerges when designing the QSCs, namely the intrinsic trade-off between the minimum distance versus coding rate. The complete formulation of this particular trade-off does not exist, but several lower and upper bounds can be found in the literature. It has been shown that a substantial gap can be observed between the upper and lower bound of the minimum distance, given the codeword length and the quantum coding rate. Hence, we propose an appealingly simple and invertible analytical approximation, for characterizing the trade-off between the quantum coding rate and the minimum distance of QSCs as well as their corresponding quantum bit error rate (QBER) performance upper-bound. For example, for a half-rate QSC having a codeword length of n = 128, the minimum distance is bounded by 11 < d < 22, while our approximation yields a minimum distance of d = 17 for the above-mentioned code. Next, we link this parametric study of the minimum distance versus quantum coding rate to the popular QSCs, namely to the family of quantum topological error correction codes (QTECCs). In order to construct the classical-to-quantum isomorphism, we conceive and investigate the family of classical topological error correction codes (TECCs), assuming that the bits of a codeword can be arranged in a lattice structure. We then present the classical-to-quantum isomorphism to pave the way for constructing their dual pairs in the quantum domain, which are the QTECCs. Finally, we characterize the performance of QTECCs in the face of the quantum depolarizing channel in terms of both their QBER and fidelity. Specifically, we demonstrate that for quantum coding rate rQ ~ 0, the threshold probability of the QBER below which the colour, rotated-surface, surface, and toric codes become capable of improving the uncoded QBER are given by 1.8 ×10-2, 1.3 ×10-2, 6.3 ×10-2 and 6.8 ×10-2, respectively. Furthermore, we also demonstrate that we can achieve beneficial fidelity improvements above the minimum fidelity of 0.94, 0.97 and 0.99 by employing the rQ = 1/7 colour code, the rQ = 1/9 rotated-surface code, and the rQ = 1/13 surface code, respectively. However, QSCs require additional quantum gates for their employment. Incorporating more quantum gates for performing error correction potentially introduces further sources of quantum decoherence into quantum computers. In this scenario, the primary challenge is to find the sufficient condition required by each of the quantum gates for beneficially employing QECCs in order to yield reliability improvements, given that the quantum gates utilized by the QECCs also introduce quantum decoherence. In this treatise, we approach this problem by firstly presenting the general framework of protecting quantum gates by the amalgamation of the transversal configuration of quantum gates and QSCs, which can be viewed as syndrome-based QECCs. Secondly, we provide examples of the advocated framework by invoking QTECCs for protecting both transversal Hadamard gates and controlled (CNOT) gates. Both our simulation and analytical results explicitly show that by utilizing QTECCs, the fidelity of the quantum gates can be beneficially improved, provided that quantum gates satisfying a certain minimum depolarization fidelity threshold (Fth) are available. For instance, for protecting transversal Hadamard gates, the minimum fidelity values required for each of the gates in order to attain fidelity improvements are 99.74%, 99.73%, 99.87%, and 99.86%, when they are protected by colour, rotated-surface, surface, and toric codes, respectively. Unfortunately, these specific Fth values can only be obtained for a very large number of physical qubits (n → ∞), when the quantum coding rate of the QTECCs approaches zero (rQ → 0). Finally, in order to conceive QSCs exhibiting a high quantum coding rate, we modify the construction of QTECCs for conceiving a low-complexity concatenated quantum turbocode (QTC). The above-mentioned high quantum coding rate is obtained 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 quantum irregular convolutional codes (QIrCCs) combined with the 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 lower distance of D = 0:029. It is also 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 imposed by the time-variant depolarizing probabilities of the quantum channel.
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.