Quantum Routing Beyond Pathfinding: Multipartite Entanglement Complementation

TL;DR

This paper introduces a novel entanglement-driven quantum routing framework that enables simultaneous connectivity without traditional pathfinding, significantly improving scalability and reducing hops in quantum networks.

Contribution

It proposes a new multipartite entanglement complementation approach for quantum routing, bypassing NP-complete path discovery and enabling efficient parallel requests in inter-domain networks.

Findings

Achieves up to 60% hop reduction in routing.

Enables parallel request handling in polynomial time.

Demonstrates strong scalability in inter-domain quantum networks.

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.