.png){kind=icon}
.png){kind=icon}
Return
Grover algorithm and absolute zeta functions
.png){kind=icon}
PRE
AI
DOI：10.1142/S0219749926500061.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 F-1 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.
Keywords:
Grover algorithm
absolute zeta function
quantum algorithm
Journal
IF:
0.8
Papers:
54
Citations:
1.3K