Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2602.09562 · International Conference on Quantum Communications, Networking, and Computing (QCNC)

Fidelity-Age-Aware Scheduling in Quantum Repeater Networks

Ozgur Ercetin, Zafer Gedik

quant-phcs.NISubmitted Feb 10, 2026• Announced Feb 11, 2026• 4 citations
arXivHTMLPDF

Abstract

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.

Journal reference
IEEE International Conference on Quantum Communications, Networking, and Computing (QCNC 2026)

Related papers

Age of Entanglement in Satellite Repeater Chains with Intermittent Availability

Elif Tuğçe Ceran

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.23985•IEEE Conference on Computer Communications (INFOCOM)•May 18, 2026•2 citations

Age of Quantum Information: Fidelity-Aware Teleportation Scheduling

Truman Welling, Aylin Yener

Age of Information (AoI) is a well-studied freshness metric of classical information. Motivated by fundamental differences between classical and quantum information, this paper studies transmission scheduling of quantum status updates using the quantum teleportation protocol, in an effort to define the age of quantum information. Specifically, we consider a time-slotted formulation where entanglement is distributed and an update arrives independently with fixed probability in each slot, which we analyze using a Markov decision process. We characterize the scheduling policy that minimizes a fidelity-aware age penalty function and show that it has a threshold structure.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•0 citations

On the Swapping Capacity of a Quantum Repeater

Van Sy Mai, Richard J. La, Abdella Battou +2 more

We study the capacity of a memory-based quantum repeater in entanglement swapping between two quantum links with either single or multiple memories, which we refer to as the end-to-end (E2E) entanglement throughput, subject to a constraint on the minimum fidelity. In order to approximate the E2E entanglement throughput, we adopt queueing models, where quantum links can have different characteristics: memory capacities, entanglement attempt rates and success probabilities, as well as classical communication latencies. We develop a model for estimating E2E entanglement fidelity, while taking into account the heterogeneous dephasing and depolarizing dynamics of quantum memories and Bell-state measurements in entanglement swapping as well as classical communication delays and noises. Finally, with the help of our models for approximating the E2E entanglement throughput and fidelity, we use the maximum waiting times of entanglements in quantum memories at the repeater as optimization variables to maximize the E2E entanglement throughput while ensuring required minimum E2E fidelity.

quant-pharXiv:2608.11429•Aug 13, 2026•3 citations

Request Scheduling in Quantum Networks

Claudio Cicconetti, Marco Conti, Andrea Passarella

Quantumnetworking is emerging as a new research area to explore the opportunities of interconnecting quantum systems through end-to-end entanglement of qubits at geographical distance via quantum repeaters. A promising architecture has been proposed in the literature that decouples entanglement between adjacent quantum nodes/repeaters from establishing end-to-end paths by adopting a time slotted approach. Within this model, we destructure further end-to-end path establishment into two subproblems: path selection and scheduling. The former is set to determine the best repeaters to connect two end nodes, provided that all their local entanglements have succeeded. On the other hand, scheduling is concerned with deciding, which pairs of end nodes are served in the current time slot, while the others remain queued for later time slots. Unlike path selection, scheduling has not been investigated so far in the literature, particularly in presence of quantum noise, which makes both problems even more challenging. In this article, we propose to address it via a general framework of heuristic algorithms, for which we propose three illustrative instances with the objective of keeping the application delay small while achieving a good system utilization, in terms of high entanglement rate and fidelity of remotely entangled qubits. The system proposed is evaluated extensively via event-driven quantum network simulations, with noisy repeaters, in different node topologies under a Poisson arrival of requests from quantum applications. The results show the existence of a fundamental tradeoff between system- and application-level metrics, such as fairness versus entanglement and fidelity, which lays the foundations for further studies in this thriving research area.

IEEE Transactions on Quantum Engineering•Jan 1, 2021•75 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.

quant-pharXiv:2602.14738•Feb 17, 2026•1 citation

Optimal Holding Times for Entanglement Swapping

Van Sy Mai, Richard J. La, Abdella Battou

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.

arXiv:2611.06823•Nov 4, 2026•0 citations
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.
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.
Age of Information (AoI) is a well-studied freshness metric of classical information. Motivated by fundamental differences between classical and quantum information, this paper studies transmission scheduling of quantum status updates using the quantum teleportation protocol, in an effort to define the age of quantum information. Specifically, we consider a time-slotted formulation where entanglement is distributed and an update arrives independently with fixed probability in each slot, which we analyze using a Markov decision process. We characterize the scheduling policy that minimizes a fidelity-aware age penalty function and show that it has a threshold structure.
We study the capacity of a memory-based quantum repeater in entanglement swapping between two quantum links with either single or multiple memories, which we refer to as the end-to-end (E2E) entanglement throughput, subject to a constraint on the minimum fidelity. In order to approximate the E2E entanglement throughput, we adopt queueing models, where quantum links can have different characteristics: memory capacities, entanglement attempt rates and success probabilities, as well as classical communication latencies. We develop a model for estimating E2E entanglement fidelity, while taking into account the heterogeneous dephasing and depolarizing dynamics of quantum memories and Bell-state measurements in entanglement swapping as well as classical communication delays and noises. Finally, with the help of our models for approximating the E2E entanglement throughput and fidelity, we use the maximum waiting times of entanglements in quantum memories at the repeater as optimization variables to maximize the E2E entanglement throughput while ensuring required minimum E2E fidelity.
Quantumnetworking is emerging as a new research area to explore the opportunities of interconnecting quantum systems through end-to-end entanglement of qubits at geographical distance via quantum repeaters. A promising architecture has been proposed in the literature that decouples entanglement between adjacent quantum nodes/repeaters from establishing end-to-end paths by adopting a time slotted approach. Within this model, we destructure further end-to-end path establishment into two subproblems: path selection and scheduling. The former is set to determine the best repeaters to connect two end nodes, provided that all their local entanglements have succeeded. On the other hand, scheduling is concerned with deciding, which pairs of end nodes are served in the current time slot, while the others remain queued for later time slots. Unlike path selection, scheduling has not been investigated so far in the literature, particularly in presence of quantum noise, which makes both problems even more challenging. In this article, we propose to address it via a general framework of heuristic algorithms, for which we propose three illustrative instances with the objective of keeping the application delay small while achieving a good system utilization, in terms of high entanglement rate and fidelity of remotely entangled qubits. The system proposed is evaluated extensively via event-driven quantum network simulations, with noisy repeaters, in different node topologies under a Poisson arrival of requests from quantum applications. The results show the existence of a fundamental tradeoff between system- and application-level metrics, such as fairness versus entanglement and fidelity, which lays the foundations for further studies in this thriving research area.
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 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.