Characterization of waiting times in different models of quantum networks

Quantum networks, like classical communication networks such as the Internet, enable a connection between potentially distant users. For this purpose, entangled quantum states are distributed across the individual connections and can be used, for example, for provably secure communication using quantum cryptography. Quantum networks consist of many different probabilistic building blocks: Both the generation of entangled states and their transmission between different network nodes and the connection of neighboring links correspond to different stochastic processes. This book presents and compares various modeling options for these processes. The aim in each case is to calculate the waiting time until an end-to-end connection is created between the communication partners.