Timely availability of high-fidelity entanglement is essential for emerging quantum networks. This paper introduces the Age of Entanglement (AoE) as a novel performance metric that captures the freshness of bipartite entanglement under continuous distribution in quantum repeater chains. AoE extends classical Age of Information (AoI)-based metrics to quantum networking by capturing storage, decoherence, and probabilistic entanglement generation and swapping. We study a satellite-assisted quantum repeater network in which entangled pairs are generated probabilistically, stored in quantum memories that suffer from decoherence, and combined to form end-to-end entangled links. Satellite-ground connectivity is intermittent and modeled as a two-state Markov chain. The resulting AoE minimization problem is formulated as an infinite-horizon Markov decision process (MDP), where control actions determine when to generate, store, or swap entangled pairs under stochastic link availability and memory degradation. Using relative value iteration, we characterize AoE-optimal policies and evaluate their performance numerically. Our results highlight the impact of decoherence, imperfect operations, and visibility dynamics, and show that the proposed dynamic policies significantly outperform swap-as-soon-as-possible and greedy entanglement generation strategies. Our results provide practical design and control guidelines for satellite-enabled quantum repeater chains supporting continuous entanglement distribution.Timely availability of high-fidelity entanglement is essential for emerging quantum networks. This paper introduces the Age of Entanglement (AoE) as a novel performance metric that captures the freshness of bipartite entanglement under continuous distribution in quantum repeater chains. AoE extends classical Age of Information (AoI)-based metrics to quantum networking by capturing storage, decoherence, and probabilistic entanglement generation and swapping. We study a satellite-assisted quantum repeater network in which entangled pairs are generated probabilistically, stored in quantum memories that suffer from decoherence, and combined to form end-to-end entangled links. Satellite-ground connectivity is intermittent and modeled as a two-state Markov chain. The resulting AoE minimization problem is formulated as an infinite-horizon Markov decision process (MDP), where control actions determine when to generate, store, or swap entangled pairs under stochastic link availability and memory degradation. Using relative value iteration, we characterize AoE-optimal policies and evaluate their performance numerically. Our results highlight the impact of decoherence, imperfect operations, and visibility dynamics, and show that the proposed dynamic policies significantly outperform swap-as-soon-as-possible and greedy entanglement generation strategies. Our results provide practical design and control guidelines for satellite-enabled quantum repeater chains supporting continuous entanglement distribution.

arXiv:2602.23985Feb 27, 20260 citations

Fidelity-Age-Aware Scheduling in Quantum Repeater Networks

Özgür Erçetin, Z. Gedik

Quantum repeater networks distribute entanglement over long distances but must balance fidelity, delay, and resource contention. Prior work optimized throughput and end-to-end fidelity, yet little attention has been paid to the freshness of entanglement-the time since a usable Bell pair was last delivered. We introduce the Fidelity-Age (FA) metric, which measures this interval for states whose fidelity exceeds a threshold $F_{\min}$ . A renewal formulation links slot-level success probability to long-run average $\mathbf{F A}$ , enabling a stochastic control problem that minimizes FA under budget and memory limits. Two lightweight schedulers, FA-THR and FA-INDEX, approximate Lyapunov-drift-optimal control. Simulations on slotted repeater grids show that FA-aware scheduling preserves throughput while reducing extreme-age events by up to two orders of magnitude. FidelityAge thus provides a tractable, physically grounded metric for reliable and timely entanglement delivery in quantum networks.Quantum repeater networks distribute entanglement over long distances but must balance fidelity, delay, and resource contention. Prior work optimized throughput and end-to-end fidelity, yet little attention has been paid to the freshness of entanglement-the time since a usable Bell pair was last delivered. We introduce the Fidelity-Age (FA) metric, which measures this interval for states whose fidelity exceeds a threshold$F_{\min}$. A renewal formulation links slot-level success probability to long-run average$\mathbf{F A}$, enabling a stochastic control problem that minimizes FA under budget and memory limits. Two lightweight schedulers, FA-THR and FA-INDEX, approximate Lyapunov-drift-optimal control. Simulations on slotted repeater grids show that FA-aware scheduling preserves throughput while reducing extreme-age events by up to two orders of magnitude. FidelityAge thus provides a tractable, physically grounded metric for reliable and timely entanglement delivery in quantum networks.

International Conference on Quantum Communications, Networking, and Computing (QCNC)Apr 6, 20262 citations

Markov Chain Model of Entanglement Setup in Noisy Dynamic LEO Satellite Networks

Yifan Gao, Alvin Valera, Winston K. G. Seah

Quantum entanglement routing in dynamic Low Earth Orbit (LEO) satellite networks is important for achieving scalable and high-fidelity quantum communication. However, the dynamic characteristics of satellite network topology, limited quantum resources, and strict coherence time constraints pose significant challenges to reliable entanglement routing. An entanglement distribution analysis model for this unique environment is critical and helpful for entanglement routing research. We address the fundamental challenge of establishing and maintaining quantum entanglement links between satellites operating in free space, where links are subject to both transmission losses and quantum memory decoherence. This paper presents a comprehensive Markov chain model with a state space defined by link storage age and physical distance for analyzing entanglement distribution in noisy dynamic LEO satellite quantum networks. We construct transition matrices that capture system dynamics under varying request arrival rates, and derive analytical expressions for key performance metrics, including request satisfaction rate, average waiting time, link utilization efficiency, and average consumed link fidelity. Our analysis reveals that the critical trade-offs of higher request rates lead to faster link consumption with higher fidelity but potentially lower satisfaction rates, while lower request rates allow longer storage times at the cost of lower fidelity of increased decoherence effect. Moreover, this paper proves it is reasonable to leave out polarization rotation when the transmission distance is very short (40-50 km). In summary, this work provides theoretical foundations for designing and optimizing quantum entanglement distribution strategies in satellite networks, with applications to global-scale quantum communications.Quantum entanglement routing in dynamic Low Earth Orbit (LEO) satellite networks is important for achieving scalable and high-fidelity quantum communication. However, the dynamic characteristics of satellite network topology, limited quantum resources, and strict coherence time constraints pose significant challenges to reliable entanglement routing. An entanglement distribution analysis model for this unique environment is critical and helpful for entanglement routing research. We address the fundamental challenge of establishing and maintaining quantum entanglement links between satellites operating in free space, where links are subject to both transmission losses and quantum memory decoherence. This paper presents a comprehensive Markov chain model with a state space defined by link storage age and physical distance for analyzing entanglement distribution in noisy dynamic LEO satellite quantum networks. We construct transition matrices that capture system dynamics under varying request arrival rates, and derive analytical expressions for key performance metrics, including request satisfaction rate, average waiting time, link utilization efficiency, and average consumed link fidelity. Our analysis reveals that the critical trade-offs of higher request rates lead to faster link consumption with higher fidelity but potentially lower satisfaction rates, while lower request rates allow longer storage times at the cost of lower fidelity of increased decoherence effect. Moreover, this paper proves it is reasonable to leave out polarization rotation when the transmission distance is very short (40-50 km). In summary, this work provides theoretical foundations for designing and optimizing quantum entanglement distribution strategies in satellite networks, with applications to global-scale quantum communications.

quant-pharXiv:2512.20047Dec 24, 20250 citations

Fidelity-Age-Aware Scheduling in Quantum Repeater Networks

Ozgur Ercetin, Zafer Gedik

Quantum repeater networks distribute entanglement over long distances but must balance fidelity, delay, and resource contention. Prior work optimized throughput and end-to-end fidelity, yet little attention has been paid to the freshness of entanglement-the time since a usable Bell pair was last delivered. We introduce the Fidelity-Age (FA) metric, which measures this interval for states whose fidelity exceeds a threshold Fmin. A renewal formulation links slot-level success probability to long-run average FA, enabling a stochastic control problem that minimizes FA under budget and memory limits. Two lightweight schedulers, FA-THR and FA-INDEX, approximate Lyapunov-drift-optimal control. Simulations on slotted repeater grids show that FA-aware scheduling preserves throughput while reducing extreme-age events by up to two orders of magnitude. Fidelity-Age thus provides a tractable, physically grounded metric for reliable and timely entanglement delivery in quantum networks.Quantum repeater networks distribute entanglement over long distances but must balance fidelity, delay, and resource contention. Prior work optimized throughput and end-to-end fidelity, yet little attention has been paid to the freshness of entanglement-the time since a usable Bell pair was last delivered. We introduce the Fidelity-Age (FA) metric, which measures this interval for states whose fidelity exceeds a threshold Fmin. A renewal formulation links slot-level success probability to long-run average FA, enabling a stochastic control problem that minimizes FA under budget and memory limits. Two lightweight schedulers, FA-THR and FA-INDEX, approximate Lyapunov-drift-optimal control. Simulations on slotted repeater grids show that FA-aware scheduling preserves throughput while reducing extreme-age events by up to two orders of magnitude. Fidelity-Age thus provides a tractable, physically grounded metric for reliable and timely entanglement delivery in quantum networks.

quant-pharXiv:2602.09562Feb 11, 20260 citations

Single-Satellite Quantum Repeater Performance Analysis

Cameron Paterson, Jasminder S. Sidhu, Thomas Brougham +2 more

Satellite optical links may be able to extend quantum communication range beyond that which is possible through optical fibres which are constrained by exponential loss scaling. Quantum repeaters have been proposed to mitigate high channel losses in both fibre and satellite links. Although satellite quantum repeaters could improve entanglement distribution efficiency, the attempt rate is constrained by classical communication latency in the entanglement swapping step. Direct entanglement distribution does not suffer this latency and can therefore compensate for high dual-downlink losses by increasing the source rate. A systematic comparative analysis of repeater-assisted and direct entanglement distribution rates using a satellite is absent from the literature. In addition to entanglement distribution rates, a detailed analysis of the fidelity of entanglement distributed by repeater-assisted satellite links has yet to be performed. Here, we develop an in-depth framework for describing a space quantum link consisting of a single satellite and two ground stations. We compare the entanglement distribution rates of direct and repeater-assisted satellite entanglement distribution, taking into account variations in overpass geometry and quantum memory capacity. The long-term entanglement distribution performance to different pairs of major cities is also considered, and the altitudinal dependence is explored. Furthermore, we develop a Monte Carlo model of the repeater satellite to explore the effect that different memory management policies and capacities have on the waiting time statistics of memory qubits. From these statistics we calculate the fidelity distributions of the entangled pairs established between the ground stations. These results will inform mission design for future space-borne quantum repeater nodes, as well as requirements on space-based memory platforms.Satellite optical links may be able to extend quantum communication range beyond that which is possible through optical fibres which are constrained by exponential loss scaling. Quantum repeaters have been proposed to mitigate high channel losses in both fibre and satellite links. Although satellite quantum repeaters could improve entanglement distribution efficiency, the attempt rate is constrained by classical communication latency in the entanglement swapping step. Direct entanglement distribution does not suffer this latency and can therefore compensate for high dual-downlink losses by increasing the source rate. A systematic comparative analysis of repeater-assisted and direct entanglement distribution rates using a satellite is absent from the literature. In addition to entanglement distribution rates, a detailed analysis of the fidelity of entanglement distributed by repeater-assisted satellite links has yet to be performed. Here, we develop an in-depth framework for describing a space quantum link consisting of a single satellite and two ground stations. We compare the entanglement distribution rates of direct and repeater-assisted satellite entanglement distribution, taking into account variations in overpass geometry and quantum memory capacity. The long-term entanglement distribution performance to different pairs of major cities is also considered, and the altitudinal dependence is explored. Furthermore, we develop a Monte Carlo model of the repeater satellite to explore the effect that different memory management policies and capacities have on the waiting time statistics of memory qubits. From these statistics we calculate the fidelity distributions of the entangled pairs established between the ground stations. These results will inform mission design for future space-borne quantum repeater nodes, as well as requirements on space-based memory platforms.

quant-pharXiv:2604.16165Apr 20, 20260 citations

Probabilistic Cutoffs in Homogeneous Quantum Repeater Chains

Jeroen Grimbergen, Stav Haldar, Alvaro Gomez Inesta +1 more

We study quantum repeater chains in which entangled links between neighbouring nodes are created through heralded entanglement generation and adjacent links are swapped as soon as possible. Since heralded entanglement generation attempts succeed only probabilistically, some links will have to be stored in quantum memories at the nodes of the chain while waiting for adjacent links to be generated. The fidelity of these stored links decreases with time due to decoherence, and if they are stored for too long then this can lead to low end-to-end fidelity. Previous work has shown that the end-to-end fidelity can be improved by deterministically discarding links when their ages exceed some cutoff value. Such deterministic cutoff policies provide strict control of the fidelity of all links, but they come at the expense of having to track link ages. In this work, we introduce a probabilistic cutoff policy that does not require tracking link ages, at the cost of abandoning strict control of the fidelity. We benchmark this new probabilistic cutoff policy against a deterministic cutoff policy. We compare the policies in terms of the end-to-end rate and fidelity, and the secret-key rate. We find that even though the probabilistic cutoff policy keeps track of less state, it can provide secret-key rates of the same order of magnitude as the deterministic cutoff policy in chains with few nodes or high elementary link generation probabilities. Moreover, we identify a scenario in which the probabilistic cutoff policy can deliver end-to-end links that are required to have some minimum threshold fidelity at a higher rate than the deterministic cutoff policy.We study quantum repeater chains in which entangled links between neighbouring nodes are created through heralded entanglement generation and adjacent links are swapped as soon as possible. Since heralded entanglement generation attempts succeed only probabilistically, some links will have to be stored in quantum memories at the nodes of the chain while waiting for adjacent links to be generated. The fidelity of these stored links decreases with time due to decoherence, and if they are stored for too long then this can lead to low end-to-end fidelity. Previous work has shown that the end-to-end fidelity can be improved by deterministically discarding links when their ages exceed some cutoff value. Such deterministic cutoff policies provide strict control of the fidelity of all links, but they come at the expense of having to track link ages. In this work, we introduce a probabilistic cutoff policy that does not require tracking link ages, at the cost of abandoning strict control of the fidelity. We benchmark this new probabilistic cutoff policy against a deterministic cutoff policy. We compare the policies in terms of the end-to-end rate and fidelity, and the secret-key rate. We find that even though the probabilistic cutoff policy keeps track of less state, it can provide secret-key rates of the same order of magnitude as the deterministic cutoff policy in chains with few nodes or high elementary link generation probabilities. Moreover, we identify a scenario in which the probabilistic cutoff policy can deliver end-to-end links that are required to have some minimum threshold fidelity at a higher rate than the deterministic cutoff policy.

quant-pharXiv:2602.14738Feb 17, 20260 citations

F_{\min}

. A renewal formulation links slot-level success probability to long-run average

\mathbf{F A}

, enabling a stochastic control problem that minimizes FA under budget and memory limits. Two lightweight schedulers, FA-THR and FA-INDEX, approximate Lyapunov-drift-optimal control. Simulations on slotted repeater grids show that FA-aware scheduling preserves throughput while reducing extreme-age events by up to two orders of magnitude. FidelityAge thus provides a tractable, physically grounded metric for reliable and timely entanglement delivery in quantum networks.