Quantum Turbo Decoding for Quantum Channels Exhibiting Memory
Open accessThe 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
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Berrou, C., Glavieux, A., & Thitimajshima, P. (2002) · Proceedings of ICC '93 - IEEE International Conference on Communications · doi:10.1109/icc.1993.397441 · Cited by 6,738 · cited 1×
“Inspired by the near-capacity performance of the classical turbo codes [6], quantum serial turbo codes or also known as quantum turbo codes (QTCs) were conceived in [7] and [8] and later extended for entanglement-assisted coding schemes in [9]–[12].”
BackgroundMixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272 · cited 1×
“The resultant CM Q (0, p) value is the same as the hashing bound of CQ(p) = 1 − Hb(p) − p · log2(3), which sets the lower bound of communicating over a memoryless depolarizing channel [44].”
BackgroundScheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479 · cited 2×
“The first quantum code was introduced by Shor in 1995 [2] that was only capable of correcting a single qubit error in a ninequbit block code.”
BackgroundMethodQuantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2011) · Cited by 2,724
Convergence behavior of iteratively decoded parallel concatenated codes
ten Brink, S. (2001) · IEEE Transactions on Communications · doi:10.1109/26.957394 · Cited by 2,386 · cited 2×
“The performance curves can be improved to closely approach p = pE by increasing the number of iterations and by using higher interleaving depths [48].”
MethodDecoherence-Free Subspaces for Quantum Computation
Lidar, D. A., Chuang, I. L., & Whaley, K. B. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.2594 · Cited by 1,858 · cited 2×
“[36] proposed concatenated coding schemes relying on the 3-qubit repetition code and a specific code based on the decoherence-free subspace formalism of [5] which was investigated in the context of a bit-flip (or a phase-flip) quantum channel.”
BackgroundMethodDynamical Decoupling of Open Quantum Systems
Viola, L., Knill, E., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.2417 · Cited by 1,808 · cited 2×
“More explicitly, the [3,1,3] QCC employed as both the outer and inner component codes correspond to the code configuration termed as ‘‘PTO1R’’ in [10].”
MethodQuantum Communication through an Unmodulated Spin Chain
Bose, S. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.207901 · Cited by 1,407 · cited 1×
“Physical examples of channels exhibiting a memory in quantum information processing are constituted by unmodulated spin chains [18], [19], micromasers [20], and fibre optics [21], [22].”
BackgroundZanardi, P., & Rasetti, M. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.3306 · Cited by 1,315
General state changes in quantum theory
Kraus, K. (1971) · Annals of Physics · doi:10.1016/0003-4916(71)90108-4 · Cited by 747 · cited 1×
“For a memoryless Pauli channel, the completely positive trace-preserving mapping of an input quantum state having a density operator ρ in its operator-sum (or Kraus) representation [38] is given by [39]:”
Method
Cited by
Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
“Furthermore, the extension of classical turbo codes to quantum turbo codes with error correction for frequency selective channels has been proposed in [34].”
BackgroundDecoding algorithms for surface codes
deMarti iOlius, A., Fuentes, P., Orús, R., Crespo, P. M., & Etxezarreta Martinez, J. (2024) · Quantum · doi:10.22331/q-2024-10-10-1498 · Cited by 60
“Modifications of decoders to take into account correlated noise have been already proposed for quantum turbo codes over channels with memory, resulting in a considerably improved performance of the code when compared to the decoder that is blind to the correlation (Mohd Izhar et al., 2018).”
BackgroundExperimental characterization of a non-Markovian quantum process
Goswami, K., Giarmatzi, C., Monterola, C. P., Shrapnel, S., Romero, J., & Costa, F. (2021) · Physical Review A · doi:10.1103/physreva.104.022432 · Cited by 44
Martínez, J. E., Fuentes, P., Crespo, P. M., & Garcia‐Frias, J. (2020) · IEEE Access · doi:10.1109/access.2020.3025619 · Cited by 40
“For this type of channel, the correlation between the single qubit Pauli operators of the set P 1 can be described by means of a 4-state Markov chain [68]–[71].”
BackgroundMethodInfluentialToward Quantum-Native Communication Systems: State-of-the-Art, Trends, and Challenges
Zhou, X., Shen, A., Hu, S., Ni, W., Wang, X., & Hossain, E. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3575842 · Cited by 66
“Hence, Izhar et al. [279] examined quantum turbo codes (QTCs) in the face of depolarizing channels exhibiting memory and proposed a QTC scheme capable of exploiting error correlation during decoding.”
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)
- ORCID
- 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
- gold
- doi.org
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum Turbo Decoding for Quantum Channels Exhibiting Memory. https://app.cochat.ai/papers/10.1109/access.2018.2808373
- The paper
- Mohd Izhar, M. A., Babar, Z., Nguyen, H. V., Botsinis, P., Alanis, D., Chandra, D., Ng, S. X., & Hanzo, L. (2018). Quantum Turbo Decoding for Quantum Channels Exhibiting Memory. IEEE Access. https://doi.org/10.1109/access.2018.2808373
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.