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

TL;DR
The paper introduces the phase quantum walk (PQW), a novel quantum walk framework that enables efficient distribution of arbitrary graph states in quantum networks with universal correction, verified analytically and on hardware.
Contribution
It presents the PQW framework with a universal correction method, allowing distribution of any graph state topology from elementary resources, advancing quantum network state distribution.
Findings
Universal correction theorem enables perfect graph state distribution.
Analytical fidelity models match hardware experimental results.
Validated on IBM hardware with high fidelity for GHZ4 and L4 states.
Abstract
Distributing arbitrary graph states across quantum networks is a central challenge for modular quantum computing and measurement-based quantum communication. We 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. This single structural change enables distribution of arbitrary graph states -- not merely GHZ or star-topology states -- from elementary two-qubit resources shared between adjacent network nodes. The Byproduct Lemma shows that each walk step teleports one edge of entanglement with a correctable Pauli byproduct. A universal correction theorem establishes that a single local Z correction at each node, computed from the XOR of neighboring measurement outcomes, restores the distributed state to the target graph state for any graph topology and any…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
