One way quantum repeaters with quantum Reed-Solomon codes
arXiv:1801.06706 · doi:10.1103/PhysRevA.97.052316
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.
References in corpus (5)
Cited by in corpus (14)
- Quantum repeaters: From quantum networks to the quantum internet
- Quantum repeaters based on concatenated bosonic and discrete-variable quantum codes
- Asymptotic security of discrete-modulation protocols for continuous-variable quantum key distribution
- Entanglement distribution with minimal memory requirements using time-bin photonic qudits
- Quantum communication capacity transition of complex quantum networks
- Quantum key distribution over quantum repeaters with encoding: Using Error Detection as an Effective Post-Selection Tool
- Propagation of generalized Pauli errors in qudit Clifford circuits
- Absolutely maximally entangled states, quantum maximum distance separable codes, and quantum repeaters
- Decoding of Quantum Data-Syndrome Codes via Belief Propagation
- Deterministic generation of qudit photonic graph states from quantum emitters
- Aggregating Quantum Networks
- Parameter regimes for surpassing the PLOB bound with error-corrected qudit repeaters
- Optimal Error Correcting Code For Ternary Quantum Systems
- Resource Reduction in Multiplexed High-Dimensional Quantum Reed-Solomon Codes