Impact of Topology on Multipartite Entanglement Distribution Protocols in Quantum Networks
- URL: http://arxiv.org/abs/2603.25920v1
- Date: Thu, 26 Mar 2026 21:21:18 GMT
- Title: Impact of Topology on Multipartite Entanglement Distribution Protocols in Quantum Networks
- Abstract summary: Quantum networks will rely on entanglement distribution to enable multi-user applications such as distributed quantum computing and cryptography.<n>We present a systematic study of four routing protocols for entanglement distribution over 81 real network topologies.<n>We identify four distinct topology-dependent performance regimes, where: (i) all protocols perform poorly, (ii) tree-based protocols dominate, (iii) multi-path protocols dominate, or (iv) all protocols perform well.
- Score: 41.99844472131922
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum networks will rely on entanglement distribution to enable multi-user applications such as distributed quantum computing and cryptography. While multipartite entanglement distribution routing protocols have been extensively studied on idealised grid topologies, less is understood about how real network structure shapes their performance and resource requirements. We present a systematic study of four routing protocols for multipartite entanglement distribution, each characterised by the number of paths (single-path and multi-path) and routing strategy (star-based and tree-based), over 81 real network topologies. We identified four distinct topology-dependent performance regimes, where: (i) all protocols perform poorly, (ii) tree-based protocols dominate, (iii) multi-path protocols dominate, or (iv) all protocols perform well. By correlating clusters with graph metrics, we also provide structural explanations for the varied performance of specific protocols. Additionally, motivated by the anticipated high cost of repeaters, we investigated the impact of repeater trimming on the performance of multi-path protocols. Topology strongly governs how far repeater nodes can be removed from the network while maintaining a given performance (distribution rate). For instance, in networks where only 80% of nodes operate as repeaters, well-performing topologies are able to retain over 90% of the distribution rate; whereas sparse, weakly connected graphs exhibit rapid performance degradation, retaining less than half of the distribution rate. Our results provide a topology-aware framework for protocol selection and infrastructure optimisation in future quantum networks, bridging routing design with cost-aware deployment strategies.
Related papers
- Hyperbolic Graph Embedders for Link Prediction and Topology Reconstruction [1.903182139095754]
We benchmark 13 unsupervised hyperbolic graph embedders under a unified protocol for link prediction and topology reconstruction.<n>The protocol captures both missing-link recovery and the preservation of local and global network structure.<n>Performance is more strongly associated with embedding paradigm than with disciplinary origin.
arXiv Detail & Related papers (2026-08-07T09:42:26Z) - A Technical Taxonomy of LLM Agent Communication Protocols [60.76747983053368]
This study develops a technical taxonomy to classify and analyze large language models (LLMs) agent communication protocols.<n>The framework guides protocol selection and highlights open research gaps such as privacy and policy enforcement.
arXiv Detail & Related papers (2026-06-17T14:45:20Z) - Space-time Peer-to-Peer Distribution of Multi-party Entanglement for Any Quantum Network [2.2110030760685957]
We propose a novel quantum network protocol to efficiently implement the general graph state distribution in the network layer.<n>An explicit mathematical model for a general graph state distribution problem has been constructed.<n>We leverage the spacetime quantum network inspired by the symmetry from relativity for memory management in network problems.
arXiv Detail & Related papers (2024-12-19T11:37:32Z) - Multi-User Entanglement Distribution in Quantum Networks Using Multipath
Routing [55.2480439325792]
We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing.
The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
arXiv Detail & Related papers (2023-03-06T18:06:00Z) - Multiparty Entanglement Routing in Quantum Networks [0.0]
A protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in quantum networks.
The protocol only requires local measurements at the network nodes and just a single qubit memory per user.
arXiv Detail & Related papers (2022-11-12T15:40:34Z) - A scheme for multipartite entanglement distribution via separable
carriers [68.8204255655161]
We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes.
We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network.
arXiv Detail & Related papers (2022-06-20T10:50:45Z) - Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users.
We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
arXiv Detail & Related papers (2020-11-23T19:00:01Z) - Fitting the Search Space of Weight-sharing NAS with Graph Convolutional
Networks [100.14670789581811]
We train a graph convolutional network to fit the performance of sampled sub-networks.
With this strategy, we achieve a higher rank correlation coefficient in the selected set of candidates.
arXiv Detail & Related papers (2020-04-17T19:12:39Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.