Efficient computation of the waiting time and fidelity in quantum repeater chains

Conference paper (2020)

Authors

Sebastiaan Brand Universiteit Leiden

T.J. Coopmans QuTech Advanced Research Centre, QID/Elkouss Group - QuTech Advanced Research Centre

D. Elkouss Coronas QuTech Advanced Research Centre, Quantum Information and Software -

Research Group

QID/Elkouss Group (QuTech Advanced Research Centre) (TU Delft)

To reference this document use:

http://resolver.tudelft.nl/uuid:959a8083-b383-4247-95d6-02a9e252da0d

More Info

expand_more

Published Date

2020

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

QuTech Advanced Research Centre

Department

Quantum Internet Division

Research Group

QID/Elkouss Group

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.