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, Y. 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

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

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

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•13 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

Practical Guide to Quantum Computing: Grover's Algorithm # 4

Mikhail Pavlov

Abstract This guide is based on the IBM Quantum course Phase Estimation and Factoring and focuses on Grover’s algorithm, a quantum algorithm for unstructured search problems that provides a quadratic speedup over classical approaches. In an unstructured search problem, we are given a function (often represented as an oracle) that marks one or more “correct” solutions among NNN possible candidates. A classical algorithm requires on the order of O(N)O(N)O(N) evaluations in the worst case. In contrast, Grover’s algorithm finds a solution using only O(N)O(\sqrt{N})O(N) oracle queries. This quadratic improvement implies: The quantum algorithm requires roughly the square root of the number of operations needed classically. Any classical algorithm for unstructured search must have cost at least quadratic relative to Grover’s quantum procedure. Core Idea of the Algorithm Grover’s algorithm relies on: Preparation of a uniform superposition (typically using Hadamard gates). An oracle that marks valid solutions via phase inversion. The Grover diffusion operator, which amplifies the probability amplitude of the marked states through interference. By repeatedly applying the Grover operator, the amplitude of the desired solution grows while others diminish, allowing measurement to reveal the correct answer with high probability. Practical Considerations Despite its theoretical elegance and wide applicability, the quadratic speedup of Grover’s algorithm is unlikely to yield near-term practical advantage. Modern classical hardware operates at extremely high clock rates and is vastly more mature than current quantum devices. For problem sizes accessible to today’s quantum computers, classical systems remain dominant. However, history shows that even sub-quadratic classical improvements — such as: Fast Fourier Transform (FFT) Efficient sorting algorithms like quicksort and mergesort have had transformative practical impact. The crucial distinction is that Grover’s algorithm depends on fundamentally different hardware — quantum processors — which are still in early development. Long-Term Perspective As quantum hardware advances in qubit count, coherence time, and error correction, Grover’s quadratic advantage may become practically significant for: Cryptographic key search Optimization heuristics Combinatorial search problems Amplitude amplification subroutines in broader quantum algorithms Through hands-on experimentation on IBM Q, this lesson demonstrates how theoretical amplitude amplification translates into executable quantum circuits, reinforcing the relationship between interference, probability amplitudes, and computational complexity.

•Mar 4, 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.
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.
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.
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.
Abstract This guide is based on the IBM Quantum course Phase Estimation and Factoring and focuses on Grover’s algorithm, a quantum algorithm for unstructured search problems that provides a quadratic speedup over classical approaches. In an unstructured search problem, we are given a function (often represented as an oracle) that marks one or more “correct” solutions among NNN possible candidates. A classical algorithm requires on the order of O(N)O(N)O(N) evaluations in the worst case. In contrast, Grover’s algorithm finds a solution using only O(N)O(\sqrt{N})O(N) oracle queries. This quadratic improvement implies: The quantum algorithm requires roughly the square root of the number of operations needed classically. Any classical algorithm for unstructured search must have cost at least quadratic relative to Grover’s quantum procedure. Core Idea of the Algorithm Grover’s algorithm relies on: Preparation of a uniform superposition (typically using Hadamard gates). An oracle that marks valid solutions via phase inversion. The Grover diffusion operator, which amplifies the probability amplitude of the marked states through interference. By repeatedly applying the Grover operator, the amplitude of the desired solution grows while others diminish, allowing measurement to reveal the correct answer with high probability. Practical Considerations Despite its theoretical elegance and wide applicability, the quadratic speedup of Grover’s algorithm is unlikely to yield near-term practical advantage. Modern classical hardware operates at extremely high clock rates and is vastly more mature than current quantum devices. For problem sizes accessible to today’s quantum computers, classical systems remain dominant. However, history shows that even sub-quadratic classical improvements — such as: Fast Fourier Transform (FFT) Efficient sorting algorithms like quicksort and mergesort have had transformative practical impact. The crucial distinction is that Grover’s algorithm depends on fundamentally different hardware — quantum processors — which are still in early development. Long-Term Perspective As quantum hardware advances in qubit count, coherence time, and error correction, Grover’s quadratic advantage may become practically significant for: Cryptographic key search Optimization heuristics Combinatorial search problems Amplitude amplification subroutines in broader quantum algorithms Through hands-on experimentation on IBM Q, this lesson demonstrates how theoretical amplitude amplification translates into executable quantum circuits, reinforcing the relationship between interference, probability amplitudes, and computational complexity.