Improved analytical bounds on delivery times of long-distance entanglement
Tim Coopmans, Sebastiaan Brand, David Elkouss
Abstract
The ability to distribute high-quality entanglement between remote parties is a key element of many quantum network applications, and knowledge of the time at which entanglement is delivered is crucial for assessing the viability of different approaches. In this work, the authors provide improved analytical bounds on the average and on the quantiles of the completion time of entanglement distribution protocols in the case that all network components have success probabilities lower bounded by a constant.
Topics & Concepts
Quantum entanglementBounded functionKey (lock)QuantileComputer scienceUpper and lower boundsQuantum key distributionConstant (computer programming)Statistical physicsQuantumMathematicsQuantum mechanicsPhysicsStatisticsComputer securityMathematical analysisProgramming languageQuantum Information and CryptographyQuantum Computing Algorithms and ArchitectureQuantum Mechanics and Applications