Quantum Walks Reveal Hidden Graph Symmetries

A new mathematical framework for continuous quantum walks reveals fundamental properties of quantum state transfer across graph structures. This research demonstrates that perfect pair state transfer—the complete transfer of quantum information between pairs of vertices—can be preserved under specific graph transformations, offering insights for quantum communication systems.

The study establishes that transitivity, a phenomenon where state transfer relationships extend across multiple vertices, provides greater flexibility in quantum information routing. By proving that perfect pair state transfer remains intact under certain graph operations, the work reveals structural symmetries that enable reliable quantum communication pathways.

Methodologically, the research employs graph Laplacians as Hamiltonians to model continuous quantum walks. This approach treats the mathematical structure of graphs as quantum systems, where vertices represent quantum states and edges define interaction pathways. The analysis focuses on how different Hamiltonian choices—including adjacency matrices, Laplacians, and unsigned Laplacians—affect the occurrence of perfect state transfer pairs across various graph types.

Key findings show that perfect vertex state transfer does not occur between two vertices when using the Laplacian Hamiltonian, suggesting fundamental limitations in certain graph configurations. The research identifies that (0,10) represents the only periodic pair in the studied graph, indicating highly specific conditions for recurrent quantum state patterns. Analysis suggests that different Hamiltonian choices and initial states significantly impact state transfer efficiency, with certain configurations producing more perfect state transfer pairs than others.

The work connects to quantum communication applications, where reliable information transfer across quantum networks depends on understanding these fundamental transfer properties. By examining how graph structure influences quantum walk behavior, the research provides mathematical foundations for designing efficient quantum communication channels.

Limitations include the inability to prove the absence of perfect pair state transfer on trees, leaving this as an open question. The study also acknowledges that understanding how different Hamiltonians and initial states affect state transfer requires further investigation, particularly for graph classes beyond bipartite graphs and odd cycles where Hamiltonian choices may not influence perfect state transfer pairs.

References: Bose, S. Quantum communication through an unmodulated spin chain. Physical Review Letters 91, 207901 (2003). Chen, Q. Edge State Transfer. Master's Thesis (2018). Available at http://hdl.handle.net/10012/14346. Childs, A. M. Universal computation by quantum walk. Physical Review Letters 102, 180501 (2009). Childs, A. M. et al. Exponential algorithmic speedup by quantum walk. Proc. 35th ACM Symposium on Theory of Computing 59-68 (2003). Available at arXiv:0209131. Childs, A. M., Gosset, D. & Webb, Z. Universal computation by multiparticle quantum walk. Science 339, 791-794 (2013). Christandl, M. et al. Perfect state transfer in quantum spin networks. Physical Review Letters (2004). Available at arXiv:0309131v2. Coutinho, G. Quantum State Transfer in Graphs. Ph.D. Thesis (2014). Coutinho, G. & Godsil, C. Graph Spectra and Continuous Quantum Walks. In preparation. Coutinho, G. & Liu, H. No Laplacian perfect state transfer in trees. SIAM Journal on Discrete Mathematics 29, 2179-2188 (2015). Available at arXiv:1408.2935. Farhi, E. & Gutmann, S. Quantum computation and decision trees. Physical Review A 58, 915-928 (1998). Available at arXiv:9706062. Godsil, C. State transfer on graphs. Discrete Mathematics 312, 129-147 (2012). Available at arXiv:1102.4898.