Walk/zeta correspondence (Q2110188)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Walk/zeta correspondence |
scientific article |
Statements
Walk/zeta correspondence (English)
0 references
21 December 2022
0 references
Previously, the authors studied a relation between the Grover walk and the zeta function based on the Konno-Sato theorem and called this relation ``Grover/Zeta correspondence'' [``A note on the Grover walk and the generalized Ihara zeta function of the one-dimensional integer lattice'', Yokohama Math. J. (to appear)]. More precisely, they presented explicit formulas for the generalized zeta function and the generalized Ihara zeta function corresponding to the Grover walk with F-type and the positive-support version of the Grover walk with F-type on the vertex-transitive regular graph by the Konno-Sato theorem, respectively. The Grover walk is one of the most well investigated quantum walks (QWs) inspired by the famous Grover algorithm. The QW is a quantum counterpart of the correlated random walk (CRW) which has the random walk (RW) as a special model. In fact, the CRW is the RW with memory. In this paper, the authors extend the Grover walk with F-type and the positive-support version of the Grover walk with F-type to a class of walks with both F- and M-types by using not the Konno-Sato theorem but a method of the Fourier transform for the case of the \(d\)-dimensional torus. This class contains QWs and CRWs. Moreover, they treat the open quantum random walk which has the CRW as a special model. They explain a method of the Fourier transform for the walk, introduce the walk-type zeta function, present the main results, consider walks on the one-dimensional torus and give important models, and proceed with two-dimensional and highly-dimensional models.
0 references
zeta function
0 references
quantum walk
0 references
correlated random walk
0 references
random walk
0 references
open quantum random walk
0 references
torus
0 references
Fourier transform
0 references
0 references
0 references