Computer Science – Discrete Mathematics
Scientific paper
2011-04-11
Computer Science
Discrete Mathematics
Scientific paper
In this paper we answer the question of when circulant quantum spin networks with nearest-neighbor couplings can give perfect state transfer. The network is described by a circulant graph $G$, which is characterized by its circulant adjacency matrix $A$. Formally, we say that there exists a {\it perfect state transfer} (PST) between vertices $a,b\in V(G)$ if $|F(\tau)_{ab}|=1$, for some positive real number $\tau$, where $F(t)=\exp(\i At)$. Saxena, Severini and Shparlinski ({\it International Journal of Quantum Information} 5 (2007), 417--430) proved that $|F(\tau)_{aa}|=1$ for some $a\in V(G)$ and $\tau\in \R^+$ if and only if all eigenvalues of $G$ are integer (that is, the graph is integral). The integral circulant graph $\ICG_n (D)$ has the vertex set $Z_n = \{0, 1, 2, ..., n - 1\}$ and vertices $a$ and $b$ are adjacent if $\gcd(a-b,n)\in D$, where $D \subseteq \{d : d \mid n,\ 1\leq d
No associations
LandOfFree
Characterization of circulant graphs having perfect state transfer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Characterization of circulant graphs having perfect state transfer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterization of circulant graphs having perfect state transfer will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-57988