Paper detail

Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems

A fully connected vertex $w$ in a simple graph $G$ of order $N$ is a vertex connected to all the other $N-1$ vertices. Upon denoting by $L$ the Laplacian matrix of the graph, we prove that the continuous-time quantum walk (CTQW) -- with Hamiltonian $H=γL$ -- of a walker initially localized at $\vert w \rangle$ does not depend on the graph $G$. We also prove that for any Grover-like CTQW -- with Hamiltonian $H=γL +\sum_w λ_w \vert w \rangle\langle w \vert$ -- the probability amplitude at the fully connected marked vertices $w$ does not depend on $G$. The result does not hold for CTQW with Hamiltonian $H=γA$ (adjacency matrix). We apply our results to spatial search and quantum transport for single and multiple fully connected marked vertices, proving that CTQWs on any graph $G$ inherit the properties already known for the complete graph of the same order, including the optimality of the spatial search. Our results provide a unified framework for several partial results already reported in literature for fully connected vertices, such as the equivalence of CTQW and of spatial search for the central vertex of the star and wheel graph, and any vertex of the complete graph.