Analytical and numerical bounds on entanglement delivery waiting times
Sebastiaan Brand (Universiteit Leiden)
T.J. Coopmans (Universiteit Leiden)
David Elkouss Coronas (TU Delft - QuTech Advanced Research Centre, Okinawa Institute of Science and Technology Graduate University, TU Delft - Quantum Computer Science)
Boxi Li (Forschungszentrum Jülich)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
The vision of a global network that enables quantum communications between any point on Earth is known as the quantum internet. One crucial element of this network is the use of quantum repeater chains, which have the potential to overcome transmission losses and implement entanglement or quantum key distribution protocols over extended distances. There are various proposals for quantum repeaters, but they can generally be evaluated based on two main figures of merit: the average time for end-to-end entanglement delivery and the associated average fidelity. However, characterizing these quantities can be difficult due to factors such as feedback loops, decoherence, entanglement generation being a probabilistic process, and the potential failure of subprotocols. In this talk, I will discuss algorithmic and analytical methods for computing these quantities for relevant families of protocols.