Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2501.13393 · International Journal of Quantum Information

Grover algorithm and absolute zeta functions

Jirô Akahori, Kazuki Horita, Norio Konno, Rikuki Okamoto, Iwao Sato, Yuma Tamura

Published Jan 24, 2026• 0 citations
arXivHTMLPDF

Abstract

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 [Formula: see text] 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.

DOI
10.1142/s0219749926500061

Related papers

Periodicity and absolute zeta functions of multi-state grover walks on cycles

Jirô Akahori, Norio Konno, Iwao Sato +1 more

Quantum walks, the quantum counterpart of classical random walks, are extensively studied for their applications in mathematics, quantum physics, and quantum information science. This study explores the periods and absolute zeta functions of Grover walks on cycle graphs. Specifically, we investigate Grover walks with an odd number of states and determine their periods for cycles with any number of vertices greater than or equal to two. In addition, we compute the absolute zeta functions of M-type Grover walks with finite periods. These results advance the understanding of the properties of Grover walks and their connection to absolute zeta functions.

arXiv:2501.18600•International Journal of Quantum Information•Mar 1, 2025•1 citation

Absolute Zeta functions and periodicity of quantum walks on cycles

Jirô Akahori, Norio Konno, Iwao Sato +1 more

The quantum walk is a quantum counterpart of the classical random walk. On the other hand, absolute zeta functions can be considered as zeta functions over $\mathbf{F}_1$. This study presents a connection between quantum walks and absolute zeta functions. In this paper, we focus on Hadamard walks and $3$-state Grover walks on cycle graphs. The Hadamard walks and the Grover walks are typical models of the quantum walks. We consider the periods and zeta functions of such quantum walks. Moreover, we derive the explicit forms of the absolute zeta functions of corresponding zeta functions. Also, it is shown that our zeta functions of quantum walks are absolute automorphic forms.

arXiv:2405.05995•Quantum Information and Computation•Oct 1, 2024•0 citations

The absolute zeta function with respect to a bipartite walk on a bipartite graph

Jirô Akahori, Norio Konno, Iwao Sato +2 more

Abstract We consider the zeta function associated with the time evolution matrix of a bipartite walk on a bipartite graph and derive a formula for its absolute zeta function. Furthermore, we give formulas for the absolute zeta functions of the zeta functions of the time evolution matrices of bipartite walks on the complete bipartite graph and an even cycle graph. As an application, we obtain formulas for the absolute zeta functions of the zeta functions of the Grover matrices of the complete bipartite graph and an even cycle graph.

Quantum Studies Mathematics and Foundations•Mar 4, 2026•0 citations

Zeta Functions with Respect to General Coined Quantum Walk of Periodic Graphs

Takashi Komatsu, Norio Konno, Iwao Sato

We define a zeta function of a graph by using the time evolution matrix of a general coined quantum walk on it, and give a determinant expression for the zeta function of a finite graph. Furthermore, we present a determinant expression for the zeta function of an (inifinite) periodic graph.

arXiv:1910.12782•The Electronic Journal of Combinatorics•Jul 9, 2020•1 citation

Grover’s Algorithm – Implementations and Implications

Chenxi Guo

Ever since the realisation of the potential computational power of quantum-natured circuits, multiple quantum algorithms have been proposed, exploiting quantum superposition or quantum entanglement features to simulate quantum systems that classical computers cannot efficiently probe. The most notable among these strategies is Shor’s algorithm, which takes advantage of the quantum Fourier transform and has been shown capable of solving integer factorisation problems within polynomial time. This article’s focus is on one type of quantum algorithm based on amplitude amplification, namely Grover’s algorithm. This algorithm’s working principle is explained, and a discussion of its recent developments and possible direction of future reach is provided. In addition, implementations of Grover’s algorithm have been performed using the IBM Quantum Lab, followed by a reference to its connection to life sciences.

Highlights in Science Engineering and Technology•Mar 16, 2023•12 citations

Quadratically Fast Searching in Quantum Computation

Mohit Joshi, Manoj Kumar Mishra, S. Karthikeyan

Grover’s search algorithm is one of the most famous quantum algorithms, which enables search in unstructured dataspaces with a quadratic speedup over any known classical algorithm. This is one of the first algorithms to show quantum advantage over classical methods of computation. Besides its most anticipated application of brute force attack on symmetric key encryptions like AES, it is today being used in many modern applications as a subroutine. In this chapter, we describe the mathematical model of Grover’s quantum search algorithm, its behavior, and the theory of its circuit implementation. This chapter also discusses an exact variant of this algorithm and recent applications of Grover’s quantum search.

CRC Press eBooks•Mar 24, 2026•0 citations
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 [Formula: see text] 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.
Quantum walks, the quantum counterpart of classical random walks, are extensively studied for their applications in mathematics, quantum physics, and quantum information science. This study explores the periods and absolute zeta functions of Grover walks on cycle graphs. Specifically, we investigate Grover walks with an odd number of states and determine their periods for cycles with any number of vertices greater than or equal to two. In addition, we compute the absolute zeta functions of M-type Grover walks with finite periods. These results advance the understanding of the properties of Grover walks and their connection to absolute zeta functions.
The quantum walk is a quantum counterpart of the classical random walk. On the other hand, absolute zeta functions can be considered as zeta functions over F1\mathbf{F}_1F1​. This study presents a connection between quantum walks and absolute zeta functions. In this paper, we focus on Hadamard walks and 333-state Grover walks on cycle graphs. The Hadamard walks and the Grover walks are typical models of the quantum walks. We consider the periods and zeta functions of such quantum walks. Moreover, we derive the explicit forms of the absolute zeta functions of corresponding zeta functions. Also, it is shown that our zeta functions of quantum walks are absolute automorphic forms.
Abstract We consider the zeta function associated with the time evolution matrix of a bipartite walk on a bipartite graph and derive a formula for its absolute zeta function. Furthermore, we give formulas for the absolute zeta functions of the zeta functions of the time evolution matrices of bipartite walks on the complete bipartite graph and an even cycle graph. As an application, we obtain formulas for the absolute zeta functions of the zeta functions of the Grover matrices of the complete bipartite graph and an even cycle graph.
Ever since the realisation of the potential computational power of quantum-natured circuits, multiple quantum algorithms have been proposed, exploiting quantum superposition or quantum entanglement features to simulate quantum systems that classical computers cannot efficiently probe. The most notable among these strategies is Shor’s algorithm, which takes advantage of the quantum Fourier transform and has been shown capable of solving integer factorisation problems within polynomial time. This article’s focus is on one type of quantum algorithm based on amplitude amplification, namely Grover’s algorithm. This algorithm’s working principle is explained, and a discussion of its recent developments and possible direction of future reach is provided. In addition, implementations of Grover’s algorithm have been performed using the IBM Quantum Lab, followed by a reference to its connection to life sciences.
Grover’s search algorithm is one of the most famous quantum algorithms, which enables search in unstructured dataspaces with a quadratic speedup over any known classical algorithm. This is one of the first algorithms to show quantum advantage over classical methods of computation. Besides its most anticipated application of brute force attack on symmetric key encryptions like AES, it is today being used in many modern applications as a subroutine. In this chapter, we describe the mathematical model of Grover’s quantum search algorithm, its behavior, and the theory of its circuit implementation. This chapter also discusses an exact variant of this algorithm and recent applications of Grover’s quantum search.