DODAG-X Protocol: Quantum Entanglement Routing

• DODAG-X protocol is a multipartite entanglement distribution scheme that uses a precomputed breadth-first spanning tree to efficiently generate GHZ states.
• It leverages a minimal eccentricity node to form an optimized DODAG structure, reducing classical and quantum overhead in path scheduling.
• The protocol achieves up to 35% fewer measurements, enhancing entanglement fidelity under realistic noise, loss, and network dynamics.

The DODAG-X protocol is a multipartite entanglement distribution scheme for quantum networks that combines the Destination Oriented Directed Acyclic Graph (DODAG) structure from classical networking with a variant of the X-protocol for graph-state entanglement routing. By precomputing a breadth-first spanning tree rooted at a node of minimal eccentricity, DODAG-X enables efficient, robust, and scalable entanglement generation under realistic noise, loss, and network dynamics. The protocol significantly reduces the quantum and classical overhead for generating Greenberger–Horne–Zeilinger (GHZ) states and can be extended to generic $n$-party entangled states (Negrin et al., 2024).

1. Network Model and Assumptions

DODAG-X operates on a quantum network whose physical topology is represented as an undirected graph $G_{\rm phys}=(V,E_{\rm phys})$, with nodes $v\in V$ denoting qubit-nodes (quantum processors or repeaters), and edges $e=(u,v)\in E_{\rm phys}$ as quantum channels (optical fiber, free-space link). The protocol establishes a virtual topology as a graph state $G_{\rm virt}=(V,E_{\rm virt})$, where each edge corresponds to an EPR-pair link created by controlled-Z ($CZ$) operations between qubits: $$\left|G_{\rm virt}\right\rangle = \bigotimes_{(u,v)\in E_{\rm virt}} CZ_{u,v}\ \left|+\right\rangle^{\otimes |V|}\,.$$ The protocol accounts for time-varying physical link failures, with nodes having up-to-date knowledge of their incident edges but not the global state, to avoid decoherence-inducing delays. Noise and fidelity models specify:

• Baseline gate and memory fidelity $F_0$ for each CZ and qubit,
• Decoherence acting independently with characteristic time $T_2$,
• Per-attempt link-loss probability $p_{\rm loss}$ and depolarizing qubit errors.

The fidelity of the generated entanglement after $M$ two-qubit operations and storage time $\tau$ is bounded by

$$F_{\min} \geq F_0^M\, e^{-\tau/T_2}\,(1-p_{\rm loss})\,,$$

highlighting the need to minimize both the number of measurements and the storage time.

2. DODAG Construction and Structural Properties

DODAG-X begins with root selection, choosing a vertex $r\in V$ of minimum eccentricity

$$\mathrm{Ecc}(G_{\rm phys}, r) = \max_{u\in V} d(r,u)\,,$$

minimizing worst-case communication depth. A breadth-first spanning tree $\mathcal{T} = (V,E_D)$ is constructed with directed edges $E_D = \{(v \to \mathrm{parent}(v)) \mid v \neq r\}$ oriented toward the root. Level assignments $\mathrm{level}(v)$ correspond to shortest-path distance to $r$ in $\mathcal{T}$. Construction requires only a global BFS, with all subsequent entanglement routing via tree walks—obviating further path-finding or verification.

The structural overhead depends on the physical topology:

• On a grid $m\times\ell$ ($n = m\ell$), tree depth is $$\min\{\tfrac{m}{2},\tfrac{\ell}{2}\} \in [\mathcal{O}(\sqrt n),\mathcal{O}(n)]$$.
• For Watts–Strogatz small-world networks ($n$ nodes, mean degree $k$, rewiring $p$), expected depth is $\mathcal{O}(\log n)$.

3. The DODAG-X Protocol: Mechanics and Implementation

DODAG-X prescribes a scheduling of Pauli-X (and Z) measurements to convert the virtual tree state into a multipartite GHZ state among a chosen party set. For three parties $\{i,j,k\}$, the protocol proceeds as:

1. For each $p \in \{i,j,k\}$, compute the unique path $P_{p \to r}$ in $\mathcal{T}$; locate intersections $a_{u,v}$ as the first common node of $P_{u \to r} \cap P_{v \to r}$.
2. For each party $p$, determine set $A_p = \{ a_{p,q} \mid q \in \{i,j,k\}, q \neq p \}$, select nearest $a_p \in A_p$; along path $\bar{P}_{p \to a_p}$ (excluding endpoints), apply $X[v]$ with $p$ as pivot via local-complementation.
3. For each distinct intersection $a\notin \{i,j,k\}\cup\{r\}$, traverse $P_{a \to r}$ and alternately apply $X[v_\ell]$ with the predecessor as pivot.
4. If $r \notin \{i,j,k\}$, apply $X[r]$ using any $p$ as pivot.
5. For each $p$, remove all non-party neighbors via $Z[v]$.

This sequence yields a $\mathrm{GHZ}_3$ state on $\{i,j,k\}$. Each $X[v]$ refers to a Pauli-X measurement (see Eq.~2.12 (Negrin et al., 2024)) implementing a local-complementation. Entanglement swapping and purification can be interleaved at repeater nodes by replacing logical X-measurements with Bell swaps and purification rounds.

4. Resource Optimization, Noise, and Fidelity

For three-party entanglement, total measurements $M$ are partitioned into “path” and “isolation” types: $M = \left|P_{i \to r}\cup P_{j \to r}\cup P_{k \to r}\right|-3 + \left|{\bigcup_{v\in P_{i \to r}\cup P_{j \to r}\cup P_{k \to r}}N_v\right|} - \left|P_{i \to r}\cup P_{j \to r}\cup P_{k \to r}\right|\,,$ matching the count of the X-protocol on trees (Theorem 3.1, 3.2, A.3 (Negrin et al., 2024)). Since each Pauli measurement or local Clifford introduces infidelity, minimizing $M$ optimizes $F_{\rm final}$, with

$F_{\rm final} \geq F_0^M(1-p_{\rm loss})\,.$

A plausible implication is that DODAG-X's minimized measurement schedule directly improves practical achievable fidelities.

5. Computational Complexity and Classical Overhead

Classic X-protocols require on-demand shortest-path searches (Dijkstra/BFS) for each entangling event, incurring $\mathcal{O}(|E|\log|V|)$ or $\mathcal{O}(|V|+|E|)$ complexity, which is prohibitive for large, dynamic, or densely connected quantum internets. DODAG-X amortizes this cost by a single BFS to build $\mathcal{T}$, with all subsequent routing and scheduling operations requiring only tree-walks of depth proportional to the shortest path to the root.

• Grid topology: each party-to-root path is $\mathcal{O}(\sqrt n)$–$\mathcal{O}(n)$.
• Small-world topology: each path is $\mathcal{O}(\log n)$.

Theorems 3.1 and 3.2 establish (a) connectivity to intersections after Step 2 and (b) isolation of the multipartite entangled parties in the final state. Theorem A.3 establishes equivalence in measurement counts on trees versus X-protocol.

6. Quantitative Benchmarks and Empirical Results

Performance evaluation on two classes of topologies yields:

Grid Lattices ($m=\ell$)

$\begin{array}{c|ccc} m=\ell & 5\times5 & 7\times7 & 9\times9 \ \hline \overline M_p & 14.3 & 17.9 & 21.5 \ \overline M_v & 12.6 & 15.1 & 18.2 \ \Delta\% & 11.9\% & 15.6\% & 15.3\% \ \end{array}$

DODAG-X achieves up to $17.9\%$ measurement reduction compared to the X-protocol, with only the $3\times 3$ grid incurring a minor $2.6\%$ penalty.

Small-World Networks ($n=30$, $k\in [2,24]$, $p\in [0,1]$)

DODAG-X saves $20\!-25\%$ measurements on average, up to $35\%$ in highly clustered/high-rewired regimes. Weakly clustered/rewired instances experience a $\sim10\%$ increase in measurement counts.

These reductions directly translate into higher achievable fidelities and lower quantum resource consumption.

7. Multiparty Entanglement Extension and Generality

For three parties, DODAG-X produces a $$\left|\mathrm{GHZ}_3\right\rangle=(|000\rangle+|111\rangle)/\sqrt 2$$. The resulting graph after X-measurements is a triangle (3-star with central vertex removed). For $n>3$,

• If all parties are on distinct branches of $\mathcal{T}$, a single-shot protocol applies (disjoint party-root paths except at $r$).
• Otherwise, a multi-layer DODAG-X approach is used: group parties in threes, apply DODAG-X layerwise, then fuse roots using linear-cluster fusion techniques (as described by Fan et al. 2024).

Each measurement conjugates the underlying stabilizer group, with the final configuration realizing the stabilizer of a $\mathrm{GHZ}_n$ state.

8. Comparative and Contextual Analysis

Relative to prior graph-state routing methods, DODAG-X provides:

• Efficiency: Eliminates repeated $\mathcal{O}(|E|)$ path searches, replacing them with one $\mathcal{O}(|V|+|E|)$ BFS and $\mathcal{O}(\mathrm{depth})$ tree-walks per entanglement event.
• Scalability: Path lengths scale as $\mathcal{O}(\sqrt n)$ (grids) or $\mathcal{O}(\log n)$ (small-world) versus worst-case $\mathcal{O}(n)$.
• Reliability: DODAG is maintained by classical control messages akin to RPL, enabling virtual entanglement overlay persistence under link churn, without additional quantum communication to update routing status.
• Resource Savings: Up to $35\%$ fewer measurements in realistic topologies, which proportionally lowers exposed quantum operations and raises achievable quantum state fidelities.
• Flexibility: Universality for GHZ$_3$ generation in arbitrary topologies; naturally extends to larger GHZ$_n$ and magic-state routing within the graph-state formalism.

The marriage of the DODAG and X-protocol paradigms in DODAG-X establishes an efficient and noise-robust foundation for multi-user quantum communication in NISQ and early quantum-internet environments (Negrin et al., 2024).