The Phase Quantum Walk: A Unified Framework for Graph State Distribution in Quantum Networks

Abstract: Distributing arbitrary graph states across quantum networks is a central challenge for modular quantum computing and measurement-based quantum communication. I introduce the phase quantum walk (PQW), a discrete-time quantum walk in which the conventional position-permuting shift operator is replaced by a diagonal conditional phase (CZ) gate, enabling distribution of arbitrary graph states, not merely GHZ states, from elementary two-qubit resources. The Byproduct Lemma shows that each walk step teleports edge entanglement with a correctable Pauli byproduct; the Coin Invariance Theorem proves that the optimal fidelity F*(C,E) = F*(H,E) for all unitary coins C and noise channels E, with closed-form expressions F_dep = (1 - 3p/4)^k and F_pd = ((1 + sqrt(1 - p))/2)^k. Analytical correction formulas are derived for tree graphs (general theorem) and ring graphs (C4 case study), with F = 1.0 verified across eight topologies (up to 4096 outcomes). Hardware validation on ibm marrakesh (IBM Heron r2, CZ-native) yields F_cl = 0.924 for |GHZ4> and 0.922 for |L4>, statistically identical, providing the first experimental confirmation that fidelity is independent of graph topology as predicted by the Coin Invariance Theorem.

• The paper presents the Phase Quantum Walk (PQW) protocol, replacing CNOT with a diagonal CZ gate to enable universal graph state distribution.
• It employs local coin operations and measurement-based corrections, achieving high fidelity validated on a 156-qubit IBM Heron system.
• The framework demonstrates coin invariance and noise robustness, offering scalable and practical solutions for quantum network entanglement.

The Phase Quantum Walk as a Framework for Graph State Distribution in Quantum Networks

Motivation and Problem Setting

A central problem in distributed quantum information processing is the faithful distribution of arbitrary graph states across quantum networks. Graph states serve as universal resources for measurement-based quantum computation (MBQC), encode quantum error-correcting codes, and underpin multiparty communication protocols. Existing discrete-time quantum walk (DTQW) entanglement distribution frameworks, which use position-permuting shift operations (e.g., CNOT gates), are fundamentally limited to generating only GHZ/star-type entanglement and cannot realize arbitrary graph state topologies.

The phase quantum walk (PQW) formalism introduced in this work fundamentally modifies the entanglement distribution mechanism by replacing the CNOT shift with a diagonal conditional phase (CZ) gate. This new structure strictly operates with elementary two-qubit resources and only local gates and measurements, rendering it highly compatible with realizable modular and networked quantum architectures.

Structural Properties of the Phase Quantum Walk Model

The PQW is defined by alternating local coin operations (unitary transformations on a “coin” qubit) and a symmetric, diagonal CZ gate acting between data and resource qubits. Unlike DTQW models based on CNOTs, the PQW does not permute the walker’s position; instead, it accumulates non-local $X$-basis correlations, naturally aligned with the stabilizer structure of general graph states.

Key structural properties of the PQW include:

• $Z$-Error Transparency: The coin-phase structure ensures that $Z$-type errors commute through the CZ gates, manifesting only as correctable measurement outcome flips.
• Symmetric Entanglement Propagation: The CZ gate is invariant under qubit exchange, enabling the PQW to generate arbitrary graph topologies rather than being confined to star geometries as in the case of the CNOT.
• $X$-Basis Equivalence: The CZ walk, under local basis changes, is equivalent to a CNOT walk but with $X$-basis stabilizer propagation, not $Z$-basis. This is crucial because graph state stabilizers are fundamentally expressed in the $X$-basis augmented by products of $Z$ operators.
• Graph Topology Via Shift Operator: The PQW shift encodes the edge structure of an arbitrary graph, while the choice of coin operation is shown to be unimportant for the achievable fidelity (Coin Invariance Theorem).

Entanglement Distribution Protocols and Correction Theorems

The protocol for distributing arbitrary graph states under the PQW framework comprises four stages: initialization of data qubits, resource graph state distribution, sequential application of CZ gates with interleaved coin and Hadamard gates, and measurement-based classical byproduct corrections. The core entanglement transfer mechanism is formalized as follows:

• Byproduct Lemma: Each PQW step acts as a teleportation channel for the edge entanglement, introducing a deterministic, measurement-conditioned local Pauli byproduct (always Pauli $X$), which is correctable by local classical post-processing.

For tree graphs, analytical closed-form correction formulas are derived, and the uniformity of entanglement distribution and deterministic output fidelity are rigorously verified by full outcome enumeration (e.g., up to 4096 possible measurement strings).

Explicit Results:

• In the four-qubit linear cluster ($L_4$) protocol, all 64 measurement outcomes produce the exact target graph state after local corrections, with fidelity $Z$0 up to numerical accuracy.
• For cyclic (e.g., $Z$1, $Z$2) and regular graphs (e.g., $Z$3), only $Z$4-type corrections are required, due to parity properties of the walk and network topology.

A hierarchy of correction theorems is established, including a general tree correction formula and a proof by explicit stabilizer tracking for small cycles. The cyclic case remains an open direction for general analytical solution.

Coin Invariance Theorem and Noise Analysis

A central analytical result is the Coin Invariance Theorem, rigorously proving that the optimal graph state distribution fidelity is invariant under any (unitary) choice of coin:

$Z$5

for all unitary coins $Z$6 and local noise channels $Z$7. This result invalidates variational coin parameterizations for optimization, as the fidelity landscape is flat (“barren plateau”) across the unitary coin manifold.

Closed-form analytical fidelity decay formulas are derived for the most relevant physical noise channels:

• For $Z$8 resource states subject to independent depolarizing noise of strength $Z$9:

$Z$0

• For phase damping noise:

$Z$1

The PQW protocol exhibits superior resilience against phase damping, attributable to the $Z$2-error transparency of the CZ walk.

Experimental Validation and Hardware Implications

The PQW protocol was implemented and validated on the 156-qubit IBM Heron platform (ibm_marrakesh), which provides native CZ gates. The key experimental results are:

• Statistically identical fidelities were measured for $Z$3 and $Z$4 states ($Z$5 and $Z$6, respectively), empirically confirming that the achievable distribution fidelity is independent of the graph topology in agreement with the Coin Invariance Theorem.
• Effective noise parameter extraction ($Z$7 per resource qubit) demonstrated that the theoretical depolarizing decay model closely matches the physical noise dominated by $Z$8 amplitude damping. This provides a practical and hardware-agnostic noise fingerprint methodology for cross-platform benchmarking.
• For deeper or highly connected topologies (e.g., $Z$9), fidelity is limited primarily by hardware routing overhead and not by the underlying protocol.

LC-Inequivalence and Theoretical Optimality

The work rigorously proves that the PQW protocol can distribute graph states that are in different local Clifford (LC) equivalence classes from GHZ (star) states—specifically that $X$0 cannot be mapped to $X$1 by any sequence of local Clifford operations. This demonstrates that PQW-based protocols are strictly necessary and not simulatable from prior CNOT-shift-based schemes.

Practical and Theoretical Implications

The PQW framework provides a structurally unified, resource-efficient, and analytically tractable method for arbitrary graph state distribution in quantum networks. Notably:

• Scalability: Resource usage scales linearly with the graph size, with closed-form correction depth proportional to the graph diameter.
• Noise robustness and hardware compatibility: $X$2-error transparency and CZ-gate nativization facilitate efficient implementation on leading superconducting (IBM Heron, Quantum) and potentially all-to-all platforms.
• Versatility: The protocol generalizes to any graph topology, and its correction and noise properties provide a solid basis for practical MBQC and error-correcting code distribution.
• Complementarity: PQW-based entanglement covers the stabilizer class, complementing CTQW frameworks that access distinct SLOCC classes (e.g., $X$3-type states).

Open problems include: a general analytic correction formula for cyclic and arbitrary regular graphs, the extension to non-Clifford (e.g., CP($X$4)) walk variants for magic state distribution, and benchmarking on platforms with full graph connectivity.

Conclusion

The phase quantum walk defines a deterministic, coin-invariant paradigm for graph state distribution over quantum networks using only elementary two-qubit resources and local operations. By fundamental structural design, it subsumes previous walk-based protocols and enables universal stabilizer entanglement distribution, with full analytical characterization of noise and correction structure. Experimental validation confirms both theoretical predictions and practical viability on current hardware, making the PQW a robust protocol for the establishment of large-scale entanglement resources in modular quantum architectures.

Reference: "The Phase Quantum Walk: A Unified Framework for Graph State Distribution in Quantum Networks" (2604.02169)