Analytical computation of entanglement distribution time in first-generation quantum repeater chains

Here we review analytical methods for computing the entanglement distribution time in first-generation quantum networks. We describe and briefly discuss the main schemes for entanglement generation, distillation, and swapping, and their combination in repeater chains, providing formulae for mean values and probability functions under a unified framework. We also derive some new expressions that help draw a more comprehensive picture, and present some scheme comparisons for different operational scenarios.