An Infinite Family of Circulant Graphs with Perfect State Transfer in Discrete Quantum Walks
arXiv:1707.06703
Abstract
We study perfect state transfer in Kendon's model of discrete quantum walks. In particular, we give a characterization of perfect state transfer purely in terms of the graph spectra, and construct an infinite family of -regular circulant graphs that admit perfect state transfer. Prior to our work, the only known infinite families of examples were variants of cycles and diamond chains.
References in corpus (11)
- Quantum Communication Through an Unmodulated Spin Chain
- Perfect state transfer in quantum spin networks
- Universal computation by quantum walk
- Perfect Transfer of Arbitrary States in Quantum Spin Networks
- Perfect State Transfer: Beyond Nearest-Neighbor Couplings
- Quantum walks on general graphs
- Discrete Time Quantum Walk Approach to State Transfer
- Perfect state transfer on distance-regular graphs and association schemes
- Universal quantum computation by discontinuous quantum walk
- Strongly Cospectral Vertices
- Periodicity of Grover walks on distance-regular graphs