The University of Southampton
University of Southampton Institutional Repository

Quantum turbo decoding for quantum channels exhibiting memory

Quantum turbo decoding for quantum channels exhibiting memory
Quantum turbo decoding for quantum channels exhibiting memory

Inspired by the success of classical turbo codes, quantum turbo codes (QTCs) have also been conceived for near-hashing-bound transmission of quantum information over memoryless quantum channels. However, in real physical situations, the memoryless channel assumption may not be well justified since the channel often exhibits memory of previous error events. Here, we investigate the performance of QTCs over depolarizing channels exhibiting memory and we show that they suffer from a performance degradation at low depolarizing probability values. In order to circumvent the performance degradation issue, we conceive a new coding scheme termed as quantum turbo coding scheme exploiting error-correlation (QTC-EEC) that is capable of utilizing the error-correlation while performing the iterative decoding at the receiver. The proposed QTC-EEC can achieve convergence threshold at a higher depolarizing probability for channels with a higher value of correlation parameter and achieve performance near to the capacity. Finally, we propose a joint decoding and estimation scheme for our QTC-EEC relying on correlation estimation (QTC-EEC-E) designed for more realistic quantum systems with unknown correlation parameter. Simulation results reveal that the proposed QTC-EEC-E can achieve the same performance as that of the ideal system of known correlation parameter and hence, demonstrate the accurate estimation of the proposed QTC-EEC-E.

Correlation, Decoding, Estimation, iterative decoding, Markov processes, Memoryless systems, Quantum channels with memory, quantum errorcorrection, quantum turbo codes, Turbo codes
2169-3536
1-16
Izhar, Mohd Azri Mohd
028b9c06-e36d-47f2-a0a3-6de485270790
Babar, Zunaira
6be57a06-6aa8-4bc2-824b-53381481f3d4
Nguyen, Hung Viet
6f5a71ef-ea98-49e0-9be7-7f5bb9880f52
Botsinis, Panagiotis
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Alanis, Dimitrios
8ae8ead6-3974-4886-8e17-1b4bff1d94e0
Chandra, Daryus
d629163f-25d0-42fd-a912-b35cd93e8334
Ng, Soon Xin
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Izhar, Mohd Azri Mohd
028b9c06-e36d-47f2-a0a3-6de485270790
Babar, Zunaira
6be57a06-6aa8-4bc2-824b-53381481f3d4
Nguyen, Hung Viet
6f5a71ef-ea98-49e0-9be7-7f5bb9880f52
Botsinis, Panagiotis
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Alanis, Dimitrios
8ae8ead6-3974-4886-8e17-1b4bff1d94e0
Chandra, Daryus
d629163f-25d0-42fd-a912-b35cd93e8334
Ng, Soon Xin
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Izhar, Mohd Azri Mohd, Babar, Zunaira, Nguyen, Hung Viet, Botsinis, Panagiotis, Alanis, Dimitrios, Chandra, Daryus, Ng, Soon Xin and Hanzo, Lajos (2018) Quantum turbo decoding for quantum channels exhibiting memory. IEEE Access, 1-16. (doi:10.1109/ACCESS.2018.2808373).

Record type: Article

Abstract

Inspired by the success of classical turbo codes, quantum turbo codes (QTCs) have also been conceived for near-hashing-bound transmission of quantum information over memoryless quantum channels. However, in real physical situations, the memoryless channel assumption may not be well justified since the channel often exhibits memory of previous error events. Here, we investigate the performance of QTCs over depolarizing channels exhibiting memory and we show that they suffer from a performance degradation at low depolarizing probability values. In order to circumvent the performance degradation issue, we conceive a new coding scheme termed as quantum turbo coding scheme exploiting error-correlation (QTC-EEC) that is capable of utilizing the error-correlation while performing the iterative decoding at the receiver. The proposed QTC-EEC can achieve convergence threshold at a higher depolarizing probability for channels with a higher value of correlation parameter and achieve performance near to the capacity. Finally, we propose a joint decoding and estimation scheme for our QTC-EEC relying on correlation estimation (QTC-EEC-E) designed for more realistic quantum systems with unknown correlation parameter. Simulation results reveal that the proposed QTC-EEC-E can achieve the same performance as that of the ideal system of known correlation parameter and hence, demonstrate the accurate estimation of the proposed QTC-EEC-E.

Text
08299427 - Version of Record
Available under License Creative Commons Attribution.
Download (1MB)

More information

Accepted/In Press date: 20 February 2018
e-pub ahead of print date: 21 February 2018
Keywords: Correlation, Decoding, Estimation, iterative decoding, Markov processes, Memoryless systems, Quantum channels with memory, quantum errorcorrection, quantum turbo codes, Turbo codes

Identifiers

Local EPrints ID: 418406
URI: http://eprints.soton.ac.uk/id/eprint/418406
ISSN: 2169-3536
PURE UUID: 20dfd837-23d2-4763-b371-9b1f4257e0ff
ORCID for Hung Viet Nguyen: ORCID iD orcid.org/0000-0001-6349-1044
ORCID for Dimitrios Alanis: ORCID iD orcid.org/0000-0002-6654-1702
ORCID for Daryus Chandra: ORCID iD orcid.org/0000-0003-2406-7229
ORCID for Soon Xin Ng: ORCID iD orcid.org/0000-0002-0930-7194
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 07 Mar 2018 17:30
Last modified: 06 Jun 2024 02:10

Export record

Altmetrics

Contributors

Author: Mohd Azri Mohd Izhar
Author: Zunaira Babar
Author: Hung Viet Nguyen ORCID iD
Author: Panagiotis Botsinis
Author: Dimitrios Alanis ORCID iD
Author: Daryus Chandra ORCID iD
Author: Soon Xin Ng ORCID iD
Author: Lajos Hanzo ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×