Quantum
Construction of Partial Join Graphs with Perfect State Transfer in Shunt Decomposition-Based Quantum Walks
Publication: quant-ph updates on arXiv.org
Author: Banita Katuwal, Y Lakshmi Naidu, Srinath M S, Supriyo Dutta
Source published: 28/09/2026, 04:00:00 UTC
Briefing created: 28/09/2026, 04:36:59 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 28/09/2026, 04:13:25 UTC.
Briefings
This paper defines directed partial join graphs with signed couplings and constructs discrete-time quantum-walk transition operators using the shunt-decomposition framework. The study identifies two types of state transfer: internal PST between vertices within the same graph and coupling PST between two components of join graphs. It establishes PST results for double covers of complete graphs with loops, specifically showing that complete graphs K_n do not exhibit PST for n≥4, while suitable partial joins of K_n exhibit PST when n=2^m for m≥2. The work extends the class of graph families admitting PST in shunt-decomposition-based quantum walks and provides a unified framework for studying quantum state transfer in graph joins, products, and covers.
Key points
- The paper defines directed partial join graphs with signed couplings and constructs discrete-time quantum-walk transition operators using the shunt-decomposition framework.
- It identifies two types of state transfer: internal PST between vertices within the same graph and coupling PST between two components of join graphs.
Context and limitations
Results are conditional on one of the two directed regular graphs admitting PST. PST conditions for non-commuting transition operators are established via a double-cover construction. Specific PST examples exist only for n=2^m where m≥2, and general PST conditions for n≥4 remain unverified.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 28/09/2026, 04:36:59 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeic26hkf2fnq42nrk2s6j3vwwnoxcasyjdij5qe2nczafsjh5hm4ya