Entanglement-assisted quantum quasicyclic low-density parity-check codes
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
We investigate the construction of quantum low-density parity-check (LDPC) codes from classical quasicyclic (QC) LDPC codes with girth greater than or equal to 6. We have shown that the classical codes in the generalized Calderbank-Skor-Steane construction do not need to satisfy the dual-containing property as long as preshared entanglement is available to both sender and receiver. We can use this to avoid the many four cycles which typically arise in dual-containing LDPC codes. The advantage of such quantum codes comes from the use of efficient decoding algorithms such as sum-product algorithm (SPA). It is well known that in the SPA, cycles of length 4 make successive decoding iterations highly correlated and hence limit the decoding performance. We show the principle of constructing quantum QC-LDPC codes which require only small amounts of initial shared entanglement.
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
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
The Private Classical Capacity and Quantum Capacity of a Quantum Channel
Devetak, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839515 · Cited by 823
Self-citation
Cited by
Constructions of good entanglement-assisted quantum error correcting codes
Guenda, K., Jitman, S., & Gulliver, T. A. (2018) · Designs, Codes and Cryptography · doi:10.1007/s10623-017-0330-z · Cited by 255
Entanglement-Assisted Quantum Turbo Codes
Wilde, M. M., Hsieh, M.-H., & Babar, Z. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2292052 · Cited by 102
“[55], [56], [57], [7], [58], [59], [60], [61]).”
Self-citationTrading classical communication, quantum communication, and entanglement in quantum Shannon theory
Hsieh, M.-H., & Wilde, M. M. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054532 · Cited by 68
Self-citationPractical limits of error correction for quantum metrology
Shettell, N., Munro, W. J., Markham, D., & Nemoto, K. (2021) · New Journal of Physics · doi:10.1088/1367-2630/abf533 · Cited by 23
Metadata
- Authors
- Hsieh, M.-H., Brun, T. A., & Devetak, I.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2009-03-30
- Volume
- 79
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1967817162
- Cited by
- 85
- References
- 2
- FWCI
- 7.23
- Type
- journal article
- Language
- en
- Open access
- green
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 quasicyclic low-density parity-check codes. https://app.cochat.ai/papers/10.1103/physreva.79.032340
- The paper
- Hsieh, M.-H., Brun, T. A., & Devetak, I. (2009). Entanglement-assisted quantum quasicyclic low-density parity-check codes. Physical Review A. https://doi.org/10.1103/physreva.79.032340
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.