Analytical and numerical bounds on entanglement delivery waiting times

Conference paper (2023)

Authors

Sebastiaan Brand Universiteit Leiden

T.J. Coopmans Universiteit Leiden

D. Elkouss Coronas Okinawa Institute of Science and Technology Graduate University, Quantum Computer Science - , QuTech Advanced Research Centre

Boxi Li Forschungszentrum Jülich

Affiliation

QuTech Advanced Research Centre

DOI: https://doi.org/10.1117/12.2651134

Entanglement Quantum Internet Quantum Networks Quantum Communication Quantum Repeaters Waiting Time

To reference this document use:

http://resolver.tudelft.nl/uuid:e60b7c5e-ce2e-4b52-a3b7-1178b54afe5e

More Info

expand_more

Published Date

2023

Language

English

Reuse Rights

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.

Affiliation

QuTech Advanced Research Centre

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.

Files

124460B.pdf

(.pdf | 0.305 Mb)

- Embargo expired in 08-09-2023