Efficient Computation of the Waiting Time and Fidelity in Quantum Repeater Chains (QTh7A.11)
Presenter: Tim Coopmans, Delft University of Technology
We provide two algorithms for computing the probability distribution of waiting time and fidelity in quantum repeater chains constructed from probabilistic components. Their polynomial runtimes improve upon existing algorithms' exponential scaling.
Authors:Sebastiaan Brand, Leiden University / Tim Coopmans, Delft University of Technology / David Elkouss, Delft University of Technology