Quantum walks on blow-up graphs

Bikash Bhattacharjya, Hermie Monterde, Hiranmoy Pal

A blow-up of $n$ copies of a graph $G$ is the graph $\stackrel{n}{\uplus }G$ obtained by replacing every vertex of $G$ by an independent set of size $n$, where the copies of vertices…