Scholarlink

<p>Here we review analytical methods for computing the entanglement distribution time in first-generation quantum networks. We describe and briefly discuss the main schemes for entanglement generation, distillation, and swapping, and their combination in repeater chains, providing formulae for mean values and probability functions under a unified framework. We also derive some new expressions that help draw a more comprehensive picture, and present some scheme comparisons for different operational scenarios.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Analytical computation of entanglement distribution time in first-generation quantum repeater chains

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年6月20日

查看全文
  • Luca Tavanti

摘要

Here we review analytical methods for computing the entanglement distribution time in first-generation quantum networks. We describe and briefly discuss the main schemes for entanglement generation, distillation, and swapping, and their combination in repeater chains, providing formulae for mean values and probability functions under a unified framework. We also derive some new expressions that help draw a more comprehensive picture, and present some scheme comparisons for different operational scenarios.