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.
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.
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.
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.
Near-capacity classical code designs are proposed for entanglement-assisted communication over quantum depolarizing channels. We introduce the superdense coding (SD) protocol as a bit-to-qubit mapping mechanism and characterize the associated classical capacity. The chapter describes a bit-based transmission scheme that serially concatenates an irregular convolutional code (IRCC) and a unity rate code (URC) with the SD encoder. A powerful tool referred to as the extrinsic information transfer (EXIT) chart analysis is harnessed for optimizing the components of the IRCC scheme for achieving near-capacity performance. A symbol-based alternative is also proposed for mitigating the capacity loss associated with bit-to-symbol conversion. The performance of both 2-qubit and 3-qubit SD-based designs is evaluated by simulations. The chapter concludes by highlighting the potential of EXIT-chart-aided designs in entanglement-assisted classical communication systems.
Quantum parallel processing techniques are capable of solving certain complex problems at a substantially lower complexity than their classical counterparts. From the perspective of telecommunications, this quantum-domain parallel processing provides a plausible solution for achieving full-search based multi-stream detection, which is vital for future gigabit-wireless systems. The peculiar laws of quantum mechanics have also spurred interest in the absolutely secure quantum-based communication systems. Unfortunately, quantum decoherence imposes a hitherto insurmountable impairment on the practical implementation of quantum computation as well as on quantum communication systems, which may be overcome with the aid of efficient error correction codes. In this thesis, we design error correction codes for the quantum domain, which is an intricate journey from the realm of classical channel coding theory to that of the Quantum Error Correction Codes (QECCs). Since quantum-based communication systems are capable of supporting the transmission of both classical and quantum information, we initially focus our attention on the code design for entanglementassisted classical communication over the quantum depolarizing channel. We conceive an Extrinsic Information Transfer (EXIT) chart aided near-capacity classical-quantum code design, which invokes a classical Irregular Convolutional Code (IRCC) and a Unity Rate Code (URC) in conjunction with our proposed soft-decision aided SuperDense Code (SD). Hence, it is referred to as an ‘IRCC-URCSD’ arrangement. The proposed scheme is intrinsically amalgamated both with 2-qubit as well as 3-qubit SD coding protocols and it is benchmarked against the corresponding entanglement-assisted classical capacity. Since the IRCC-URC-SD scheme is a bit-based design, it incurs a capacity loss. As a further advance, we design a symbol based concatenated code design, referred to as a symbol-based ‘CC-URC-SD’, which relies on a single-component classical Convolutional Code (CC). Additionally, for the sake of reducing the associated decoding complexity, we also investigate the impact of the constraint length of the convolutional code on the achievable performance. Our initial designs, namely IRCC-URC-SD and CC-URC-SD, exploit redundancy in the classical domain. By contrast, QECCs relying on the quantum-domain redundancy are indispensable for conceiving a quantum communication system supporting the transmission of quantum information and also for quantum computing. Therefore, we next provide insights into the transformation from the family of classical codes to the class of quantum codes known as ‘Quantum Stabilizer Codes’ (QSC), which invoke the classical syndrome decoding. Particularly, we detail the underlying quantum-to classical isomorphism, which facilitates the design of meritorious families of QECCs from the known classical codes. We further study the syndrome decoding techniques operating over classical channels, which may be exploited for decoding QSCs. In this context, we conceive a syndrome-based block decoding approach for the classical Turbo Trellis Coded Modulation (TTCM), whose performance is investigated for transmission over an Additive White Gaussian Noise (AWGN) channel as well as over an uncorrelated Rayleigh fading channel. Pursuing our objective of designing efficient QECCs, we next consider the construction of Hashingbound-approaching concatenated quantum codes. In this quest, we appropriately adapt the conventional non-binary EXIT charts for Quantum Turbo Codes (QTCs) by exploiting the intrinsic quantumto- classical isomorphism. We further demonstrate the explicit benefit of our EXIT-chart technique for achieving a Hashing-bound-approaching code design. We also propose a generically applicable structure for Quantum Irregular Convolutional Codes (QIRCCs), which can be dynamically adapted to a specific application scenario with the aid of the EXIT charts. More explicitly, we provide a detailed design example by constructing a 10-subcode QIRCC and use it as an outer code in a concatenated quantum code structure for evaluating its performance. Working further in the direction of iterative code structures, we survey Quantum Low Density Parity Check (QLPDC) codes from the perspective of code design as well as in terms of their decoding algorithms. Furthermore, we propose a radically new class of high-rate row-circulant Quasi-Cyclic QLDPC (QC-QLDPC) codes, which can be constructed from arbitrary row-circulant classical QC LDPC matrices. We also conceive a modified non-binary decoding algorithm for homogeneous Calderbank-Shor-Steane (CSS)-type QLDPC codes, which is capable of alleviating the problems imposed by the unavoidable length-4 cycles. Our modified decoder outperforms the state-of-the-art decoders in terms of their Word Error Rate (WER) performance, despite imposing a reduced decoding complexity. Finally, we intricately amalgamate our modified decoder with the classic Uniformly-ReWeighted Belief Propagation (URW-BP) for the sake of achieving further performance improvement.
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.