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:2610.02778

Performance Evaluation of Emerging Networks of Quantum Repeaters: Analysis and Simulation

Kobi Ravid, Javad Ghaderi, Gil Zussman

Published Oct 2, 2026• 0 citations
arXivHTMLPDF

Abstract

Emerging experimental quantum network deployments are based on collaborations between research institutions and rely on telecommunications fiber infrastructure. Currently, such networks consist of mostly Dual Input Repeaters (DIRs) and can be viewed as composed of (mostly) line graphs. In order to evaluate the performance of such networks (e.g., in terms of Entangled Pair Rate, EPR, and average Fidelity) we developed a custom quantum network simulation platform that takes into account both the quantum and classical network components. To support the verification of the simulation results, we develop a novel approach for performance analysis of DIRs. We compare the simulation results to the analytical results for DIRs and to prior results for repeaters with more than two inputs. We observe that although the expected memory utilization cannot be bounded, \emph{a small DIR memory size is sufficient and leads to minimal performance degradation}. For line networks with a single repeater and $3$ repeaters, we explore the dependency of incoming and outgoing memory size requirements on the number of nodes (network size), their connectivity (fiber length) and various quantum error settings (amplitude damping and phase flip channels). We evaluate the \emph{EPR} and the \emph{average Fidelity} for a sub-network of a deployed network with $3$ repeaters, using two alternative paths. We show that as the number of nodes increases or when the fiber lengths between nodes differ significantly, additional node memory is needed to maintain the same EPR (qubits are stored for longer duration to allow completion of entanglement across the network). We also show that the memory size should be above some minimum threshold to allow EP creation (EPR $>0$) as pair selection and swapping completion propagate across the network.

DOI
10.48550/arxiv.2610.02778

Related papers

Theoretical Analysis and Simulations of Memory-based and All-photonic Quantum Repeaters and Networks

Chuen Hei Chan, Charu Jain, Ezra Kissel +4 more

Developing and deploying advanced Quantum Repeater (QR) technologies will be necessary to scale quantum networks to longer distances. Depending on the error mitigation mechanisms adopted to suppress loss and errors, QRs are typically classified into memory-based or all-photonic QRs; and each type of QR may be best suited for a specific type of underlying quantum technology, a particular scale of quantum networks, or a specific regime of operational parameters. We perform theoretical analysis and simulations of quantum repeaters and networks to investigate the relative performance and resource requirements of different quantum network paradigms. Our results will help guide the optimization of quantum hardware and components and shed light on the role of a robust control plane. We present our research findings on theoretical analysis and simulations of memory-based first-generation trapped-ion quantum repeaters and networks, and all-photonic entanglement-based quantum repeaters and networks. We study the relative performance in terms of entanglement generation rate and fidelity, as well as the resource requirements of these two different quantum network paradigms.

quant-pharXiv:2512.23111•Journal of Physics Complexity•Dec 30, 2025•0 citations

A Comparative Study of All-Photonic and Memory-Based Quantum Repeaters and Networks

Ching-Lin Chan, Charu Jain, Ezra Kissel +4 more

Developing and deploying advanced Quantum Repeater (QR) technologies will be necessary to scale quantum networks at longer distances. Depending on the error mitigation mechanisms adopted to suppress loss and errors, QRs are typically classified into “memory-based” or “all-photonic” QRs, and each type of QR may be best suited for a specific type of underlying quantum technology, a particular scale of quantum network, or a specific regime of operational parameters. Modeling and simulation of quantum repeaters and networks can help in understanding the relative performance and resource requirements of different types of QRs, identify tradeoffs of alternative quantum network architectures, optimize quantum hardware, and assist in the design of a robust control plane. This paper introduces a quantum repeater simulation toolkit based on NetSquid, which includes component models and protocols to study advanced quantum repeater networks. We present our initial research findings on modeling and simulation of “allphotonic” entanglement-based QRs and “memory-based” first generation trapped ion QRs. We study the relative performance and resource requirements of these two different types of QRs and networks. The performance metrics include entanglement generation rate and fidelity between the endpoints of the network. For fair comparison of resource requirements of different types of QRs, entanglement generation rate is normalized by the total number of matter qubits involved.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•4 citations

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

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.

quant-pharXiv:2604.16165•Apr 20, 2026•0 citations

Combined Physical- and Link-Layer Protocols for Quantum Networks

Benedikt Baier, Ria Rosenauer, Vili Li +2 more

Future communication systems are expected to integrate quantum networks to enable highly secure communication and enhance computational capabilities. In quantum networks, communication is accomplished by sharing entanglement between remote locations, which is the basis for most known quantum protocols. Entanglement is a correlation between qubits that is not reproducible with classical means. However, as entanglement is susceptible to noise limiting its range, quantum repeaters can enable entanglement over more considerable distances. Using the entanglement swapping protocol, quantum repeaters can be placed between remote locations to establish entanglement. This requires each repeater to first generate entanglement with its neighboring nodes, named entanglement generation. However, as the size of current quantum networks is limited, the development and evaluation of quantum networks and quantum protocols is based on simulations. To simulate quantum networks accurately, accurate and high-performance models of the entanglement generation process must be employed. This paper proposes two new models for generating entanglement in simulations and develops quantum protocols for generating and purifying entanglement. The protocols are evaluated in thorough simulations under perfect and realistic conditions regarding delay and fidelity. Furthermore, the accuracy and runtime of the models are evaluated. The results show the models are accurate, with delay primarily influenced by the source duration, while longer coherence times significantly enhance fidelity. The model runtimes are consistently shorter than the simulation runtimes across all protocols, averaging about 2% of the total simulation time.

IEEE Transactions on Quantum Engineering•Nov 7, 2025•0 citations

Design and Evaluation of Communication Protocols for Quantum Repeater Networks

Luciano Aparicio

When built, quantum repeater networks will require classical network protocols to control the quantum operations. However, existing work on repeaters has focused on the quantum operations themselves, with less attention paid to the contents, semantics, ordering and reliability of the classical control messages. In this work we define and describe our implementation of the classical control protocols. The state machines and packet sequences for the three protocol layers are presented, and operation confirmed by running the protocols over simulations of the physical network. We also show that proper management of the resources in a bottleneck link allows the aggregate throughput of two end-to-end flows to substantially exceed that of a single flow. Our layered architectural framework will support independent evolution of the separate protocol layers. Networks of quantum repeaters utilize three concepts to execute a distributed algorithm that creates entangled quantum states between nodes that are far apart: a basic entanglement mechanism which depends on the physical implementation, error management (in this work, we study a method known as purification), and finally a quantum state propagation layer (here we implement entanglement swapping, which builds multi-hop connections from single-hop connections). Some researchers are investigating approaches that are substantially different from entanglement swapping [30, 24, 19]. Here we focus on swapping, but the layered architecture approach is broadly applicable, allowing other implementations to replace only a single layer in the protocol stack. Previous work primarily focused on the physical and mathematical tools for building repeaters. Classical information is also needed to enable teleportation and swapping, as many quantum operations are not deterministic, and results of quantum measurements need to be reported to distant partners before further operations can proceed. Also, operations in the middle of the network must be coordinated to route and swap properly. This requires classical messages to make operations robust, but message propagation times penalize performance. Even though this delay is usually included in repeater simulations, prior work has not defined the protocols in detail, especially with respect to how all of the nodes make consistent decisions in a timely fashion. In this work, we introduce a protocol stack for networks of quantum repeaters that considers all the necessary classical messages and which can be easily adapted for different approaches at all three protocol layers. We run simulations of competing flows on a dumbbell topology in order to increase our confidence in the behavior of our network protocols. By adjusting the fidelity thresholds required for entanglement swapping, we show that some configurations boost the aggregate throughput for multiple flows significantly above the maximum for a single flow, taking advantage of resources that would otherwise sit idle. The operation of such complex networks and such delicate tuning of the system without formal protocol definitions would not be possible. Previous work has also concentrated almost exclusively on the dedicated use of a single line or chain of repeaters, delivering Bell pairs only to the two nodes at the ends of the chain. Networks, however, typically have more than two end points, and allow any pair of these end nodes to communicate. More topologically complex networks, with numerous end nodes, are obviously much more scalable than connecting every possible pair of nodes using a dedicated line of repeaters. we investigate how classical multiplexing schemes translate to the domain of quantum repeaters, in order to manage shared resources and active communication flows of data from different stations. We simulate four sharing protocols in a complex network with competing traffic. Circuit switching gives any individual flow the best performance, but makes poor use of the overall network and is inflexible. We use circuit switching as our baseline case to compare time division multiplexing, buffer space multiplexing, and statistical multiplexing, and show that all multiplexing schemes are better than circuit switching. For the particular network simulated, we find that statistical multiplexing outperforms time division multiplexing by 28% and buffer space multiplexing by 13%. We find that all three multiplexing schemes are fair; each flow is penalized a similar percentage of its throughput as the the total number of users in the network increases. Finally, statistical multiplexing requires no network-wide coordination of the use of quantum memory or channels, and is easier to implement than a robust, scalable scheme for the other protocols. Our current results suggest that the best strategy for quantum repeater networks is statistical multiplexing. (This is in fact the quantum analogue of the basis on which the Internet works.) However, our current simulations are done with no degradation of memory over time, using the assumption of quantum error-corrected memory at each repeater; inclusion of decoherence and a finite qubit lifetime remains as future work.

•Sep 27, 2011•2 citations
Emerging experimental quantum network deployments are based on collaborations between research institutions and rely on telecommunications fiber infrastructure. Currently, such networks consist of mostly Dual Input Repeaters (DIRs) and can be viewed as composed of (mostly) line graphs. In order to evaluate the performance of such networks (e.g., in terms of Entangled Pair Rate, EPR, and average Fidelity) we developed a custom quantum network simulation platform that takes into account both the quantum and classical network components. To support the verification of the simulation results, we develop a novel approach for performance analysis of DIRs. We compare the simulation results to the analytical results for DIRs and to prior results for repeaters with more than two inputs. We observe that although the expected memory utilization cannot be bounded, \emph{a small DIR memory size is sufficient and leads to minimal performance degradation}. For line networks with a single repeater and 333 repeaters, we explore the dependency of incoming and outgoing memory size requirements on the number of nodes (network size), their connectivity (fiber length) and various quantum error settings (amplitude damping and phase flip channels). We evaluate the \emph{EPR} and the \emph{average Fidelity} for a sub-network of a deployed network with 333 repeaters, using two alternative paths. We show that as the number of nodes increases or when the fiber lengths between nodes differ significantly, additional node memory is needed to maintain the same EPR (qubits are stored for longer duration to allow completion of entanglement across the network). We also show that the memory size should be above some minimum threshold to allow EP creation (EPR >0>0>0) as pair selection and swapping completion propagate across the network.
Developing and deploying advanced Quantum Repeater (QR) technologies will be necessary to scale quantum networks to longer distances. Depending on the error mitigation mechanisms adopted to suppress loss and errors, QRs are typically classified into memory-based or all-photonic QRs; and each type of QR may be best suited for a specific type of underlying quantum technology, a particular scale of quantum networks, or a specific regime of operational parameters. We perform theoretical analysis and simulations of quantum repeaters and networks to investigate the relative performance and resource requirements of different quantum network paradigms. Our results will help guide the optimization of quantum hardware and components and shed light on the role of a robust control plane. We present our research findings on theoretical analysis and simulations of memory-based first-generation trapped-ion quantum repeaters and networks, and all-photonic entanglement-based quantum repeaters and networks. We study the relative performance in terms of entanglement generation rate and fidelity, as well as the resource requirements of these two different quantum network paradigms.
Developing and deploying advanced Quantum Repeater (QR) technologies will be necessary to scale quantum networks at longer distances. Depending on the error mitigation mechanisms adopted to suppress loss and errors, QRs are typically classified into “memory-based” or “all-photonic” QRs, and each type of QR may be best suited for a specific type of underlying quantum technology, a particular scale of quantum network, or a specific regime of operational parameters. Modeling and simulation of quantum repeaters and networks can help in understanding the relative performance and resource requirements of different types of QRs, identify tradeoffs of alternative quantum network architectures, optimize quantum hardware, and assist in the design of a robust control plane. This paper introduces a quantum repeater simulation toolkit based on NetSquid, which includes component models and protocols to study advanced quantum repeater networks. We present our initial research findings on modeling and simulation of “allphotonic” entanglement-based QRs and “memory-based” first generation trapped ion QRs. We study the relative performance and resource requirements of these two different types of QRs and networks. The performance metrics include entanglement generation rate and fidelity between the endpoints of the network. For fair comparison of resource requirements of different types of QRs, entanglement generation rate is normalized by the total number of matter qubits involved.
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.
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.
Future communication systems are expected to integrate quantum networks to enable highly secure communication and enhance computational capabilities. In quantum networks, communication is accomplished by sharing entanglement between remote locations, which is the basis for most known quantum protocols. Entanglement is a correlation between qubits that is not reproducible with classical means. However, as entanglement is susceptible to noise limiting its range, quantum repeaters can enable entanglement over more considerable distances. Using the entanglement swapping protocol, quantum repeaters can be placed between remote locations to establish entanglement. This requires each repeater to first generate entanglement with its neighboring nodes, named entanglement generation. However, as the size of current quantum networks is limited, the development and evaluation of quantum networks and quantum protocols is based on simulations. To simulate quantum networks accurately, accurate and high-performance models of the entanglement generation process must be employed. This paper proposes two new models for generating entanglement in simulations and develops quantum protocols for generating and purifying entanglement. The protocols are evaluated in thorough simulations under perfect and realistic conditions regarding delay and fidelity. Furthermore, the accuracy and runtime of the models are evaluated. The results show the models are accurate, with delay primarily influenced by the source duration, while longer coherence times significantly enhance fidelity. The model runtimes are consistently shorter than the simulation runtimes across all protocols, averaging about 2% of the total simulation time.
When built, quantum repeater networks will require classical network protocols to control the quantum operations. However, existing work on repeaters has focused on the quantum operations themselves, with less attention paid to the contents, semantics, ordering and reliability of the classical control messages. In this work we define and describe our implementation of the classical control protocols. The state machines and packet sequences for the three protocol layers are presented, and operation confirmed by running the protocols over simulations of the physical network. We also show that proper management of the resources in a bottleneck link allows the aggregate throughput of two end-to-end flows to substantially exceed that of a single flow. Our layered architectural framework will support independent evolution of the separate protocol layers. Networks of quantum repeaters utilize three concepts to execute a distributed algorithm that creates entangled quantum states between nodes that are far apart: a basic entanglement mechanism which depends on the physical implementation, error management (in this work, we study a method known as purification), and finally a quantum state propagation layer (here we implement entanglement swapping, which builds multi-hop connections from single-hop connections). Some researchers are investigating approaches that are substantially different from entanglement swapping [30, 24, 19]. Here we focus on swapping, but the layered architecture approach is broadly applicable, allowing other implementations to replace only a single layer in the protocol stack. Previous work primarily focused on the physical and mathematical tools for building repeaters. Classical information is also needed to enable teleportation and swapping, as many quantum operations are not deterministic, and results of quantum measurements need to be reported to distant partners before further operations can proceed. Also, operations in the middle of the network must be coordinated to route and swap properly. This requires classical messages to make operations robust, but message propagation times penalize performance. Even though this delay is usually included in repeater simulations, prior work has not defined the protocols in detail, especially with respect to how all of the nodes make consistent decisions in a timely fashion. In this work, we introduce a protocol stack for networks of quantum repeaters that considers all the necessary classical messages and which can be easily adapted for different approaches at all three protocol layers. We run simulations of competing flows on a dumbbell topology in order to increase our confidence in the behavior of our network protocols. By adjusting the fidelity thresholds required for entanglement swapping, we show that some configurations boost the aggregate throughput for multiple flows significantly above the maximum for a single flow, taking advantage of resources that would otherwise sit idle. The operation of such complex networks and such delicate tuning of the system without formal protocol definitions would not be possible. Previous work has also concentrated almost exclusively on the dedicated use of a single line or chain of repeaters, delivering Bell pairs only to the two nodes at the ends of the chain. Networks, however, typically have more than two end points, and allow any pair of these end nodes to communicate. More topologically complex networks, with numerous end nodes, are obviously much more scalable than connecting every possible pair of nodes using a dedicated line of repeaters. we investigate how classical multiplexing schemes translate to the domain of quantum repeaters, in order to manage shared resources and active communication flows of data from different stations. We simulate four sharing protocols in a complex network with competing traffic. Circuit switching gives any individual flow the best performance, but makes poor use of the overall network and is inflexible. We use circuit switching as our baseline case to compare time division multiplexing, buffer space multiplexing, and statistical multiplexing, and show that all multiplexing schemes are better than circuit switching. For the particular network simulated, we find that statistical multiplexing outperforms time division multiplexing by 28% and buffer space multiplexing by 13%. We find that all three multiplexing schemes are fair; each flow is penalized a similar percentage of its throughput as the the total number of users in the network increases. Finally, statistical multiplexing requires no network-wide coordination of the use of quantum memory or channels, and is easier to implement than a robust, scalable scheme for the other protocols. Our current results suggest that the best strategy for quantum repeater networks is statistical multiplexing. (This is in fact the quantum analogue of the basis on which the Internet works.) However, our current simulations are done with no degradation of memory over time, using the assumption of quantum error-corrected memory at each repeater; inclusion of decoherence and a finite qubit lifetime remains as future work.