arXiv:2610.07991
Entanglement Swapping Scheduling for Quantum Repeater Chains under Decoherence during Classical Communications
Jorge Benito Díaz, Andrés Agustí, Jabier Faba, Laura Ortiz, Luis Robledo, Vicente Martín
Abstract
First-generation quantum repeaters are essential in distributing entanglement over long distances since they could mitigate losses in optical fiber. Repeaters split the total distance into shorter, easier to generate links. Then, entanglement swapping establishes long range entanglement by performing local measurements at the repeaters and heralding their results. In this work, we develop an analytical model that estimates the impact of decoherence during heralding for a given protocol. Furthermore, we identify a competition between two phenomena: as repeater count increases, so does entanglement generation, but the additive impact of memory decoherence on final entanglement rate increases too. Therefore, we find that an optimal number of repeaters exists. These findings could lead the design of future quantum networks, both in the inter-repeater distance and swapping timings.
AI Summary
The paper studies how classical heralding delays and memory decoherence affect entanglement-swapping schedules and repeater placement in homogeneous, first-generation quantum repeater chains. It restricts attention to prepare-and-swap protocols: all elementary links are generated before swapping begins. Three schedules are compared: binary-tree, fully parallel, and a two-stage hybrid with an optimized block count. The model treats elementary-link generation as independent geometric processes, swapping as probabilistic, and stored pairs as Werner states with exponential memory decay. A cumulative “memory exposure” sums storage times across contributing entangled pairs, including generation waiting, global readiness signaling, and swap heralding. Performance is the expected delivered logarithmic negativity divided by expected execution time, incorporating early abort after swapping failures and restart signaling. Evaluations use baseline generation probability $p_0=0.5$, swapping success probability $q=0.8$, and initially perfect pairs. For a $60\,\mathrm{km}$ chain, the optimal repeater count is one at coherence time $\tau=3\,\mathrm{ms}$ and two at $6$ and $12\,\mathrm{ms}$; parallel swapping performs best near these optima. For $500\,\mathrm{km}$, short-memory cases peak around 10–11 repeaters, while $\tau=500\,\mathrm{ms}$ shifts the optimum downward. Hybrid scheduling generally performs best near the long-distance optima. These trends reflect competing link-generation improvements, accumulated decoherence, and the overall swapping-success factor $q^N$. The scope excludes swap-as-soon-as-possible and other fully reactive protocols. Multiplexing, heterogeneous chains, platform-specific noise, and purification are left for future extensions; the numerical parameters are reference values rather than a calibration to particular hardware.
Central claim may not hold: The claimed analytical framework lacks explicit evaluable expressions and sufficiently complete scheduling specifications to reproduce its central calculations. The supplied paper contains no plotted data or numerical tables and omits the attenuation coefficient and classical propagation speed needed to check its reported optimal repeater counts. Because swapping success already decreases as q^N, the reported rate optima do not isolate the contribution of memory decoherence, contrary to the abstract's simplified causal explanation.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 5 pages, 2 figures, Submitted to IEEE for possible publication