Optimising repeater schemes for the quantum internet
Kenneth Goodenough, David Elkouss, Stephanie Wehner

TL;DR
This paper introduces an efficient heuristic algorithm to optimize quantum repeater schemes, significantly improving entanglement distribution rates across various experimental implementations for the quantum internet.
Contribution
Developed a heuristic optimization algorithm for quantum repeater schemes, enabling better entanglement distribution across different experimental platforms.
Findings
Strong improvement over simpler repeater schemes.
Identification of critical parameters for entanglement generation.
Performance comparison of different repeater implementations.
Abstract
The rate at which quantum communication tasks can be performed using direct transmission is fundamentally hindered by the channel loss. Quantum repeaters allow, in principle, to overcome these limitations, but their introduction necessarily adds an additional layer of complexity to the distribution of entanglement. This additional complexity - along with the stochastic nature of processes such as entanglement generation, Bell swaps, and entanglement distillation - makes finding good quantum repeater schemes non-trivial. We develop an algorithm that can efficiently perform a heuristic optimisation over a subset of quantum repeater schemes for general repeater platforms. We find a strong improvement in the generation rate in comparison to an optimisation over a simpler class of repeater schemes based on BDCZ repeater schemes. We use the algorithm to study three different experimental…
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.
