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
XY 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.
In this work, the dynamics of a quantum walker on glued trees is revisited to understand the influence of the architecture of the graph on the efficiency of the transfer between the two roots. Instead of considering regular binary trees, we focus our attention on leafier structures where each parent node could give rise to a larger number of children. Through extensive numerical simulations, we uncover a significant dependence of the transfer on the underlying graph architecture, particularly influenced by the branching rate (M) relative to the root degree (N). Our study reveals that the behavior of the walker is isomorphic to that of a particle moving on a finite-size chain. This chain exhibits defects that originate in the specific nature of both the roots and the leaves. Therefore, the energy spectrum of the chain showcases rich features, which lead to diverse regimes for the quantum-state transfer. Notably, the formation of quasi-degenerate localized states due to significant disparities between M and N triggers a localization process on the roots. Through analytical development, we demonstrate that these states play a crucial role in facilitating almost perfect quantum beats between the roots, thereby enhancing the transfer efficiency. Our findings offer valuable insights into the mechanisms governing quantum-state transfer on trees, with potential applications for the transfer of quantum information.
We study perfect state transfer on Cayley graphs from the point of view that state transfer is a property of a graph and not of a group. This paper is a bridge between the classical question about isomorphic Cayley graphs of non-isomorphic groups and quantum walks on graphs.
We show that a Cayley graph of a group with an abelian subgroup of index two is a Cayley graph of an abelian group under any one of three hypotheses, two drawn from the theory of isomorphic Cayley graphs. A statement of the same kind holds for extraspecial groups: every Cayley graph of an extraspecial
p-group of order
p2n+1 with a conjugacy-closed connection set is a Cayley graph of
Zp2n+1. From these results we deduce that every explicit construction of perfect state transfer in the six papers we survey, on dihedral, dicyclic, generalized dihedral,
V8n and extraspecial
2-groups, is a non-abelian presentation of an abelian Cayley graph. Moreover, we show that a non-abelian group with an abelian subgroup of index two admits a connected Cayley graph with perfect state transfer if and only if its order is divisible by four.
Genuinely non-abelian examples do exist. We prove that, for every odd prime power
q≥5, the
SL(2,q) graph of Pantangi and Sin, which they showed to admit perfect state transfer, is a Cayley graph of no abelian group; to our knowledge, this is the first infinite family of Cayley graphs with perfect state transfer provably admitting no abelian Cayley presentation. We also construct an infinite family of Cayley graphs with peak state transfer and determine all regular subgroups of the automorphism group of every member.
An appendix records a census of the connected vertex-transitive graphs with perfect state transfer on at most
30 vertices.
We present a method that implements directional, perfect state transfers within a branched spin network by exploiting quantum interferences in the time domain. This method provides a tool for isolating subsystems from a large and complex one. Directionality is achieved by interrupting the spin-spin coupled evolution with periods of free Zeeman evolutions, whose timing is tuned to be commensurate with the relative phases accrued by specific spin pairs. This leads to a resonant transfer between the chosen qubits and to a detuning of all remaining pathways in the network, using only global manipulations. Since the transfer is perfect when the selected pathway is mediated by two or three spins, distant state transfers over complex networks can be achieved by successive recouplings among specific pairs or triads of spins. These effects are illustrated with a quantum simulator involving
13C NMR on leucine's backbone; a six-spin network.