arXiv:2609.39890
Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise
Nur Mohammad Sanfui, Supriyo Dutta
Abstract
Routing unknown quantum information across distributed communication networks requires autonomous, measurement-free mechanisms to prevent wave-function collapse. Szegedy quantum walks provide a mechanism for spatial state transport. The conventional walks on unweighted graphs suffer from severe back-reflection, spatial dispersion, and channel crosstalk. In this paper, we introduce a deterministic topological quantum routing architecture based on coined Szegedy quantum walks on edge-duplicated signed graphs. By treating edge signs as localized phase shifts within a balanced coin reflection, we enforce an exact zero back-scattering condition across routing nodes. We demonstrate deterministic Perfect State Transfer (PST) with unit fidelity at exact arrival times across fundamental archetypes, including the signed dumbbell switch $D_{2m,0,2n}$ and scalable glued binary trees. Furthermore, we analyse routing performance under realistic open-system amplitude and phase damping noise channels.
AI Summary
The paper studies measurement-free quantum-state transport using coined Szegedy walks on signed graphs, focusing on perfect state transfer (PST) and degradation under loss and dephasing. Each undirected edge is replaced by two opposite arcs; edge signs determine how a coin parameter $\alpha$ allocates transition probability between positive and negative outgoing edges. The local reflection coefficient is $2p(e)-1$, so an arc with $p(e)=1/2$ has zero back-reflection. Using $\alpha=1/2$, the paper gives an explicit propagation calculation establishing PST between antipodal terminals of two even cycles joined by a negative bridge, $D_{2m,0,2n}$, at $\tau=m+1+n$. Changing the bridge sign is proposed as a forwarding/delay switch. For two rooted trees joined by identifying corresponding leaves, alternating signs between levels are claimed to produce root-to-root PST; numerical examples for binary trees give arrival time $\tau=2d$. Link-failure examples retain PST after additional edges are removed to restore the matched glued-tree structure. Noise is applied after each walk step. Uniform photon loss yields target overlap $F(\tau)=(1-\lambda)^\tau$. A two-path dephasing argument gives $F(\tau)=[1+(1-p)^\tau]/2$. Comparing these expressions with $2/3$ gives small-noise hop horizons approximately $0.4055/\lambda$ and $1.0986/p$, respectively—about 20 and 55 hops at noise probability $0.02$. The constructions assume balanced coins, synchronized paths, and specified sign patterns. The routing examples have one source and one receiver; the fault-recovery procedure requires structural pruning. No photonic implementation is reported.
Central claim may not hold: The defined walk changes coin weights when an edge sign changes, so its signed-dumbbell PST result does not establish the claimed phase-only routing implementation. Zero back-scattering holds for selected coherent input combinations rather than individual branching channels, and the claimed uniform probability p=1/2 at binary junctions is incorrect. The positive-bridge dumbbell configuration transmits probability 8/9 into the bridge on the symmetric packet’s first encounter, contradicting its advertised storage mode. The phase-damping fidelity formula fails under complete stepwise dephasing, giving a predicted destination overlap of 1/2 where direct propagation gives 1/4, and the associated 2/3 quantum-advantage benchmark is not justified for the reported spatial overlap. The unsigned-dumbbell argument excludes PST only at the stated earliest arrival time, not at all times as its conclusion asserts.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- Comments are welcome! This version of the manuscript was prepared in a hurry to meet a deadline