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

International Conference on Communications

Probabilistic end-to-end quality of service in networks of quantum repeaters

Jelena Mišić, Vojislav B. Mišić

Published May 24, 2026• 0 citations
Publisher

Abstract

We model a multihop quantum repeater network for establishing high fidelity entanglement link between non-neighboring quantum repeater nodes. We have used random times for quantum and classical communication instead of slotted time concept widely used in literature. We model a single repeater using theory of M/G/m + r queues, and apply the Jackson network principle to model the network over repeater nodes. This model allows derivation of distribution of end-to-end entanglement delivery time and probability of decoherence.

DOI
10.1109/icc59461.2026.11587769

Related papers

Analysis of QoS in Networks of Quantum Repeaters

Jelena Mišić, Vojislav B. Mišić

In this work we consider a quantum network consisting of multiple interconnected quantum repeaters. In this network, data plane of communication is achieved by photon transmission over fibre cables, while the control plane which transmits results of measurements and control information is implemented over classical Internet. Important part of the control plane is the server which distributes connection requests and entanglement resources to nodes involved in the path. Together, data and control plane establish reliable multi hop links over the network deploying purification and swapping operations. We analyze the performance of such a network using probabilistic model of communication time between repeaters, rather than slotted time. We consider random arrivals of connection requests to each repeater and variable path lengths. We model a single repeater using theory of$M^{[x]}/G/m+r$queues where each batch request encompasses heralding, purification, and swapping times pertaining to a single repeater node. To model the network, we have used the concept of Jackson's network over repeater nodes in the path. This model allows derivation of end-to-end entanglement delivery time as random distribution and calculation of probability of decoherence of qubits stored in quantum memories over the path. We considered different numbers of entanglements per request and different types of quantum memories. Results of this analysis are useful for dimensioning capacities of quantum repeaters, memories and links in order to avoid decoherence of quantum memories.

IEEE Transactions on Network Science and Engineering•Jan 1, 2026•1 citation

Asynchronous entanglement routing for the quantum internet

Zebo Yang, Ali Ghubaish, Raj Kumar Jain +2 more

With the emergence of the Quantum Internet, the need for advanced quantum networking techniques has significantly risen. Various models of quantum repeaters have been presented, each delineating a unique strategy to ensure quantum communication over long distances. We focus on repeaters that employ entanglement generation and swapping. This revolves around establishing remote end-to-end entanglement through repeaters, a concept we denote as the “quantum-native” repeaters (also called “first-generation” repeaters in some literature). The challenges in routing with quantum-native repeaters arise from probabilistic entanglement generation and restricted coherence time. Current approaches use synchronized time slots to search for entanglement-swapping paths, resulting in inefficiencies. Here, we propose a new set of asynchronous routing protocols for quantum networks by incorporating the idea of maintaining a dynamic topology in a distributed manner, which has been extensively studied in classical routing for lossy networks, such as using a destination-oriented directed acyclic graph or a spanning tree. The protocols update the entanglement-link topology asynchronously, identify optimal entanglement-swapping paths, and preserve unused direct-link entanglements. Our results indicate that asynchronous protocols achieve a larger upper bound with an appropriate setting and significantly higher entanglement rate than existing synchronous approaches, and the rate increases with coherence time, suggesting that it will have a much more profound impact on quantum networks as technology advances.

arXiv:2312.14300•AVS Quantum Science•Jan 18, 2024•35 citations

Stochastic Multipath Routing for High-Throughput Entanglement Distribution in Quantum Repeater Networks

Ankit Mishra, Kang Hao Cheong

Quantum repeater networks distribute entanglement over lossy links while many users share a limited pool of entangled pairs. Most existing routing schemes either always use a single best path or rely on global optimizations that are hard to run in real time. Here we propose and analyze a simple alternative: a stochastic multipath rule in which each entanglement request is sent at random along one of several edge-disjoint repeater paths, with a single parameter that controls the bias between shorter and longer routes. Using a distance-dependent lossy network model with finite per-link capacities and probabilistic entanglement swapping, we develop an analytic description of the resulting end-to-end entanglement rate as a function of this bias and validate it with large-scale numerical simulations. We find that an intermediate bias consistently outperforms both deterministic extremes across distances, traffic patterns, attenuation, swapping noise, and congestion, bringing the rate close to simple capacity upper bounds and making link usage more even across networks. These results identify stochastic multipath routing as a lightweight classical control strategy for boosting performance and scalability in near-term quantum repeater networks.

quant-pharXiv:2603.25563•Physical Review A•Mar 27, 2026•0 citations

A Reliable Routing Method for Remote Entanglement Distribution under Limited Resources

Tianzhu Hu, Xiaofeng Jiang, Tianze Zhu +3 more

Generating and distributing entangled pairs between arbitrary nodes is essential to fully realize the network's capabilities, with the challenges of limited qubit resources, severe decoherence and stochastic physical mechanism. In this paper, we model the service process of quantum repeater nodes based on the concept of queuing theory to help characterize their availability. Further, we propose a link-disjoint multi-path routing algorithm, with repeaters' availability, nodes' qubit capacity, entangled links' fidelity and classical delay taken into consideration. The performance of our scheme has been evaluated with simulated environment and compared with other existing routing schemes.

International Conference on Advanced Communications Technology (ICACT)•Feb 4, 2024•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
We model a multihop quantum repeater network for establishing high fidelity entanglement link between non-neighboring quantum repeater nodes. We have used random times for quantum and classical communication instead of slotted time concept widely used in literature. We model a single repeater using theory of M/G/m + r queues, and apply the Jackson network principle to model the network over repeater nodes. This model allows derivation of distribution of end-to-end entanglement delivery time and probability of decoherence.
In this work we consider a quantum network consisting of multiple interconnected quantum repeaters. In this network, data plane of communication is achieved by photon transmission over fibre cables, while the control plane which transmits results of measurements and control information is implemented over classical Internet. Important part of the control plane is the server which distributes connection requests and entanglement resources to nodes involved in the path. Together, data and control plane establish reliable multi hop links over the network deploying purification and swapping operations. We analyze the performance of such a network using probabilistic model of communication time between repeaters, rather than slotted time. We consider random arrivals of connection requests to each repeater and variable path lengths. We model a single repeater using theory ofM[x]/G/m+rM^{[x]}/G/m+rM[x]/G/m+rqueues where each batch request encompasses heralding, purification, and swapping times pertaining to a single repeater node. To model the network, we have used the concept of Jackson's network over repeater nodes in the path. This model allows derivation of end-to-end entanglement delivery time as random distribution and calculation of probability of decoherence of qubits stored in quantum memories over the path. We considered different numbers of entanglements per request and different types of quantum memories. Results of this analysis are useful for dimensioning capacities of quantum repeaters, memories and links in order to avoid decoherence of quantum memories.
With the emergence of the Quantum Internet, the need for advanced quantum networking techniques has significantly risen. Various models of quantum repeaters have been presented, each delineating a unique strategy to ensure quantum communication over long distances. We focus on repeaters that employ entanglement generation and swapping. This revolves around establishing remote end-to-end entanglement through repeaters, a concept we denote as the “quantum-native” repeaters (also called “first-generation” repeaters in some literature). The challenges in routing with quantum-native repeaters arise from probabilistic entanglement generation and restricted coherence time. Current approaches use synchronized time slots to search for entanglement-swapping paths, resulting in inefficiencies. Here, we propose a new set of asynchronous routing protocols for quantum networks by incorporating the idea of maintaining a dynamic topology in a distributed manner, which has been extensively studied in classical routing for lossy networks, such as using a destination-oriented directed acyclic graph or a spanning tree. The protocols update the entanglement-link topology asynchronously, identify optimal entanglement-swapping paths, and preserve unused direct-link entanglements. Our results indicate that asynchronous protocols achieve a larger upper bound with an appropriate setting and significantly higher entanglement rate than existing synchronous approaches, and the rate increases with coherence time, suggesting that it will have a much more profound impact on quantum networks as technology advances.
Quantum repeater networks distribute entanglement over lossy links while many users share a limited pool of entangled pairs. Most existing routing schemes either always use a single best path or rely on global optimizations that are hard to run in real time. Here we propose and analyze a simple alternative: a stochastic multipath rule in which each entanglement request is sent at random along one of several edge-disjoint repeater paths, with a single parameter that controls the bias between shorter and longer routes. Using a distance-dependent lossy network model with finite per-link capacities and probabilistic entanglement swapping, we develop an analytic description of the resulting end-to-end entanglement rate as a function of this bias and validate it with large-scale numerical simulations. We find that an intermediate bias consistently outperforms both deterministic extremes across distances, traffic patterns, attenuation, swapping noise, and congestion, bringing the rate close to simple capacity upper bounds and making link usage more even across networks. These results identify stochastic multipath routing as a lightweight classical control strategy for boosting performance and scalability in near-term quantum repeater networks.
Generating and distributing entangled pairs between arbitrary nodes is essential to fully realize the network's capabilities, with the challenges of limited qubit resources, severe decoherence and stochastic physical mechanism. In this paper, we model the service process of quantum repeater nodes based on the concept of queuing theory to help characterize their availability. Further, we propose a link-disjoint multi-path routing algorithm, with repeaters' availability, nodes' qubit capacity, entangled links' fidelity and classical delay taken into consideration. The performance of our scheme has been evaluated with simulated environment and compared with other existing routing schemes.
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.