CoChat

Quantum Turbo Decoding for Quantum Channels Exhibiting Memory

Open access

The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.

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

Overview

Integrity signals

Registry

Crossref · 10.1109/access.2018.2808373

Cites

56 of 56 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Cited by

See all 9

Metadata

Authors
Mohd Izhar, M. A., Babar, Z., Nguyen, H. V., Botsinis, P., Alanis, D., Chandra, D., Ng, S. X., & Hanzo, L.
Affiliations
  • University of Southampton (GB)
  • University of Surrey (GB)
Venue
IEEE Access
Published
2018
Volume
6
Pages
12369-12381
ISSN
2169-3536 (ISSN-L)
OpenAlex
W2793613756
Cited by
9
References
56
Citations by year
2025: 1 · 2024: 1 · 2023: 1 · 2022: 1 · 2021: 2 · 2020: 1 · 2019: 2
FWCI
0.70
Type
journal article
Language
en
Open access
Locations
  • IEEE Access (publishedVersion, cc-by)
  • ePrints Soton (University of Southampton) (acceptedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Greater South Information System
Funders
  • Ministry of Higher Education, Malaysia
  • UTM Razak School of Engineering and Advanced Technology, Universiti Teknologi Malaysia, through HIGDR (R.K130000.7740.4J314)
  • European Research Council through the Advanced Fellow Grant
  • Royal Society’s Wolfson Research Merit Award
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
Keywords
depolarizing channel, error correlation, iterative decoding, convergence threshold, correlation parameter estimation, quantum information transfer

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.