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

Entanglement topography of large-scale quantum networks

Md Sohel Mondal, Dov Fields, Vladimir S. Malinovsky, Siddhartha Santra

Published Dec 26, 2023• 6 citations
arXivHTMLPDF

Abstract

Large-scale quantum networks, necessary for distributed quantum information processing, are posited to have quantum entangled systems between distant network nodes. The extent and quality of distributed entanglement in a quantum network, that is its functionality, depends on its topology, edge-parameter distributions and the distribution protocol. We uncover the parametric entanglement topography and introduce the notion of typical and maximal viable regions for entanglement-enabled tasks in a general model of large-scale quantum networks. We show that such a topographical analysis, in terms of viability regions, reveals important functional information about quantum networks, provides experimental targets for the edge parameters and can guide efficient quantum network design. Applied to a photonic quantum network, such a topographical analysis shows that in a network with radius $10^3$ kms and 1500 nodes, arbitrary pairs of nodes can establish quantum secure keys at a rate of $R_{sec}=1$ kHz using $1$ MHz entanglement generation sources on the edges and as few as 3 entanglement swappings at intermediate nodes along network paths.

DOI
10.48550/arxiv.2312.16009

Related papers

Quantum connectivity of quantum networks

Md Sohel Mondal, Shashank Shekhar, Siddhartha Santra

The practical utility of a quantum network depends on its ability to establish entanglement between arbitrary node pairs with quality sufficient to execute entanglement enabled tasks. This capability can be assessed globally, through aggregate performance over all node pairs, as well as locally, at the level of individual nodes. Since entanglement-based connections form a layer above the underlying physical topology, quantum connectivity is not adequately captured by classical topological connectivity metrics. To enable characterisation of the quantum connectivity at the level of the network (or its subnetworks), we introduce the quantum connectivity measure (QCM), which quantifies the average connection quality between pairs of network nodes. Further, we describe two quantities, the quantum-connected fraction (QCF) and the quantum clustering coefficient (QCC), naturally derived from the QCM, which capture important features of the functional connectivity of the quantum network at the level of the network and an individual node, respectively. These metrics of quantum connectivity depend crucially on the entanglement distribution protocol and the quantum network parameters in addition to its physical topology. We demonstrate the crucial distinction between topological and quantum connectivity, showing that even a fully connected graph can be functionally disconnected for quantum tasks if average network edge-concurrence falls below a critical threshold. These quantum connectivity metrics thus provide important tools for the design, optimization, and benchmarking of future quantum networks.

quant-pharXiv:2603.29601•APS Open Science•Apr 1, 2026•0 citations

Realizing Scalability Limits of Quantum Communication Networks

Connor Howe, Ali Anwar

The scalability of quantum communication networks is crucial for enabling secure information exchange and distributed quantum computing across global infrastructures. However, achieving scalability remains a significant challenge due to the effects of decoherence, photon loss, and fidelity degradation over extended distances. This paper performs a critical investigation into the scalability limits of quantum communication networks, focusing on the interplay between entanglement generation rates, end-to-end fidelity, and network parameters such as node separation, noise levels, and total distance. Leveraging the SeQUeNCe simulation framework, we model adaptable trapped-ion repeater networks to uncover fundamental insights into both homogeneous and heterogeneous configurations. Our findings reveal transformative insights that help reshape system designs for near term quantum networks. We identify maximum node separation thresholds critical for practical implementations, illuminate the non-linear degradation of fidelity with increasing distance, and expose how routing and swapping protocols influence entanglement success rates at scale. Most notably, we demonstrate that while additional repeaters can mitigate distance-induced failures, excessive node counts introduce compounding fidelity losses that threaten network viability under certain architectures. These results provide a roadmap for revolutionizing quantum networks, with actionable design strategies such as optimized node placement, advanced routing algorithms, and the adoption of cutting-edge qubit technologies like topological qubits. By addressing key bottlenecks in quantum communication scalability, our work lays the foundation for the next generation of global quantum networks.

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

A Connection-Oriented Entanglement Distribution Design in Quantum Networks

Jian Li, Qidong Jia, Kaiping Xue +2 more

Quantum networks create a completely new way for communication, and the most important function of a quantum network is to generate long-distance quantum entanglement to serve a number of quantum applications. As the scale of the network expands, in order to establish end-to-end entanglement between two remote nodes, entangled pairs need to be generated and distributed among multiple repeaters along the path from the source to the destination, which requires a specific protocol to negotiate resource allocations and quantum operations among the repeaters. Thus, to realize such remote entanglement distribution in a quantum network, designing a stable and reliable protocol becomes urgent and necessary. In this article, we focus on how to guarantee the generation rate of entangled pairs between any two quantum nodes to meet the requirements of various quantum applications in a large-scale quantum network. We present a connection-oriented entanglement distribution protocol inspired by the connection-oriented communication model in classical networks. Our protocol is located in the network layer of the quantum network to enable end-to-end quantum communication. Three main features are provided by the proposed protocol: 1) it is reliable and can guarantee the successful entanglement generation; 2) it can reduce the influence of quantum decoherence via reducing the latency caused by resource competition; and 3) it can guarantee the rate of generating entanglement between two quantum nodes according to the requirement of quantum applications.

IEEE Transactions on Quantum Engineering•Jan 1, 2022•34 citations

End-to-end entanglement of quantum network paths with multiparameter states

Md Sohel Mondal, Aniket Zambare, Siddhartha Santra

Long-range entanglement distribution in a quantum network relies on entanglement swapping at intermediate nodes along a network path to connect short-range entangled states established over the network edges. The end-to-end entanglement of a network path obtained via this process determines the utility of the network path for executing entanglement enabled tasks and for the design of entanglement routing protocols in the quantum network. Here we study the end-to-end entanglement of paths in a quantum network when the edges are characterized by multiparameter quantum states that may be considered to be the output of arbitrary and unknown quantum channels described by the network's edges. We find that over ensembles of multiparameter states with fixed concurrence but varying density matrix elements, the end-to-end entanglement takes a range of values upper bounded by a function of the concurrence of the network-edge states. The scaling behavior of the average end-to-end entanglement reveals that its distribution gets increasingly concentrated around the mean as the paths become longer. For a network path of a given length, the average end-to-end entanglement vanishes for edge concurrence values below a threshold that increases with the path length. Although, for edge concurrence values greater than the threshold the average end-to-end entanglement increases faster with the length of the path. As an implication of our results, we show that the optimal path for entanglement distribution between a pair of end nodes, connected by alternate paths with multiparameter states along the edges, can be indeterminate given only entanglement guarantees along the network edges.

arXiv:2506.22245•Physical Review A•Nov 7, 2025•0 citations

QUANTUM ENTANGLEMENT SWAPPING IN MULTI-NODE QUANTUM NETWORKS: EFFICIENCY AND SCALABILITY ANALYSIS

Muzafarova Sevinch Muhammadovna

This paper investigates the scalability and transmission efficiency of entanglement swapping protocols within multi-node quantum networks. As the realization of a global quantum internet relies heavily on long-distance entanglement distribution, quantum repeaters utilizing entanglement swapping serve as a critical backbone. However, scalability remains a bottleneck due to photon loss, operational infidelities, and quantum memory coherence times. In this study, we analytically model a multi-node quantum chain and evaluate how the end-to-end entanglement fidelity degrades as the number of intermediate nodes scales up. Our analysis highlights the critical thresholds for Bell state measurement (BSM) success rates required to maintain quantum state integrity across large distances. The findings provide optimization constraints for designing scalable and fault-tolerant routing protocols in future quantum information networks.

International Journal of Emerging Innovations in Science and Technology•Jun 8, 2026•0 citations

Entanglement-Efficient Distribution of Quantum Circuits Over Large-Scale Quantum Networks

Felix Burt, Kuan‐Cheng Chen, Kin Kwong Leung

Quantum computers face inherent scaling challenges, a fact that necessitates investigation of distributed quantum computing systems, whereby scaling is achieved through interconnection of smaller quantum processing units. However, connecting large numbers of QPUs will eventually result in connectivity constraints at the network level, where the difficulty of entanglement sharing increases with network path lengths. This increases the complexity of the quantum circuit partitioning problem, since the cost of generating entanglement between end nodes varies with network topologies and existing links. We address this challenge using a simple modification to existing partitioning schemes designed for all-to-all connected networks, that efficiently accounts for both of these factors. We investigate the performance in terms of entanglement requirements and optimisation time of various quantum circuits over different network topologies, achieving lower entanglement costs in the majority of cases than state-of-the-art methods. We provide techniques for scaling to large-scale quantum networks employing both network and problem coarsening. We show that coarsened methods can achieve improved solution quality in most cases with significantly lower run-times than direct partitioning methods.

arXiv:2507.16036•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•7 citations
Large-scale quantum networks, necessary for distributed quantum information processing, are posited to have quantum entangled systems between distant network nodes. The extent and quality of distributed entanglement in a quantum network, that is its functionality, depends on its topology, edge-parameter distributions and the distribution protocol. We uncover the parametric entanglement topography and introduce the notion of typical and maximal viable regions for entanglement-enabled tasks in a general model of large-scale quantum networks. We show that such a topographical analysis, in terms of viability regions, reveals important functional information about quantum networks, provides experimental targets for the edge parameters and can guide efficient quantum network design. Applied to a photonic quantum network, such a topographical analysis shows that in a network with radius 10310^3103 kms and 1500 nodes, arbitrary pairs of nodes can establish quantum secure keys at a rate of Rsec=1R_{sec}=1Rsec​=1 kHz using 111 MHz entanglement generation sources on the edges and as few as 3 entanglement swappings at intermediate nodes along network paths.
The practical utility of a quantum network depends on its ability to establish entanglement between arbitrary node pairs with quality sufficient to execute entanglement enabled tasks. This capability can be assessed globally, through aggregate performance over all node pairs, as well as locally, at the level of individual nodes. Since entanglement-based connections form a layer above the underlying physical topology, quantum connectivity is not adequately captured by classical topological connectivity metrics. To enable characterisation of the quantum connectivity at the level of the network (or its subnetworks), we introduce the quantum connectivity measure (QCM), which quantifies the average connection quality between pairs of network nodes. Further, we describe two quantities, the quantum-connected fraction (QCF) and the quantum clustering coefficient (QCC), naturally derived from the QCM, which capture important features of the functional connectivity of the quantum network at the level of the network and an individual node, respectively. These metrics of quantum connectivity depend crucially on the entanglement distribution protocol and the quantum network parameters in addition to its physical topology. We demonstrate the crucial distinction between topological and quantum connectivity, showing that even a fully connected graph can be functionally disconnected for quantum tasks if average network edge-concurrence falls below a critical threshold. These quantum connectivity metrics thus provide important tools for the design, optimization, and benchmarking of future quantum networks.
The scalability of quantum communication networks is crucial for enabling secure information exchange and distributed quantum computing across global infrastructures. However, achieving scalability remains a significant challenge due to the effects of decoherence, photon loss, and fidelity degradation over extended distances. This paper performs a critical investigation into the scalability limits of quantum communication networks, focusing on the interplay between entanglement generation rates, end-to-end fidelity, and network parameters such as node separation, noise levels, and total distance. Leveraging the SeQUeNCe simulation framework, we model adaptable trapped-ion repeater networks to uncover fundamental insights into both homogeneous and heterogeneous configurations. Our findings reveal transformative insights that help reshape system designs for near term quantum networks. We identify maximum node separation thresholds critical for practical implementations, illuminate the non-linear degradation of fidelity with increasing distance, and expose how routing and swapping protocols influence entanglement success rates at scale. Most notably, we demonstrate that while additional repeaters can mitigate distance-induced failures, excessive node counts introduce compounding fidelity losses that threaten network viability under certain architectures. These results provide a roadmap for revolutionizing quantum networks, with actionable design strategies such as optimized node placement, advanced routing algorithms, and the adoption of cutting-edge qubit technologies like topological qubits. By addressing key bottlenecks in quantum communication scalability, our work lays the foundation for the next generation of global quantum networks.
Quantum networks create a completely new way for communication, and the most important function of a quantum network is to generate long-distance quantum entanglement to serve a number of quantum applications. As the scale of the network expands, in order to establish end-to-end entanglement between two remote nodes, entangled pairs need to be generated and distributed among multiple repeaters along the path from the source to the destination, which requires a specific protocol to negotiate resource allocations and quantum operations among the repeaters. Thus, to realize such remote entanglement distribution in a quantum network, designing a stable and reliable protocol becomes urgent and necessary. In this article, we focus on how to guarantee the generation rate of entangled pairs between any two quantum nodes to meet the requirements of various quantum applications in a large-scale quantum network. We present a connection-oriented entanglement distribution protocol inspired by the connection-oriented communication model in classical networks. Our protocol is located in the network layer of the quantum network to enable end-to-end quantum communication. Three main features are provided by the proposed protocol: 1) it is reliable and can guarantee the successful entanglement generation; 2) it can reduce the influence of quantum decoherence via reducing the latency caused by resource competition; and 3) it can guarantee the rate of generating entanglement between two quantum nodes according to the requirement of quantum applications.
Long-range entanglement distribution in a quantum network relies on entanglement swapping at intermediate nodes along a network path to connect short-range entangled states established over the network edges. The end-to-end entanglement of a network path obtained via this process determines the utility of the network path for executing entanglement enabled tasks and for the design of entanglement routing protocols in the quantum network. Here we study the end-to-end entanglement of paths in a quantum network when the edges are characterized by multiparameter quantum states that may be considered to be the output of arbitrary and unknown quantum channels described by the network's edges. We find that over ensembles of multiparameter states with fixed concurrence but varying density matrix elements, the end-to-end entanglement takes a range of values upper bounded by a function of the concurrence of the network-edge states. The scaling behavior of the average end-to-end entanglement reveals that its distribution gets increasingly concentrated around the mean as the paths become longer. For a network path of a given length, the average end-to-end entanglement vanishes for edge concurrence values below a threshold that increases with the path length. Although, for edge concurrence values greater than the threshold the average end-to-end entanglement increases faster with the length of the path. As an implication of our results, we show that the optimal path for entanglement distribution between a pair of end nodes, connected by alternate paths with multiparameter states along the edges, can be indeterminate given only entanglement guarantees along the network edges.
This paper investigates the scalability and transmission efficiency of entanglement swapping protocols within multi-node quantum networks. As the realization of a global quantum internet relies heavily on long-distance entanglement distribution, quantum repeaters utilizing entanglement swapping serve as a critical backbone. However, scalability remains a bottleneck due to photon loss, operational infidelities, and quantum memory coherence times. In this study, we analytically model a multi-node quantum chain and evaluate how the end-to-end entanglement fidelity degrades as the number of intermediate nodes scales up. Our analysis highlights the critical thresholds for Bell state measurement (BSM) success rates required to maintain quantum state integrity across large distances. The findings provide optimization constraints for designing scalable and fault-tolerant routing protocols in future quantum information networks.
Quantum computers face inherent scaling challenges, a fact that necessitates investigation of distributed quantum computing systems, whereby scaling is achieved through interconnection of smaller quantum processing units. However, connecting large numbers of QPUs will eventually result in connectivity constraints at the network level, where the difficulty of entanglement sharing increases with network path lengths. This increases the complexity of the quantum circuit partitioning problem, since the cost of generating entanglement between end nodes varies with network topologies and existing links. We address this challenge using a simple modification to existing partitioning schemes designed for all-to-all connected networks, that efficiently accounts for both of these factors. We investigate the performance in terms of entanglement requirements and optimisation time of various quantum circuits over different network topologies, achieving lower entanglement costs in the majority of cases than state-of-the-art methods. We provide techniques for scaling to large-scale quantum networks employing both network and problem coarsening. We show that coarsened methods can achieve improved solution quality in most cases with significantly lower run-times than direct partitioning methods.