Entanglement-Assisted Quantum Turbo Codes
Open accessThe DOI matches its Crossref record; 98 of the 98 references it cites were found in a registry or an index.
Abstract
An unexpected breakdown in the existing theory of quantum serial turbo coding is that a quantum convolutional encoder cannot simultaneously be recursive and non-catastrophic. These properties are essential for quantum turbo code families to have a minimum distance growing with blocklength and for their iterative decoding algorithm to converge, respectively. Here, we show that the entanglement-assisted paradigm simplifies the theory of quantum turbo codes, in the sense that an entanglement-assisted quantum (EAQ) convolutional encoder can possess both of the aforementioned desirable properties. We give several examples of EAQ convolutional encoders that are both recursive and non-catastrophic and detail their relevant parameters. We then modify the quantum turbo decoding algorithm of Poulin , in order to have the constituent decoders pass along only extrinsic information to each other rather than a posteriori probabilities as in the decoder of Poulin , and this leads to a significant improvement in the performance of unassisted quantum turbo codes. Other simulation results indicate that entanglement-assisted turbo codes can operate reliably in a noise regime 4.73 dB beyond that of standard quantum turbo codes, when used on a memoryless depolarizing channel. Furthermore, several of our quantum turbo codes are within 1 dB or less of their hashing limits, so that the performance of quantum turbo codes is now on par with that of classical turbo codes. Finally, we prove that entanglement is the resource that enables a convolutional encoder to be both non-catastrophic and recursive because an encoder acting on only information qubits, classical bits, gauge qubits, and ancilla qubits cannot simultaneously satisfy them.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
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×
“…WH3 1/4 1/4 N5/7 PTO3 WH2 1/3 1/3 N3/4 PTO3 WH7 1/4 1/4 N3/4 PTO3 WH4 2/5 1/5 N3/4 PTO2 WH8 2/7 1/7 N5/7 PTO3 WH8 3/7 1/7 N3/4 PTO3 WH9 4/9 1/9 N3/4 PTO2 WH10 3/10 1/10 N5/7 WH11 WH3 1/2 1/4 N1/3 TABLE III VARIOUS COMBINATIONS OF ENCODERS FOR QUANTUM TURBO CODES AND THEIR MINIMUM DISTANCE SCALING.”
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
Bennett, C. H., & Wiesner, S. J. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2881 · Cited by 5,470 · cited 2×
“Also, the code loses its coset structure, so that C (I) is equal to the identity operator, C (L) is equivalent to just one logical operator, and the definition of the code’s minimum distance is the same as the classical definition.”
Mixed-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 benchmarks for the performance of any standard or entanglement-assisted quantum code on a depolarizing channel are the hashing bounds [21], [54].”
Near optimum error correcting coding and decoding: turbo-codes
Berrou, C., & Glavieux, A. (1996) · IEEE Transactions on Communications · doi:10.1109/26.539767 · Cited by 2,761 · cited 1×
“first observed that the [[7, 1, 3]] Steane code is equivalent to a [[6, 1, 3; 1]] entanglementassisted code that can also correct a single error on Bob’s half of the ebit.”
Error Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.793 · Cited by 2,677 · cited 1×
“That is, one could use the parity check matrix of a classical turbo code to build an EAQTC according to the well-known CSS construction [27], [28] and its entanglementassisted generalization [19], [20].”
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“That is, one could use the parity check matrix of a classical turbo code to build an EAQTC according to the well-known CSS construction [27], [28] and its entanglementassisted generalization [19], [20].”
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
Benedetto, S., Divsalar, D., Montorsi, G., & Pollara, F. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.669119 · Cited by 1,261
Unveiling turbo codes: some results on parallel concatenated coding schemes
Benedetto, S., & Montorsi, G. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485713 · Cited by 1,142 · cited 2×
“They are “probabilistic codes,” meaning that they possess sufficient structure to ensure efficient encoding and decoding, yet they have enough randomness to allow for analysis of their performance with the probabilistic method [2], [4], [5].”
Convolutional Codes and Their Performance in Communication Systems
Viterbi, A. (1971) · IEEE Transactions on Communication Technology · doi:10.1109/tcom.1971.1090700 · Cited by 1,012
Research works printed but not linked: 9
- [64] C.-Y. Lai, T. A. Brun, and M. M. Wilde, 'Dualities and identities for entanglement-assisted quantum codes,' October 2010, arXiv:1010.5506. - · arXiv
- [65] M. M. Wilde, 'EA-Turbo,' http://code.google.com/p/ea-turbo/, September 2010, Matlab and MEX software for characterizing and simulating entanglement-assisted quantum turbo codes (source code available under a GPL license). -
- [53] Z. Babar, S. X. Ng, and L. Hanzo, 'Convergence analysis of quantum turbo codes using EXIT charts,' 2013, unpublished manuscript. -
- [15] D. Poulin, 'Iterative quantum coding schemes: LDPC and turbo codes,' Online Presentation, April 2009, slide 92. [Online]. Available: http://www.physique.usherbrooke.ca/ { ∼ } dpoulin/Documents/IDQC09 { } McGill.pdf -
- [16] H. Ollivier, D. Poulin, and J.-P. Tillich, 'Quantum turbo codes,' October 2008, unpublished manuscript. -
- [18] J.-P. Tillich, 'Quantum codes suitable for iterative decoding,' Online presentation, May 2009. [Online]. Available: http: //www.infres.enst.fr/ { ∼ } markham/QuPa/28May/exposeJPTillich.pdf -
- [8] P. W. Shor, 'The quantum channel capacity and coherent information,' in Lecture Notes, MSRI Workshop on Quantum Computation , 2002. -
- [46] R. J. McEliece, Communications and Coding (P. G. Farrell 60th birthday celebration) . New York: John Wiley & Sons, 1998, ch. How to Compute Weight Enumerators for Convolutional Codes, pp. 121-141. -
- [48] R. J. McEliece, The Theory of Information and Coding . Cambridge University Press, 2002. -
Cited by
Items 101–116 of 116
樊, J.-H. 继. F., 夏, P.-W. 沛. X., 戴, D.-K. 迪. D., & 陈, Y.-X. 一. C. (2023) · Chinese Physics B · doi:10.1088/1674-1056/acf492 · Cited by 1
Şahinkaya, S., & Üstün, D. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04796-5 · Cited by 1
“This innovation has spurred the creation of numerous effective EAQEC codes, with notable examples including [6, 10, 15, 17, 19–25, 28, 34, 35, 39].”
Some Results on Qudit Quantum Error-Correction
Gunderman, L. G. (2020) · UWSpace (University of Waterloo) · Cited by 1
Cao, M. (2020) · arXiv (Cornell University) · Cited by 1
Glisic, S., & Lorenzo, B. (2022) · Wiley eBooks · doi:10.1002/9781119790327.ch14 · Cited by 1
Quantum topological error correction codes for quantum computation and communication
Chandra, D. (2019) · ePrints Soton (University of Southampton)
Glisic, S., & Lorenzo, B. (2022) · Wiley eBooks · doi:10.1002/9781119790327.ch1
Quantum Channel Information Theory
Glisic, S., & Lorenzo, B. (2022) · Wiley eBooks · doi:10.1002/9781119790327.ch9
Design and Implementation of Bit-Coupled Recursive Decoding for Turbo Codes for IoT Networks
Mori, K., Bisen, P. V., & Khatri, P. N. (2023) · INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT · doi:10.55041/ijsrem26123
Design of Recursive Decoding based Coupled Turbo Encoder-Decoder for VLSI Applications
Wamankar, R., & Raghuwanshi, A. (2024) · International Conference on Inventive Computation Technologies (ICICT) · doi:10.1109/icict60155.2024.10544543
A Partially Coupled Turbo Code Design for Error Detection and Correction in IoT Networks
Ahirwal, R. S., & Marmat, A. (2024) · International Journal of Advanced Engineering Research and Science · doi:10.22161/ijaers.118.1
A High Trustworthiness IoT System Design Based on Coupled Turbo Codes
Tekade, P., & Dubey, G. P. (2024) · Lecture notes in electrical engineering · doi:10.1007/978-981-97-2451-2_4
Quantum Error Correction and Stabilizer Codes
Xie, Y. (2016) · UNSWorks (UNSW Sydney) · doi:10.26190/unsworks/18894
Babar, Z., Chandra, D., Ng, S. X., & Hanzo, L. (2025) · Wiley eBooks · doi:10.1002/9781394331963.refs
Self-citationSalhab, A. M. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae35b1
Linear-Time Encodable Quantum Codes near the CSS GV BoundPreprint
Zhang, R. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.01277
“[WHB14] found entanglement-assistance bypasses this limitation and constructed an entanglement-assisted quantum convolutional encoder with improved iterative-decoding on the depolarizing channel.”
Metadata
- Authors
- Wilde, M. M., Hsieh, M.-H., & Babar, Z.
- Affiliations
- Louisiana State University (US)
- University of Technology Sydney (AU)
- University of Southampton (GB)
- Venue
- IEEE Transactions on Information Theory
- Published
- 2014-02
- Volume
- 60
- Issue
- 2
- Pages
- 1203-1222
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2040653896
- Cited by
- 102
- References
- 98
- Citations by year
- 2026: 2 · 2025: 7 · 2024: 6 · 2023: 9 · 2022: 17 · 2021: 13 · 2020: 10 · 2019: 8 · 2018: 7 · 2017: 5 · 2016: 9 · 2015: 2 · 2014: 5
- FWCI
- 6.98
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Civil War Book Review (submittedVersion)
- UTS ePRESS (University of Technology Sydney) (submittedVersion)
- arXiv (Cornell University)
- 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
- entanglement-assisted quantum codes, minimum distance, iterative decoding, extrinsic information, depolarizing channel, ancilla qubits
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.