A Study of Superadditivity in Quantum Channel by Reed-Solomon Codes

Giuliano G. La Guardia

Sreraman Muralidharan, Chang‐Ling Zou, Linshu Li +1 more

Fuyin Tian, Shixin Zhu

Masahide Sasaki, Kentaro Kato, Masayuki Izutsu +1 more

Giuliano G. La Guardia

New asymmetric quantum generalized Reed-Solomon (RS) codes with parameters [[N = mn, K = m(2k - n + c), dz≥ d/dx≥ [d - c)]]q, where q is a prime power, 1m, k = n - d + 1, and n, d >; c + 1, c ≥ 1, m ≥ 1 are integers, are constructed in this paper. These new codes can be utilized in quantum channels having great asymmetry.

Sreraman Muralidharan, Chang‐Ling Zou, Linshu Li +1 more

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.