Controlling quantum state transfer in rooted products

RESUMO

Godsil and McKay (1978) showed that the rooted product is a powerful tool for constructing non-isomorphic cospectral pairs of graphs. Despite lacking a convenient tensor product structure, we show that the rooted product is useful for constructing graphs with good quantum state transfer properties. In particular, we prove a simple transference principle: if a graph $X$ has quantum state transfer and $Y$ is a controllable graph, their rooted product $X^Y$ has quantum state transfer (inherited from $X$). This complements a folklore property of Cartesian product which preserves perfect state transfer. However, the rooted product is a significantly sparser graph and, more importantly, can be easily used to construct efficient high-fidelity state transfer even if $X$ has no quantum state transfer. Our proof exploits the fact that a rooted product creates a large number of strongly cospectral pairs of vertices and that its condition number can be controlled by its pendant subgraph.