Regular graphs to induce even periodic Grover walks
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 2 l -periodic Grover walks are also cycle graphs in most cases, where l is an odd integer. The proof uses Galois theory.
Authors
- Kiyoto Yoshino (ORCID: https://orcid.org/0000-0002-8206-6219)
- Hiroto Sekido (ORCID: https://orcid.org/0000-0002-4607-6305)
- S. Kubota
Institutions
- Hiroshima Institute of Technology (JP)
- Yokohama National University (JP)
- Osaka Institute of Technology (JP)
Publication Details
- Journal
- Discrete Mathematics
- Published
- 2024-11-29
- DOI
- https://doi.org/10.1016/j.disc.2024.114345
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Japan Society for the Promotion of Science