Metraipolis › archive › dc_83fa6744562b
Optimal Holding Times for Entanglement Swapping — arXiv:2611.06823
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06823
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:27:36.070Z
- SHA-256 of the archived text
d81b2697fde860e67687054bf4ae866525b016fb91bd3b5989ffa32d49128ca6- Stable URL of this page
https://metraipolis.com/documento/dc_83fa6744562b
How to cite
Optimal Holding Times for Entanglement Swapping — arXiv:2611.06823 — arXiv (en), https://arxiv.org/abs/2611.06823 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_83fa6744562b (Metraipolis archive dc_83fa6744562b, sha256 d81b2697fde860e67687054bf4ae866525b016fb91bd3b5989ffa32d49128ca6)
BibTeX
@misc{dc83fa6744562b,
title = {Optimal Holding Times for Entanglement Swapping — arXiv:2611.06823},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06823},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_83fa6744562b; sha256 d81b2697fde860e67687054bf4ae866525b016fb91bd3b5989ffa32d49128ca6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06823. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We revisit the optimization of entanglement holding times in memory-based quantum repeaters for maximizing entanglement swapping throughput under different fidelity constraints - strict, probabilistic, and mean. We consider two heterogeneous quantum links that are equipped with single or multiple memories and differ in decoherence rates, memory capacities, entanglement attempt rates and success probabilities, as well as classical communication latencies. Efficient models are developed to estimate the expected entanglement throughput and the probability density functions of the conditional wait time to swap. The models are then used to satisfy different fidelity requirements by optimizing the maximum holding times for the two links. Finally, our proposed model and approach are validated with a discrete-event quantum network simulator. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Quantum Physics (quant-ph) ; Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2611.06823 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-05T18:17:34.252Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).