An Infinite Family of Circulant Graphs with Perfect State Transfer in Discrete Quantum Walks
Author:
Preprint
Abstract
We study perfect state transfer in a discrete quantum walk. In particular, we show that there are infinitely many $4$-regular circulant graphs that admit perfect state transfer between antipodal vertices. To the best of our knowledge, previously there was no infinite family of $k$-regular graphs with perfect state transfer, for any $k\ge 3$.
Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphsQuantum Information Processing, 2017
- Perfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphsPhysical Review A, 2016
- Perfect state transfer on distance-regular graphs and association schemesLinear Algebra and its Applications, 2015
- Perfect state transfer in products and covers of graphsLinear and Multilinear Algebra, 2015
- Basics of perfect communication through quantum networksPhysical Review A, 2011
- Discrete-time quantum walk approach to state transferPhysical Review A, 2011
- Universal quantum computation by discontinuous quantum walkPhysical Review A, 2010
- Universal Computation by Quantum WalkPhysical Review Letters, 2009
- Perfect state transfer: Beyond nearest-neighbor couplingsPhysical Review A, 2006
- Perfect transfer of arbitrary states in quantum spin networksPhysical Review A, 2005