SAMOP 2021 – scientific programme

Parts | Days | Selection | Search | Updates | Downloads | Help

QI: Fachverband Quanteninformation

QI 8: Quantum Information: Poster (joint session QI/Q)

QI 8.11: Poster

Wednesday, September 22, 2021, 16:30–18:30, P

Average waiting times for entanglement links in quantum networks — •Lisa Weinbrenner, Lina Vandré, and Otfried Gühne — Universität Siegen, Deutschland

In quantum communication protocols using noisy channels the error probability typically scales exponentially with the length of the channel. To reach long-distance entanglement distribution, one can use quantum repeaters. These schemes involve first a generation of elementary bipartite entanglement links between two nodes and then measurements to join the elementary links. Since the generation of an elementary link is probabilistic and quantum memories have a limited storage time, the generation of a long-distance entangled link is probabilistic, too [1].

While the average waiting time for the generation of such a link in the case of just two elementary links is well understood [2], there is no analytical expression known for more than two links. The aim of this contribution is to explore estimations on the average waiting time for a long-distance entangled link for arbitrary network sizes.

[1] S. Khatri et al., Phys. Rev. Research 1, 023032 (2019)

[2] O. A. Collins et al., Phys. Rev. Lett 98, 060502 (2007)