2000 character limit reached
An Infinite Family of Circulant Graphs with Perfect State Transfer in Discrete Quantum Walks
Published 20 Jul 2017 in math.CO and quant-ph | (1707.06703v3)
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 $4$-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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.