Efficient computation of the waiting time and fidelity in quantum repeater chains
More Info
expand_more
expand_more
Abstract
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.