8,328 research outputs found
Perfect State Transfer in Laplacian Quantum Walk
For a graph and a related symmetric matrix , the continuous-time
quantum walk on relative to is defined as the unitary matrix , where varies over the reals. Perfect state transfer occurs
between vertices and at time if the -entry of
has unit magnitude. This paper studies quantum walks relative to graph
Laplacians. Some main observations include the following closure properties for
perfect state transfer:
(1) If a -vertex graph has perfect state transfer at time relative
to the Laplacian, then so does its complement if is an integer multiple
of . As a corollary, the double cone over any -vertex graph has
perfect state transfer relative to the Laplacian if and only if . This was previously known for a double cone over a clique (S. Bose,
A. Casaccino, S. Mancini, S. Severini, Int. J. Quant. Inf., 7:11, 2009).
(2) If a graph has perfect state transfer at time relative to the
normalized Laplacian, then so does the weak product if for any
normalized Laplacian eigenvalues of and of , we have
is an integer multiple of . As a corollary, a weak
product of with an even clique or an odd cube has perfect state
transfer relative to the normalized Laplacian. It was known earlier that a weak
product of a circulant with odd integer eigenvalues and an even cube or a
Cartesian power of has perfect state transfer relative to the adjacency
matrix.
As for negative results, no path with four vertices or more has antipodal
perfect state transfer relative to the normalized Laplacian. This almost
matches the state of affairs under the adjacency matrix (C. Godsil, Discrete
Math., 312:1, 2011).Comment: 26 pages, 5 figures, 1 tabl
Perfect state transfer, graph products and equitable partitions
We describe new constructions of graphs which exhibit perfect state transfer
on continuous-time quantum walks. Our constructions are based on variants of
the double cones [BCMS09,ANOPRT10,ANOPRT09] and the Cartesian graph products
(which includes the n-cube) [CDDEKL05]. Some of our results include: (1) If
is a graph with perfect state transfer at time , where t_{G}\Spec(G)
\subseteq \ZZ\pi, and is a circulant with odd eigenvalues, their weak
product has perfect state transfer. Also, if is a regular
graph with perfect state transfer at time and is a graph where
t_{H}|V_{H}|\Spec(G) \subseteq 2\ZZ\pi, their lexicographic product
has perfect state transfer. (2) The double cone on any
connected graph , has perfect state transfer if the weights of the cone
edges are proportional to the Perron eigenvector of . This generalizes
results for double cone on regular graphs studied in
[BCMS09,ANOPRT10,ANOPRT09]. (3) For an infinite family \GG of regular graphs,
there is a circulant connection so the graph K_{1}+\GG\circ\GG+K_{1} has
perfect state transfer. In contrast, no perfect state transfer exists if a
complete bipartite connection is used (even in the presence of weights)
[ANOPRT09]. We also describe a generalization of the path collapsing argument
[CCDFGS03,CDDEKL05], which reduces questions about perfect state transfer to
simpler (weighted) multigraphs, for graphs with equitable distance partitions.Comment: 18 pages, 6 figure
- …