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

IEEE International Conference on High Performance Switching and Routing (HPSR)

Optimal Multipartite Entanglement Routing Model in Quantum Networks

Yudai Ogata, Imran Ahmed, Eiji Oki

Published Jun 1, 2026• 0 citations
Publisher
DOI
10.1109/hpsr68369.2026.11615194

Related papers

Multipartite Entanglement Routing in Integrated Ground–Satellite Quantum Networks

Xiangxing Guo, Yu Zhang, Lei Fan +4 more

International Conference on Computer Communications and Networks (ICCCN)•Jul 1, 2026•0 citations

Optimized Source Placement for Multipartite State Distribution in Quantum Networks

Zheng Zhang, Qiaolun Zhang, Jiaheng Xiong +3 more

The evolution of quantum networks towards distributed quantum computing and sensing necessitates the efficient distribution of multipartite entangled states among multiple users. However, most existing entanglement routing studies primarily focus on efficient entanglement distribution and typically assume that quantum sources are either fixed or available on all network edges. Due to the scarcity and high cost of quantum sources, some prior studies have focused on optimized source placement strategies, but these existing studies are confined to bipartite state distributions. Consequently, how to jointly optimize quantum source placement and entanglement routing for efficient multipartite state distribution under realistic resource constraints remains an open problem. In this work, we propose an Optimized source Placement and Reactive entanglement Routing (OP-RR) framework to maximize the multipartite state distribution rate given a limited amount of quantum sources. Numerical results on a grid and on the Tokyo topology demonstrate that OP-RR consistently outperforms baseline algorithms with non-optimized source placement, achieving an improvement of up to 16.7× in the multipartite distribution rate, while maintaining robustness under varying operation probabilities and scalability as the size of multipartite states increases.

•Jan 1, 2026•0 citations

Efficient Entanglement Routing for Enhancing Throughput in Quantum Networks

Yaliang Shi, Zhiwei Zhao, Geyong Min +2 more

IEEE Internet of Things Journal•Jan 1, 2026•0 citations

Quantum Routing Beyond Pathfinding: Multipartite Entanglement Complementation

Si-Yi Chen, Angela Sara Cacciapuoti, Marcello Caleffi

Conventional quantum routing operates under the entrenched assumption that pathfinding is a prerequisite for routing. This classical-inspired routing model imposes a restricting design option, which prevents scaling the quantumness to the network functioning. In this paper, we proposed a novel entanglement-driven routing framework that exploits multipartite entanglement complementation for enabling simultaneous 1-hop connectivity among all non-adjacent source-destination pairs. This changes the notion of ``remoteness'' in the entanglement graph, activated by entanglement. We extend this framework to inter-domain quantum networks and design a polynomial-time algorithm. Such an algorithm allows to select and parallelize multiple requests, bypassing NP-complete path discovery. Performance analysis shows the proposed routing strategy achieves up to $60\%$ hop reduction, with the algorithm enabling efficient parallelism and strong scalability in inter-domain quantum networks.

quant-pharXiv:2604.13834•Apr 16, 2026•0 citations

Design Strategy of Entanglement Routing Protocols in Quantum Networks: Overview and Challenges

Pankaj Kumar, Binayak Kar

Lecture notes in networks and systems•Jan 1, 2025•2 citations

Optimized Entanglement Routing for Enhanced Quantum Key Distribution Performance in Quantum Networks

Hongding Zhang, Sheng Huo, Ping Jiang +1 more

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Jan 1, 2026•0 citations
The evolution of quantum networks towards distributed quantum computing and sensing necessitates the efficient distribution of multipartite entangled states among multiple users. However, most existing entanglement routing studies primarily focus on efficient entanglement distribution and typically assume that quantum sources are either fixed or available on all network edges. Due to the scarcity and high cost of quantum sources, some prior studies have focused on optimized source placement strategies, but these existing studies are confined to bipartite state distributions. Consequently, how to jointly optimize quantum source placement and entanglement routing for efficient multipartite state distribution under realistic resource constraints remains an open problem. In this work, we propose an Optimized source Placement and Reactive entanglement Routing (OP-RR) framework to maximize the multipartite state distribution rate given a limited amount of quantum sources. Numerical results on a grid and on the Tokyo topology demonstrate that OP-RR consistently outperforms baseline algorithms with non-optimized source placement, achieving an improvement of up to 16.7× in the multipartite distribution rate, while maintaining robustness under varying operation probabilities and scalability as the size of multipartite states increases.
Conventional quantum routing operates under the entrenched assumption that pathfinding is a prerequisite for routing. This classical-inspired routing model imposes a restricting design option, which prevents scaling the quantumness to the network functioning. In this paper, we proposed a novel entanglement-driven routing framework that exploits multipartite entanglement complementation for enabling simultaneous 1-hop connectivity among all non-adjacent source-destination pairs. This changes the notion of ``remoteness'' in the entanglement graph, activated by entanglement. We extend this framework to inter-domain quantum networks and design a polynomial-time algorithm. Such an algorithm allows to select and parallelize multiple requests, bypassing NP-complete path discovery. Performance analysis shows the proposed routing strategy achieves up to 60%60\%60% hop reduction, with the algorithm enabling efficient parallelism and strong scalability in inter-domain quantum networks.