Reposition time in probabilistic imperfect memories

Abstract

We present the analysis of behavior of N identical finite time memories with the imperfections characterized by a step-function model, based on a study of independent copies of the geometric distribution. We show a step-by-step derivation of a formula for the average waiting time for obtaining N successes within a given time span τ, which was used recently in the analysis of quantum repeater rates.

Cited by in corpus (6)

• On the waiting time in quantum repeaters with probabilistic entanglement swapping
• Tools for quantum network design
• Improved analytical bounds on delivery times of long-distance entanglement
• Memory-assisted long-distance phase-matching quantum key distribution
• On the design and analysis of near-term quantum network protocols using Markov decision processes
• Entanglement buffering with two quantum memories