Asynchronous Routing for Multipartite Entanglement in Quantum Networks

• URL: http://arxiv.org/abs/2603.27551v1
• Date: Sun, 29 Mar 2026 07:06:31 GMT
• Title: Asynchronous Routing for Multipartite Entanglement in Quantum Networks
• Abstract summary: In quantum networks, one way to communicate is to distribute entanglements through swapping at intermediate nodes.<n>This article extends this approach to multipartite entanglements, particularly the three-party Greenberger-Horne-Zeilinger (GHZ) states.<n>It shows that our asynchronous protocol outperforms traditional synchronous methods in entanglement rates, especially as coherence times increase.
• Score: 11.815937275904467
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In quantum networks, one way to communicate is to distribute entanglements through swapping at intermediate nodes. Most existing work primarily aims to create efficient two-party end-to-end entanglement over long distances. However, some scenarios also require remote multipartite entanglement for applications such as quantum secret sharing and multi-party computation. Our previous study improved end-to-end entanglement rates using an asynchronous, tree-based routing scheme that relies solely on local knowledge of entanglement links, conserving unused entanglement and avoiding synchronous operations. This article extends this approach to multipartite entanglements, particularly the three-party Greenberger-Horne-Zeilinger (GHZ) states. It shows that our asynchronous protocol outperforms traditional synchronous methods in entanglement rates, especially as coherence times increase. This approach can also be extended to four-party and larger multipartite GHZ states, highlighting the effectiveness and adaptability of asynchronous routing for multipartite scenarios across various network topologies.

Related papers

• HOPPER: A Hop-by-hop Entanglement Distribution Protocol for Asynchronous Quantum Networks [0.0]
  The quantum Internet relies on the ability to distribute entangled quantum bits (ebits) between quantum memories at the end nodes.<n>This need creates new challenges due to the fragile nature of entanglement, which decoheres over short timescales.<n>In this paper, we study the implications of multiplexing concurrent ebit requests on the same quantum, for both synchronous and asynchronous operation.
  arXiv  Detail & Related papers  (2026-05-15T11:36:01Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• Multi-tree Quantum Routing in Realistic Topologies [0.19972837513980318]
  We present a multi-tree approach with multiple DODAGs designed to improve end-to-end entanglement rates in large-scale networks. Our simulations show a marked improvement in end-to-end entanglement rates for specific topologies compared to the single-tree method.
  arXiv  Detail & Related papers  (2024-08-12T14:58:02Z)
• Repeater-like asynchronous measurement-device-independent quantum conference key agreement [14.261895897404726]
  Quantum conference key agreement enables secure communication among multiple parties by leveraging multipartite entanglement.<n>We propose a measurement-device-independent quantum conference key agreement protocol that employs asynchronous Greenberger-Horne-Zeilinger state measurement.<n>Our method provides insights for various quantum tasks beyond quantum communication, including multiparty computing and quantum repeaters.
  arXiv  Detail & Related papers  (2024-06-22T13:57:21Z)
• Analysis of Asynchronous Protocols for Entanglement Distribution in Quantum Networks [9.971549076128268]
  We explore two minimal asynchronous protocols for entanglement in quantum networks. A parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation.
  arXiv  Detail & Related papers  (2024-05-03T18:04:11Z)
• SOFTS: Efficient Multivariate Time Series Forecasting with Series-Core Fusion [59.96233305733875]
  Time series forecasting plays a crucial role in various fields such as finance, traffic management, energy, and healthcare. Several methods utilize mechanisms like attention or mixer to address this by capturing channel correlations. This paper presents an efficient-based model, the Series-cOre Fused Time Series forecaster (SOFTS)
  arXiv  Detail & Related papers  (2024-04-22T14:06:35Z)
• Asynchronous Entanglement Routing for the Quantum Internet [0.42855555838080833]
  We propose a new set of asynchronous routing protocols for quantum networks. The protocols update the entanglement-link asynchronous topologyly, 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.
  arXiv  Detail & Related papers  (2023-12-21T21:14:21Z)
• 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)
• 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)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• 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)

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.