Perfect state transfer from vertex to a distinct vertex
of a graph
occurs at time
when
|
(1)
|
where
is the adjacency matrix for an undirected
graph, or the Hermitian adjacency matrix
for a mixed graph. Equivalently, the evolution maps
the coordinate vector at
to a scalar of absolute
value 1 times the coordinate vector at
. This is a spectral condition on the matrix
exponential (Song and Lin 2026).
For the two-vertex complete graph, , and
|
(2)
|
Thus perfect state transfer occurs at . In an undirected
graph, the transition matrix is symmetric, so transfer from
to
implies transfer from
to
at the same time. For a mixed graph
this same-time symmetry can fail (Song and Lin 2026).
For an unweighted simple connected graph that is unicyclic with the adjacency
matrix as Hamiltonian, Song (2026, Theorems 1.1-1.2) gives a structural and polynomial
characterization. The transfer vertices must be the opposite degree-two vertices
of a cycle graph
of length four. Only
carry attached rooted trees
.
Write
for the characteristic polynomial of
a graph
with adjacency matrix
, with
. Set
and
for
, and define
|
(3)
|
|
(4)
|
where the greatest common divisor is monic. Transfer occurs iff either , giving
, or
|
(5)
|
for a finite set of positive odd integers containing
1 and having at least two elements. Outside
, the transfer pair is unique,
the minimum transfer time is
, and the sharp vertex
count lower bound is 46. For
, the minimum time is
.