2000 character limit reached
Pretty good state transfer between internal nodes of paths
Published 29 Nov 2016 in quant-ph and math.CO | (1611.09836v1)
Abstract: We study a continous-time quantum walk on a path graph. In this paper, we show that, for any odd prime $p$ and positive integer $t$, the path on $2t p - 1$ vertices admits pretty good state transfer between vertices $a$ and $n+1-a$ for each $a$ that is a multiple of $2{t-1}$ with respect to the quantum walk model determined by the XY-Hamiltonian. This gives the first examples of pretty good state transfer occurring between internal vertices on a path, when it does not occur between the extremal vertices.
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.