Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2302.10074 · Quantum Information Processing

Quantum routing in planar graph using perfect state transfer

Supriyo Dutta

Published Oct 18, 2023• 7 citations
arXivHTMLPDF
DOI
10.1007/s11128-023-04120-z

Related papers

Quantum walk on graphs and perfect state transfer

Rachel Elizabeth Bachman, Christino Tamon

•Aug 4, 2011•0 citations

Perfect state transfer on several types of graphs based on the quantum probability perspective

Qi Han, Rong Zhang, Shijiao Xing +2 more

The European Physical Journal Plus•Jun 17, 2025•3 citations

Quantum Simulation of Perfect State Transfer on Weighted Cubelike Graphs

Jaideep Mulherkar, Rishikant Rajdeepak, V. Sunitha

arXiv:2111.00226•Springer proceedings in mathematics & statistics•Jan 1, 2022•1 citation

Quantum Planar Graphs and Its Application

Rupkumar Mahapatra, Tofigh Allahviranloo, Smita A. Desai +2 more

Studies in computational intelligence•Jan 1, 2025•2 citations

Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise

Nur Mohammad Sanfui, Supriyo Dutta

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.

quant-pharXiv:2609.39890•Oct 1, 2026•0 citations

Quantum Random Walks

Swarnadeep Majumder, Austen Couvertier

The focus of this project is continuous time quantum walks (QW) on finite graphs. QW are important because they offer one route to universal quantum computation. We studied Perfect State Transfer in a variety of regular graphs, some of which have not been studied earlier. Our work has led to a method of achieving PST between any two nodes of d-dimensional hypercube graph.

•Apr 27, 2018•1 citation
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,2nD_{2m,0,2n}D2m,0,2n​ and scalable glued binary trees. Furthermore, we analyse routing performance under realistic open-system amplitude and phase damping noise channels.