2018/01/31 by Sreraman Muralidharan, Chang-Ling Zou, Chang‐Ling Zou +2 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Block code #Computer science #Concatenated error correction code #Decoding methods #Luby transform code #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum algorithm #Quantum capacity #Quantum channel #Quantum convolutional code #Quantum error correction #Quantum information #Quantum mechanics #Quantum network #Quantum-Dot Cellular Automata #Reed–Muller code #Reed–Solomon error correction #Tornado code #quant-ph
paper · pdf · doi:10.1103/physreva.97.052316
published as Phys. Rev. A 97, 052316 (2018)
openalex publication_date 2018/05/14 · arxiv created 2018/05/15 · arxiv updated 2018/05/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
We show that quantum Reed-Solomon codes constructed from classical Reed-Solomon codes can approach the capacity on the quantum erasure channel of d-level systems for large dimension d. We study the performance of one-way quantum repeaters with these codes and obtain a significant improvement in key generation rate compared to previously investigated encoding schemes with quantum parity codes and quantum polynomial codes. We also compare the three generations of quantum repeaters using quantum Reed-Solomon codes and identify parameter regimes where each generation performs the best.