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 Access

EXIT-Chart Aided Quantum Code Design Improves the Normalised Throughput of Realistic Quantum Devices

Hung Viet Nguyen, Zunaira Babar, Dimitrios Alanis, Panagiotis Botsinis, Daryus Chandra, Soon Xin Ng, Lajos Hanzo

Published Jan 1, 2016• 31 citations
Publisher

Abstract

In this contribution, the Hashing bound of entanglement-assisted quantum channels is investigated in the context of quantum devices built from a range of popular materials, such as trapped ion and relying on solid state nuclear magnetic resonance, which can be modeled as a so-called asymmetric channel. Then, quantum error correction codes (QECC) are designed based on extrinsic information transfer charts for improving performance when employing these quantum devices. The results are also verified by simulations. Our QECC schemes are capable of operating close to the corresponding Hashing bound.

DOI
10.1109/access.2016.2591910

Related papers

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

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

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

EXIT-Chart Aided Code Design for Symbol-Based Entanglement-Assisted Classical Communication over Quantum Channels

Zunaira Babar, Soon Xin Ng, Lajos Hanzo

Quantum-based transmission is an attractive solution conceived for achieving absolute security. In this quest, we have conceived an EXtrinsic Information Transfer (EXIT) chart aided channel code design for symbol-based entanglement-assisted classical communication over quantum depolarizing channels. Our proposed concatenated code design incorporates a Convolutional Code (CC), a symbol-based Unity Rate Code (URC) and a soft-decision aided 2-qubit Superdense Code (2SD), which is hence referred to as a CC-URC-2SD arrangement. We have optimized our design with the aid of non-binary EXIT charts. Our proposed design operates within 1 dB of the achievable capacity, providing attractive performance gains over its bit-based counterpart. Quantitatively, the bit-based scheme requires 60% more iterations than our symbol-based scheme for the sake of achieving perfect decoding convergence. Furthermore, we demonstrate that the decoding complexity can be reduced by using memory-2 and memory-3 convolutional codes, while still outperforming the bit-based approach.

IEEE Vehicular Technology Conference•Sep 1, 2014•2 citations

Performance of entanglement-assisted quantum codes with noisy ebits over asymmetric and memory channels

Ji-Hao 继豪 Fan 樊, Pei-Wen 沛文 Xia 夏, Di-Kang 迪康 Dai 戴 +1 more

Entanglement-assisted quantum error correction codes (EAQECCs) play an important role in quantum communications with noise. Such a scheme can use arbitrary classical linear code to transmit qubits over noisy quantum channels by consuming some ebits between the sender (Alice) and the receiver (Bob). It is usually assumed that the preshared ebits of Bob are error free. However, noise on these ebits is unavoidable in many cases. In this work, we evaluate the performance of EAQECCs with noisy ebits over asymmetric quantum channels and quantum channels with memory by computing the exact entanglement fidelity of several EAQECCs. We consider asymmetric errors in both qubits and ebits and show that the performance of EAQECCs in entanglement fidelity gets improved for qubits and ebits over asymmetric channels. In quantum memory channels, we compute the entanglement fidelity of several EAQECCs over Markovian quantum memory channels and show that the performance of EAQECCs is lowered down by the channel memory. Furthermore, we show that the performance of EAQECCs is diverse when the error probabilities of qubits and ebits are different. In both asymmetric and memory quantum channels, we show that the performance of EAQECCs is improved largely when the error probability of ebits is reasonably smaller than that of qubits.

Chinese Physics B•Aug 29, 2023•1 citation
In this contribution, the Hashing bound of entanglement-assisted quantum channels is investigated in the context of quantum devices built from a range of popular materials, such as trapped ion and relying on solid state nuclear magnetic resonance, which can be modeled as a so-called asymmetric channel. Then, quantum error correction codes (QECC) are designed based on extrinsic information transfer charts for improving performance when employing these quantum devices. The results are also verified by simulations. Our QECC schemes are capable of operating close to the corresponding Hashing bound.
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.
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.
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.
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.
Quantum-based transmission is an attractive solution conceived for achieving absolute security. In this quest, we have conceived an EXtrinsic Information Transfer (EXIT) chart aided channel code design for symbol-based entanglement-assisted classical communication over quantum depolarizing channels. Our proposed concatenated code design incorporates a Convolutional Code (CC), a symbol-based Unity Rate Code (URC) and a soft-decision aided 2-qubit Superdense Code (2SD), which is hence referred to as a CC-URC-2SD arrangement. We have optimized our design with the aid of non-binary EXIT charts. Our proposed design operates within 1 dB of the achievable capacity, providing attractive performance gains over its bit-based counterpart. Quantitatively, the bit-based scheme requires 60% more iterations than our symbol-based scheme for the sake of achieving perfect decoding convergence. Furthermore, we demonstrate that the decoding complexity can be reduced by using memory-2 and memory-3 convolutional codes, while still outperforming the bit-based approach.
Entanglement-assisted quantum error correction codes (EAQECCs) play an important role in quantum communications with noise. Such a scheme can use arbitrary classical linear code to transmit qubits over noisy quantum channels by consuming some ebits between the sender (Alice) and the receiver (Bob). It is usually assumed that the preshared ebits of Bob are error free. However, noise on these ebits is unavoidable in many cases. In this work, we evaluate the performance of EAQECCs with noisy ebits over asymmetric quantum channels and quantum channels with memory by computing the exact entanglement fidelity of several EAQECCs. We consider asymmetric errors in both qubits and ebits and show that the performance of EAQECCs in entanglement fidelity gets improved for qubits and ebits over asymmetric channels. In quantum memory channels, we compute the entanglement fidelity of several EAQECCs over Markovian quantum memory channels and show that the performance of EAQECCs is lowered down by the channel memory. Furthermore, we show that the performance of EAQECCs is diverse when the error probabilities of qubits and ebits are different. In both asymmetric and memory quantum channels, we show that the performance of EAQECCs is improved largely when the error probability of ebits is reasonably smaller than that of qubits.