One way quantum repeaters with quantum Reed-Solomon codes
Sreraman Muralidharan, Chang-Ling Zou, Linshu Li, Liang Jiang

TL;DR
This paper demonstrates that quantum Reed-Solomon codes can nearly achieve the capacity of quantum erasure channels and significantly improve key rates in one-way quantum repeaters compared to previous codes.
Contribution
It introduces quantum Reed-Solomon codes for quantum repeaters, showing their near-capacity performance and comparing different repeater generations for optimal operation.
Findings
Quantum Reed-Solomon codes approach quantum erasure channel capacity.
Significant improvement in key generation rate over previous codes.
Identification of optimal parameter regimes for different repeater generations.
Abstract
We show that quantum Reed-Solomon codes constructed from classical Reed-Solomon codes can approach the capacity on the quantum erasure channel of -level systems for large dimension . 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 generation of quantum repeaters using quantum Reed-Solomon codes and identify parameter regimes where each generation performs the best.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
