Localization of the Grover walks on spidernets and free Meixner laws (Q358807): Difference between revisions

A spidernet is a graph obtained by adding large cycles to an almost regular tree and considered as an example having intermediate properties of lattices and trees in the study of discrete-time quantum walks on graphs. The authors introduce the Grover walk on a spidernet and its one-dimensional reduction. They derive an integral representation of the n-step transition amplitude in terms of the free Meixner law which appears as the spectral distribution. As an application, they determine the class of spidernets which exhibit localization. their method is based on quantum probabilistic spectral analysis of graphs. This is an interesting work. It deserves to be read.