Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 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 state transfer on Cayley graphs over a non-abelian group of order $8n$ (2405.02122v2)

Published 3 May 2024 in quant-ph and math.CO

Abstract: The \textit{transition matrix} of a graph $\Gamma$ with adjacency matrix $A$ is defined by $H(\tau ) := \exp(-\mathbf{i}\tau A)$, where $\tau \in \mathbb{R}$ and $\mathbf{i} = \sqrt{-1}$. The graph $\Gamma$ exhibits \textit{perfect state transfer} (PST) between the vertices $u$ and $v$ if there exists $\tau_0(>0)\in \mathbb{R}$ such that $\lvert H(\tau_0){uv} \rvert = 1$. For a positive integer $n$, the group $V{8n}$ is defined as $V_{8n} := \langle a,b \colon a{2n} = b{4} = 1, ba = a{-1}b{-1}, b{-1}a = a{-1}b \rangle$. In this paper, we study the existence of perfect state transfer on Cayley graphs $\text{Cay}(V_{8n}, S)$. We present some necessary and sufficient conditions for the existence of perfect state transfer on $\text{Cay}(V_{8n}, S)$.

Summary

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