Efficient Multiparty Entanglement Distribution with DODAG-X Protocol

TL;DR

The paper introduces DODAG-X, a scalable protocol for efficient multipartite entanglement distribution in quantum networks, reducing computational overhead and measurement requirements while improving robustness and scalability.

Contribution

It presents a novel DODAG-X protocol that optimizes resource use and robustness in quantum entanglement distribution, with significant reductions in measurement and computation compared to existing methods.

Findings

Significant measurement reduction in benchmarks

Successful generation of three-party entanglement in arbitrary networks

Potential for scaling to n-party entanglement

Abstract

In this work we introduce the DODAG-X protocol for multipartite entanglement distribution in quantum networks. Leveraging the power of Destination Oriented Directed Acyclic Graphs (DODAGs), our protocol optimizes resource consumption and enhances robustness to noise in dynamic and lossy networks. Implementing a variation on the X-protocol within the DODAG, we minimize graph verification and path-finding calculations, significantly reducing computational overhead when compared to other entanglement routing schemes. Additionally, our benchmarks on grid lattice and small-world topologies reveal substantial measurement reduction compared to existing protocols. We demonstrate the success of DODAG-X for generating maximal three-party entanglement in arbitrary networks, and describe the potential for scaling to generic $n$-party entanglement. The DODAG-X protocol provides a scalable and efficient solution for entanglement routing, advancing current techniques for reliable quantum communication and network applications.