Asynchronous Routing for Multipartite Entanglement in Quantum Networks
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.
Cite
@article{arxiv.2603.27551,
title = {Asynchronous Routing for Multipartite Entanglement in Quantum Networks},
author = {Chenliang Tian and Zebo Yang and Raj Jain and Ramana Kompella and Reza Nejabati and Eneet Kaur and Aiman Erbad and Mounir Hamdi and Mohamed Abdallah},
journal= {arXiv preprint arXiv:2603.27551},
year = {2026}
}
Comments
9 pages, 7 figures, published in the 2026 IEEE 16th Annual Computing and Communication Workshop and Conference (CCWC)