Continuous-time quantum walks (CTQWs) on graphs were introduced to search decision trees [1]} and have numerous applications including modeling coherent transport on complex networks [2]} and spatial searches [3]}. Furthermore, they are universal for computation [4]}. In a CTQW on a graph \(G = (V,E)\) , a walker moves between vertices of \(G\)  according to the Schrödinger equation
\(i \frac{d{\left| \psi  \right\rangle }}{dt} = H {\left| \psi  \right\rangle },\) 
