analiza aiqbench
This research extends the theoretical boundaries of quantum walks by establishing perfect state transfer conditions for complex graph structures like partial joins and double covers using shunt decomposition. By deriving necessary and sufficient conditions for periodicity in directed regular graphs, the study provides a unified mathematical framework that could inform the design of more robust quantum communication networks. These findings represent a significant step forward in understanding how specific graph topologies enable reliable state transfer without requiring commutative transition operators.
Construction of Partial Join Graphs with Perfect State Transfer in Shunt Decomposition-Based Quantum Walks
arXiv:2609.30490v1 Announce Type: new Abstract: In this paper, we define directed partial join graphs with signed couplings and construct discrete-time quantum-walk transition operators for these graphs using the shunt-decomposition framework. The resulting transition operators apply to several important graph families, including complete graphs with loops, circulant partial joins, complete bipartite graphs, tensor powers of complete bipartite graphs, all with signed couplings. For each family, we identify the corresponding structure of the transition operator and derive necessary and sufficient conditions for periodicity and perfect state transfer (PST), when one of the two directed regular graphs admits PST. Based on these results, we identify two types of state transfer; internal PST, which occurs between vertices within the same graph, and coupling PST, which occurs between two components of join graphs. We further develop a double-cover construction for directed partial join graphs and derive conditions for periodicity and PST when the associated transition operators do not necessarily commute. Using this construction, we establish PST results for double covers of complete graphs with loops. In particular, we provide an example in which the complete graph \(K_n\) does not exhibit PST for \(n\geq4\), whereas a suitable partial join of \(K_n\) exhibits PST when \(n=2^m\), \(m\geq2\). Hence, these results extend the class of graph families admitting PST in shunt-decomposition-based quantum walks and provide a unified framework for studying quantum state transfer in graph joins, products, and covers.
Abstract:In this paper, we define directed partial join graphs with signed couplings and construct discrete-time quantum-walk transition operators for these graphs using the shunt-decomposition framework. The resulting transition operators apply to several important graph families, including complete graphs with loops, circulant partial joins, complete bipartite graphs, tensor powers of complete bipartite graphs, all with signed couplings. For each family, we identify the corresponding structure of the transition operator and derive necessary and sufficient conditions for periodicity and perfect state transfer (PST), when one of the two directed regular graphs admits PST. Based on these results, we identify two types of state transfer; internal PST, which occurs between vertices within the same graph, and coupling PST, which occurs between two components of join graphs. We further develop a double-cover construction for directed partial join graphs and derive conditions for periodicity and PST when the associated transition operators do not necessarily commute. Using this construction, we establish PST results for double covers of complete graphs with loops. In particular, we provide an example in which the complete graph \(K_n\) does not exhibit PST for \(n\geq4\), whereas a suitable partial join of \(K_n\) exhibits PST when \(n=2^m\), \(m\geq2\). Hence, these results extend the class of graph families admitting PST in shunt-decomposition-based quantum walks and provide a unified framework for studying quantum state transfer in graph joins, products, and covers.
Quantum Physics (quant-ph); Combinatorics (math.CO)
arXiv:2609.30490 [quant-ph]
(or arXiv:2609.30490v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.30490 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 322 cuvinte
Subiecte conexe

NEAREST BY Join: Scaling Vector Search in Databricks Runtime
Databricks · 5 oct. 2026

Game Design Creativity evals
LessWrong · 12 oct. 2026
Perfect state transfer and Cayley presentations
arXiv · 24 aug. 2026

On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality
Quantum Journal · 3 aug. 2026