A Characterization of the Graphs to Induce Periodic Grover Walk
classification
🪐 quant-ph
keywords
graphsgroverwalkinduceperiodiccharacterizationcharacterizecondition
read the original abstract
This paper explains the periodicity of the Grover walk on finite graphs. We characterize the graphs to induce 2, 3, 4, 5-periodic Grover walk and obtain a necessary condition of the graphs to induce an odd-periodic Grover walk.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.