Perfect state transfer on quotient graphs

Abstract

We prove new results on perfect state transfer of quantum walks on quotient graphs. Since a graph $G$ has perfect state transfer if and only if its quotient $G/\pi$, under any equitable partition $\pi$, has perfect state transfer, we exhibit graphs with perfect state transfer between two vertices but which lack automorphism swapping them. This answers a question of Godsil (Discrete Mathematics 312(1):129-147, 2011). We also show that the Cartesian product of quotient graphs ${\square }_k{G}_k/{\pi }_k$ is isomorphic to the quotient graph ${\square }_k{G}_k/\pi$, for some equitable partition $\pi$. This provides an algebraic description of a construction due to Feder (Physical Review Letters 97, 180502, 2006) which is based on many-boson quantum walk.

20 pages, 10 figures

References in corpus (10)

• Universal computation by quantum walk
• Exponential algorithmic speedup by quantum walk
• Perfect Transfer of Arbitrary States in Quantum Spin Networks
• Mirror Inversion of Quantum States in Linear Registers
• Two-particle quantum walks applied to the graph isomorphism problem
• Quantum Networks on Cubelike Graphs
• The Basics of Perfect Communication through Quantum Networks
• Universal quantum computation by discontinuous quantum walk
• Perfect quantum state transfer with spinor bosons on weighted graphs
• k-Boson Quantum Walks Do Not Distinguish Arbitrary Graphs