Regular graphs to induce even periodic Grover walks
Sho Kubota, Hiroto Sekido, and Kiyoto Yoshino

TL;DR
This paper characterizes regular graphs that induce even-periodic Grover walks, revealing that most such graphs are cycle graphs when the period is twice an odd integer, using Galois theory for the proof.
Contribution
It extends the characterization of graphs inducing periodic Grover walks to even periods, especially for regular graphs with periods of the form 2l where l is odd.
Findings
Most regular graphs inducing 2l-periodic Grover walks are cycle graphs.
The proof employs Galois theory to establish the characterization.
Provides insight into the structure of graphs related to quantum walk periodicity.
Abstract
The interest of this paper is a characterization of graphs that induce periodic Grover walks with given periods. In previous studies, Yoshie has shown that the only graphs that induce odd periodic Grover walks are cycle graphs. However, this problem is largely unsolved for even periods. In this study, we show that regular graphs that induce -periodic Grover walks are also cycle graphs in most cases, where is an odd integer. The proof uses Galois theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Combinatorial Mathematics · semigroups and automata theory
