Reposition time in probabilistic imperfect memories
Praxmeyer, Ludmiła
الأصل · EN
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.
الترجمة العربية
لا توجد ترجمة عربية لهذا البحث بعد. كن أوّل من يطلبها: تستغرق ثوانيَ معدودة، وتُحفظ النتيجة لكل قارئ قادم.