Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise
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 D2m,0,2n and scalable glued binary trees. Furthermore, we analyse routing performance under realistic open-system amplitude and phase damping noise channels.
Related
- Perfect and peak state transfer on IBM quantum hardware
- Construction of Partial Join Graphs with Perfect State Transfer in Shunt Decomposition-Based Quantum Walks
- Perfect state transfer on mixed graphs: complete classes and transfer times
- Perfect state transfer on Cayley graphs over dihedral groups: A complete and practical characterization
- Spectral width and polynomial degree in perfect state transfer
BibTeX
@misc{sanfui2026quantum,
title = {{Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise}},
author = {Nur Mohammad Sanfui and Supriyo Dutta},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.39890},
eprint = {2609.39890},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39890},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise
AU - Nur Mohammad Sanfui
AU - Supriyo Dutta
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.39890
UR - https://arxiv.org/abs/2609.39890
AB - 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.
ER -