Grover algorithm and absolute zeta functions

The Grover algorithm is one of the most famous quantum algorithms. On the other hand, the absolute zeta function can be regarded as a zeta function over F1 defined by a function satisfying the absolute automorphy. In this study, we show the property of the Grover algorithm and present a relation between the Grover algorithm and the absolute zeta function. We focus on the period of the Grover algorithm because if the period is finite, then we are able to get an absolute zeta function explicitly by Kurokawa’s theorem. In addition, whenever the period is finite or not, an expansion of the absolute zeta function can be obtained by a direct computation.