发表机构
National Institute of Technology Agartala（阿加塔拉国家技术学院）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文提出基于边复制符号图上的coined Szegedy量子游走的确定性拓扑量子路由架构，通过边符号实现零反向散射，在哑铃开关和粘合二叉树上实现单位保真度的完美态传输，并分析了噪声信道下的性能。
AI 中文摘要
在分布式通信网络中路由未知量子信息，需要自主、无测量的机制以防止波函数坍缩。Szegedy量子游走提供了一种空间态传输机制。在无权图上的传统游走存在严重的反向反射、空间色散和信道串扰问题。本文提出了一种基于边复制符号图上的coined Szegedy量子游走的确定性拓扑量子路由架构。通过将边符号视为平衡硬币反射中的局域相位偏移，我们在路由节点上实现了精确的零反向散射条件。我们证明了在基本原型（包括符号哑铃开关$D_{2m,0,2n}$和可扩展的粘合二叉树）上，在精确到达时间实现单位保真度的确定性完美态传输（PST）。此外，我们分析了在现实开放系统振幅和相位阻尼噪声信道下的路由性能。
英文摘要
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.
CommentsComments are welcome! This version of the manuscript was prepared in a hurry to meet a deadline
