CoChat

Entanglement-Assisted Quantum Turbo Codes

Open access
Wilde, Mark M., Hsieh, Min-Hsiu, Babar, Zunaira · 2014 · IEEE Transactions on Information Theory

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

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2013.2292052

Cites

98 of 98 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 98 references

Research works printed but not linked: 8

  1. preskill, 1999, Quantum Computation Lecture Notes, 15
  2. wilde, 2010, EA-Turbo
  3. babar, 2013, Convergence analysis of quantum turbo codes using EXIT charts
  4. poulin, 2009, Iterative Quantum Coding Schemes LDPC and Turbo Codes
  5. ollivier, 2008, Quantum turbo codes
  6. tillich, 2009, Quantum Codes Suitable for Iterative Decoding
  7. shor, 2002, The quantum channel capacity and coherent information, MSRI Workshop Quantum Comput
  8. mceliece, 1998, Communications and Coding (P G Farrell 60th Birthday Celebration), 121

Cited by

See all 116

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Entanglement-Assisted Quantum Turbo Codes. https://app.cochat.ai/papers/10.1109/tit.2013.2292052
The paper
Wilde, M. M., Hsieh, M.-H., & Babar, Z. (2014). Entanglement-Assisted Quantum Turbo Codes. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2013.2292052

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.