Year: 2025
Type: conference-paper
Abstract: Existing quantum routing implicitly mimics classical routing principles, with finding the “best” path (aka pathfinding, according to a selected routing metric, as a core mechanism for establishing end-to-end entanglement. However, optimal pathfinding is computationally intensive, particularly in complex topologies. In this paper, we propose a novel approach to quantum routing, which avoids the inherent overhead of conventional quantum pathfinding, by establishing directly entanglement between remote nodes. Our approach exploits graph complement strategies. It allows to improve the flexibility and efficiency of quantum networks, by paving the way for more practical quantum communication infrastructures.
Institution: University of Naples Federico II
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4416875355