Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.665134
Title: Quantum error correction codes
Author: Babar, Zunaira
ISNI:       0000 0004 5346 9494
Awarding Body: University of Southampton
Current Institution: University of Southampton
Date of Award: 2015
Availability of Full Text:
Access through EThOS:
Full text unavailable from EThOS. Thesis embargoed until 17 Jun 2019
Access through Institution:
Abstract:
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.
Supervisor: Hanzo, Lajos Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.665134  DOI: Not available
Keywords: QA75 Electronic computers. Computer science
Share: