Optimal Holding Times for Entanglement Swapping
Abstract
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.
Related
- Exact Entanglement Swapping through Single-Occupancy Measurements in Gaussian Fermion States
- Optimal Control of a Non-Stationary Inventory-Queue, with Applications to EV-Battery Swapping
- Moment-optimal Gamma approximation of Bessel Process exit times
- A characterization of submanifolds of ℝm × n satisfying optimal rigidity estimates
- Competing coherence geometries in positive maps: positivity hierarchies, atomicity, and optimal entanglement witnesses
BibTeX
@misc{mai2026optimal,
title = {{Optimal Holding Times for Entanglement Swapping}},
author = {Van Sy Mai and Richard J. La and Abdella Battou},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.06823},
eprint = {2611.06823},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.06823},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Optimal Holding Times for Entanglement Swapping
AU - Van Sy Mai
AU - Richard J. La
AU - Abdella Battou
PY - 2026
DA - 2026/11/04
PB - arXiv
DO - 10.48550/arxiv.2611.06823
UR - https://arxiv.org/abs/2611.06823
AB - 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.
ER -