🤖 AI Summary
To address the low efficiency, poor robustness, and limited scalability of multipartite entanglement distribution in dynamic, high-loss, noise-prone quantum networks, this paper proposes DODAG-X: the first protocol integrating a Destination-Oriented Directed Acyclic Graph (DODAG) topology with an enhanced X protocol to establish a lightweight, cooperative architecture. This design significantly reduces graph verification and path computation overhead while improving noise resilience and topological adaptability. It enables high-fidelity generation of three-party GHZ states over arbitrary network topologies and generalizes to *n*-partite entanglement distribution. Benchmark evaluations on grid and small-world networks demonstrate over 40% reduction in measurement rounds and one-order-of-magnitude lower computational overhead compared to state-of-the-art entanglement routing schemes.
📝 Abstract
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.