Papers
Topics
Authors
Recent
Search
2000 character limit reached

Subexponential rate versus distance with time-multiplexed quantum repeaters

Published 3 May 2021 in quant-ph | (2105.01002v2)

Abstract: Quantum communications capacity using direct transmission over length-LL optical fiber scales as R∼e<sup>−α</sup>LR \sim e<sup>{-\alpha</sup> L}, where α\alpha is the fiber's loss coefficient. The rate achieved using a linear chain of quantum repeaters equipped with quantum memories, probabilistic Bell state measurements (BSMs) and switches used for spatial multiplexing, but no quantum error correction, was shown to surpass the direct-transmission capacity. However, this rate still decays exponentially with the end-to-end distance, viz., R∼e<sup>−sα</sup>LR \sim e<sup>{-s{\alpha</sup> L}}, with $s &lt; 1$. We show that the introduction of temporal multiplexing - i.e., the ability to perform BSMs among qubits at a repeater node that were successfully entangled with qubits at distinct neighboring nodes at {\em different} time steps - leads to a sub-exponential rate-vs.-distance scaling, i.e., R∼e<sup>−tα</sup>LR \sim e<sup>{-t\sqrt{\alpha</sup> L}}, which is not attainable with just spatial or spectral multiplexing. We evaluate analytical upper and lower bounds to this rate, and obtain the exact rate by numerically optimizing the time-multiplexing block length and the number of repeater nodes. We further demonstrate that incorporating losses in the optical switches used to implement time multiplexing degrades the rate-vs.-distance performance, eventually falling back to exponential scaling for very lossy switches. We also examine models for quantum memory decoherence and describe optimal regimes of operation to preserve the desired boost from temporal multiplexing. Quantum memory decoherence is seen to be more detrimental to the repeater's performance over switching losses.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.