Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Perfect quantum state transfer on the Johnson scheme (1710.09096v2)

Published 25 Oct 2017 in math.CO

Abstract: For any graph $X$ with the adjacency matrix $A$, the transition matrix of the continuous-time quantum walk at time $t$ is given by the matrix-valued function $\mathcal{H}X(t)=\mathrm{e}{itA}$. We say that there is perfect state transfer in $X$ from the vertex $u$ to the vertex $v$ at time $\tau$ if $|\mathcal{H}_X(\tau){u,v}| = 1$. It is an important problem to determine whether perfect state transfers can happen on a given family of graphs. In this paper we characterize all the graphs in the Johnson scheme which have this property. Indeed, we show that the Kneser graph $K(2k,k)$ is the only class in the scheme which admits perfect state transfers. We also show that, under some conditions, some of the unions of the graphs in the Johnson scheme admit perfect state transfer.

Summary

We haven't generated a summary for this paper yet.