pith. sign in

arxiv: 1309.1106 · v1 · pith:QRTK2ESRnew · submitted 2013-09-04 · 🪐 quant-ph

Finite-range multiplexing enhances quantum key distribution via quantum repeaters

classification 🪐 quant-ph
keywords multiplexingquantumprotocolraterepeaterconnectiondistributionfinite-range
0
0 comments X
read the original abstract

Quantum repeaters represent one possible way to achieve long-distance quantum key distribution. Collins et al. in [Phys. Rev. Lett. 98, 060502 (2007)] proposed multiplexing as method to increase the repeater rate and to decrease the requirement in memory coherence time. Motivated by the experimental fact that long-range connections are practically demanding, in this paper we extend the original quantum repeater multiplexing protocol to the case of short-range connection. We derive analytical formulas for the repeater rate and we show that for short connection lengths it is possible to have most of the benefits of a full-range multiplexing protocol. Then we incorporate decoherence of quantum memories and we study the optimal matching for the Bell-state measurement protocol permitting to minimize memory requirements. Finally, we calculate the secret key rate and we show that the improvement via finite-range multiplexing is of the same order of magnitude as via full-range multiplexing.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.