Quantum Routing Beyond Pathfinding: Multipartite Entanglement Complementation

• URL: http://arxiv.org/abs/2604.13834v1
• Date: Wed, 15 Apr 2026 13:07:14 GMT
• Title: Quantum Routing Beyond Pathfinding: Multipartite Entanglement Complementation
• Abstract summary: We propose a novel entanglement-driven routing framework for quantum networks.<n>We extend this framework to inter-domain quantum networks and design a time algorithm.<n>Performance analysis shows the proposed routing strategy achieves up to $60%$ hop reduction.
• Score: 5.192590792600339
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Hybrid Classical--Quantum Optimization of Wireless Routing Using QAOA and Quantum Walks [0.0]
  This paper investigates the use of hybrid classical--quantum methods for wireless routing.<n>The potential value of quantum routing lies in the treatment of difficult subproblems rather than end-to-end replacement of classical routing.
  arXiv  Detail & Related papers  (2026-04-01T01:48:57Z)
• 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)
• Beyond Traditional Quantum Routing [5.192590792600339]
  We propose a novel approach to quantum routing, which avoids the inherent overhead of conventional quantum pathfinding.<n>Our approach exploits graph complement strategies to establish directly entanglement between remote nodes.<n>It allows to improve the flexibility and efficiency of quantum networks, by paving the way for more practical quantum communication infrastructures.
  arXiv  Detail & Related papers  (2025-08-25T13:38:13Z)
• Entanglement Routing in Quantum Networks: A Comprehensive Survey [2.624902795082451]
  Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine. We classify and discuss the studied quantum routing schemes into reactive, proactive, opportunistic, and virtual routing.
  arXiv  Detail & Related papers  (2024-08-02T12:48:40Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• 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)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
  Entanglement routing establishes remote entanglement connection between two arbitrary nodes. We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
  arXiv  Detail & Related papers  (2021-11-15T14:07:22Z)
• 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)
• Effective routing design for remote entanglement generation on quantum networks [6.695045642641268]
  Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network's capabilities. We propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations. Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification.
  arXiv  Detail & Related papers  (2020-01-07T18:16:55Z)

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.