Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group
Conferences > QUANTUM > 2020 > QTh7A > QTh7A.11

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

Sebastiaan Brand, Tim Coopmans, and David Elkouss

Not Accessible

Your library or personal account may give you access

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.

© 2020 The Author(s)

PDF Article
More Like This
Routing on quantum repeater networks

William J. Munro and Kae Nemoto
FTh3D.4 CLEO: QELS_Fundamental Science (CLEO:FS) 2020

Hybrid Quantum Networks for High-Fidelity Entanglement Distribution

Yuan Lee, Eric Bersin, Axel Dahlberg, Stephanie Wehner, and Dirk Englund
FTh3D.5 CLEO: QELS_Fundamental Science (CLEO:FS) 2020

Error mitigation protocol for multi-photon noise in quantum repeater chains

Yousef K. Chahine, Ian R. Nemitz, and John D. Lekki
QTh4B.6 Quantum 2.0 (QUANTUM) 2023

View More...

Poster Presentation

Media 1: PDF (2310 KB)     
Select as filters
Select Topics Cancel
Top
       
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.
Privacy | Terms of Use