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

Sebastiaan Brand, Tim Coopmans*, David Elkouss

*Corresponding author for this work

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationOSA Quantum 2.0. Conference, Quantum 2020
PublisherOSA - The Optical Society
Number of pages20
ISBN (Electronic)978-155752820-9
Publication statusPublished - 2020
EventOSA Quantum 2.0 Conference, QUANTUM 2020 - Virtual, Online, United States
Duration: 14 Sept 202017 Sept 2020

Publication series

NameOptics InfoBase Conference Papers

Conference

ConferenceOSA Quantum 2.0 Conference, QUANTUM 2020
Country/TerritoryUnited States
CityVirtual, Online
Period14/09/2017/09/20

Fingerprint

Dive into the research topics of 'Efficient computation of the waiting time and fidelity in quantum repeater chains'. Together they form a unique fingerprint.

Cite this