arXiv:2609.18018
Perfect state transfer under matrix powers: parity and spectral arithmetic
Xingkun Song
Abstract
For a real symmetric matrix $H$ and distinct vertices $a,b$, we classify exponents $k$ for which $H^k$ has perfect state transfer (PST) from $a$ to $b$. If their supported eigenvalues are integer multiples of a common positive number, every odd exponent reduces to $H$ and every positive even exponent reduces to $H^2$. We determine the minimum transfer times using a greatest common divisor of supported spectral differences. For rational symmetric matrices, symmetry of the source vertex support about zero implies the odd-power equivalence without a commensurability assumption; this includes all bipartite graphs. If the source vertex supports zero, PST under one positive even power implies PST under every positive even power. For a symmetric three-point quadratic spectrum whose outer projection signs agree and differ from the central sign, a nonzero rational shift leaves exactly one PST exponent. We classify all adjacency powers of hypercubes, cycles, and Johnson graphs, and all adjacency squares of paths. In particular, the adjacency matrix of $P_7$ has PST from vertex $2$ to vertex $6$ only at exponent $2$.
AI Summary
The paper asks which positive integers $k$ make $H^k$ exhibit perfect state transfer (PST) between fixed vertices of a real symmetric matrix $H$. The central result is a parity reduction: if the supported eigenvalues lie in $c\mathbb Z$ for some $c>0$, every odd exponent succeeds exactly when $H$ does, and every even exponent succeeds exactly when $H^2$ does. Thus the exponent set is empty, all odd integers, all positive even integers, or all positive integers. When transfer occurs, its minimum time is $\pi/(c^k\delta_k)$, where $\delta_k$ is the gcd of the normalized supported spectral differences. The proofs separate spectral collisions from phase arithmetic. Odd powers preserve spectral projectors; even powers merge opposite eigenvalues and require compatible strong-cospectrality signs. Gcd phase criteria and $2$-adic valuations then establish parity invariance. Galois descent gives additional results for rational matrices: support symmetric about zero implies odd-power equivalence, covering bipartite graphs; support containing zero implies that success for one even exponent entails success for every even exponent. Applications classify all adjacency powers of hypercubes, cycles, and Johnson graphs, and adjacency squares of paths. Beyond $C_4$, only $C_8$ transfers among cycles, at even exponents. Path squares transfer only for $(P_3;1,3)$, $(P_5;2,4)$, and $(P_7;2,6)$. The last pair has exponent set exactly $\{2\}$, demonstrating failure without commensurability. General realizable exponent sets remain unclassified, as do higher even powers between reflected even-indexed vertices on odd paths of order at least nine.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 24 pages, 0 figures