Beyond Traditional Quantum Routing

TL;DR

This paper introduces a new quantum routing method that bypasses complex pathfinding by directly establishing entanglement between nodes, enhancing quantum network flexibility and efficiency.

Contribution

It proposes a novel quantum routing approach using graph complement strategies to avoid traditional pathfinding overhead.

Findings

Improved quantum network flexibility and efficiency

Reduced computational complexity in routing

Enhanced practicality of quantum communication infrastructures

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.