Pretty good state transfer on Cayley graphs over semi-dihedral groups

Author(s):  
Dandan Wang ◽  
Xiwang Cao
2020 ◽  
Vol 343 (1) ◽  
pp. 111636
Author(s):  
Xiwang Cao ◽  
Dandan Wang ◽  
Keqin Feng

10.37236/9184 ◽  
2020 ◽  
Vol 27 (2) ◽  
Author(s):  
Xiwang Cao ◽  
Bocong Chen ◽  
San Ling

Recently,  perfect state transfer (PST for short) on graphs has attracted great attention due to their applications in quantum information processing and quantum computations. Many constructions and results have been established through various graphs. However, most of the graphs previously investigated are abelian Cayley graphs. Necessary and sufficient conditions for Cayley graphs over dihedral groups having perfect state transfer were studied recently. The key idea in that paper is the assumption of the normality of the connection set. In those cases, viewed as an element in a group algebra, the connection set is in the center of the group algebra, which makes the situations just like in the abelian case. In this paper, we study the non-normal case. In this case, the discussion becomes more complicated. Using the representations of the dihedral group $D_n$,  we show that ${\rm Cay}(D_n,S)$ cannot have PST if $n$ is odd. For even integers $n$, it is proved that if ${\rm Cay}(D_n,S)$ has PST, then $S$ is normal.


Author(s):  
Gaojun Luo ◽  
Xiwang Cao ◽  
Guangkui Xu ◽  
Yingjie Cheng

2019 ◽  
Vol 563 ◽  
pp. 331-352 ◽  
Author(s):  
Ying-Ying Tan ◽  
Keqin Feng ◽  
Xiwang Cao

10.37236/6388 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Hiranmoy Pal ◽  
Bikash Bhattacharjya

Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$ relative to $A$ is defined by $H(t):=\exp{\left(-itA\right)}$, where $t\in {\mathbb R}$. The graph $G$ is said to admit pretty good state transfer between a pair of vertices $u$ and $v$ if there exists a sequence of real numbers $\{t_k\}$ and a complex number $\gamma$ of unit modulus such that $\lim\limits_{k\rightarrow\infty} H(t_k) e_u=\gamma e_v.$ We find that the cycle $C_n$ as well as its complement $\overline{C}_n$ admit pretty good state transfer if and only if $n$ is a power of two, and it occurs between every pair of antipodal vertices. In addition, we look for pretty good state transfer in more general circulant graphs. We prove that union (edge disjoint) of an integral circulant graph with a cycle, each on $2^k$ $(k\geq 3)$ vertices, admits pretty good state transfer. The complement of such union also admits pretty good state transfer. Using Cartesian products, we find some non-circulant graphs admitting pretty good state transfer.


2021 ◽  
Vol 391 ◽  
pp. 125651
Author(s):  
Yiqin He ◽  
Bicheng Zhang ◽  
Rongquan Feng

2017 ◽  
Vol 67 (1) ◽  
pp. 39-50
Author(s):  
Issaraporn Thongsomnuk ◽  
Yotsanan Meemark

Sign in / Sign up

Export Citation Format

Share Document