TOPICS
Search

Perfect State Transfer


Perfect state transfer from vertex u to a distinct vertex v of a graph occurs at time t>0 when

 |(exp(-itH))_(vu)|=1,
(1)

where H 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 u to a scalar of absolute value 1 times the coordinate vector at v. This is a spectral condition on the matrix exponential (Song and Lin 2026).

For the two-vertex complete graph, H^2=I, and

 exp(-itH)=Icost-iHsint.
(2)

Thus perfect state transfer occurs at t=pi/2. In an undirected graph, the transition matrix is symmetric, so transfer from u to v implies transfer from v to u 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 a,b must be the opposite degree-two vertices of a cycle graph a,c,b,d,a of length four. Only c,d carry attached rooted trees T_c,T_d.

Write phi_H(t)=det(tI-A_H) for the characteristic polynomial of a graph H with adjacency matrix A_H, with phi_⌀=1. Set P_i=phi_(T_i) and Q_i=phi_(T_i-i) for i=c,d, and define

 F(t)=tP_c(t)P_d(t)-2[Q_c(t)P_d(t)+P_c(t)Q_d(t)],
(3)
 M(t)=(F(t))/(gcd(F(t),P_c(t)P_d(t))),
(4)

where the greatest common divisor is monic. Transfer occurs iff either M(t)=t^2-4, giving C_4, or

 M(t)=product_(q in S)(t^2-2q^2)
(5)

for a finite set S of positive odd integers containing 1 and having at least two elements. Outside C_4, the transfer pair is unique, the minimum transfer time is pi/sqrt(2), and the sharp vertex count lower bound is 46. For C_4, the minimum time is pi/2.


See also

Adjacency Matrix, Hermitian Adjacency Matrix, Matrix Exponential, Mixed Graph, Quantum Walk

Explore with Wolfram|Alpha

References

Song, X. "Perfect State Transfer on Unicyclic Graphs." 30 Oct 2026. https://arxiv.org/abs/2610.41572v1.Song, X. and Lin, H. "State Transfer on Mixed Graphs." Elec. J. Combin. 33, P3.60, 2026. https://doi.org/10.37236/14214.

Cite this as:

Weisstein, Eric W. "Perfect State Transfer." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/PerfectStateTransfer.html

Subject classifications