Efficient computation of the waiting time and fidelity in quantum repeater chains
Sebastiaan Brand, Tim Coopmans, David Elkouss

TL;DR
This paper introduces two efficient algorithms for calculating the waiting time and fidelity of entangled pairs in quantum repeater chains, significantly improving computational efficiency and enabling analysis of large-scale quantum networks.
Contribution
The paper presents polynomial-time algorithms for analyzing quantum repeater chains, including protocols with entanglement distillation, surpassing previous exponential-time methods.
Findings
Algorithms analyze chains with thousands of segments
Faster runtime than existing methods
Able to handle refined repeater protocols
Abstract
Quantum communication enables a host of applications that cannot be achieved by classical communication means, with provably secure communication as one of the prime examples. The distance that quantum communication schemes can cover via direct communication is fundamentally limited by losses on the communication channel. By means of quantum repeaters, the reach of these schemes can be extended and chains of quantum repeaters could in principle cover arbitrarily long distances. In this work, we provide two efficient algorithms for determining the generation time and fidelity of the first generated entangled pair between the end nodes of a quantum repeater chain. The runtime of the algorithms increases polynomially with the number of segments of the chain, which improves upon the exponential runtime of existing algorithms. Our first algorithm is probabilistic and can analyze refined…
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.
