Efficient Entanglement Routing in Quantum Networks

Quantum networks comprise the foundation for distributed quantum computing, relying on long-range entanglement to establish secure communication and perform reliable information processing. Entangling nodes in a quantum network is accomplished via a technique known as entanglement routing, which faces a unique set of challenges originating from noise and decoherence. We introduce a new entanglement routing scheme, known as DODAG-X, that utilizes an embedded tree structure to preserve network connectivity over time, and improves efficiency while entangling parties. Our protocol eliminates the need for numerous hardware checks and additional path-finding calculations, significantly reducing the measurements required to achieve multipartite entanglement. While we focus on three-party entanglement, DODAG-X can be implemented for n-party entanglement routing in various network topologies. The protocol's optimized resource usage and improved scalability make DODAG-X ideal for robust communication in larger networks. We also discuss extensions of DODAG-X for distributing additional quantum properties, such as quantum magic, paving the way for advanced quantum communication architectures.