Related papers: QW-Search/Zeta Correspondence
We define a zeta function of a finite graph derived from time evolution matrix of quantum walk, and give its determinant expression. Furthermore, we generalize the above result to a periodic graph.
Our previous works presented zeta functions by the Konno-Sato theorem or the Fourier analysis for one-particle models including random walks, correlated random walks, quantum walks, and open quantum random walks. This paper introduces a new…
Recently the Ihara zeta function for the finite graph was extended to infinite one by Clair and Chinta et al. In this paper, we obtain the same expressions by a different approach from their analytical method. Our new approach is to take a…
A modification of Tulsi's quantum search algorithm with intermediate measurements of the control is presented. In order to analyze the effect of measurements in quantum searches, a different choice of the angular parameter is used. The…
Quantum walk is a potent technique for building quantum algorithms. This paper examines the quantum walk search algorithm on complete multipartite graphs with multiple marked vertices, which has not been explored before. Two specific cases…
In quantum computing, the quantum walk search algorithm is designed for locating fixed marked nodes within a graph. However, when multiple marked nodes exist, the conventional search algorithm lacks the capacity to simultaneously amplify…
A $q$-analogue of the Hurwitz zeta-function is introduced through considerations on the spectral zeta-function of quantum group $SU_{q}(2)$, and its analytic aspects are studied via the Euler-MacLaurin summation formula. Asymptotic formulas…
We assign an arbitrary density matrix to a weighted graph and associate to it a graph zeta function that is both a generalization of the Ihara zeta function and a special case of the edge zeta function. We show that a recently developed…
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…
We propose a new method for designing quantum search algorithms for finding a "marked" element in the state space of a classical Markov chain. The algorithm is based on a quantum walk \'a la Szegedy (2004) that is defined in terms of the…
We define the quaternionic quantum walk on a finite graph and investigate its properties. This walk can be considered as a natural quaternionic extension of the Grover walk on a graph. We explain the way to obtain all the right eigenvalues…
In discrete-time quantum walk (DTQW) the walker's coin space entangles with the position space after the very first step of the evolution. This phenomenon may be exploited to obtain the value of the coin parameter $\theta$ by performing…
When searching for a marked vertex in a graph, Szegedy's usual search operator is defined by using the transition probability matrix of the random walk with absorbing barriers at the marked vertices. Instead of using this operator, we…
We study scattering quantum walks on highly symmetric graphs and use the walks to solve search problems on these graphs. The particle making the walk resides on the edges of the graph, and at each time step scatters at the vertices. All of…
Quantum walks have been very successful in the development of search algorithms in quantum information, in particular in the development of spatial search algorithms. However, the construction of continuous-time quantum search algorithms in…
The topological zeta function of a matroid is a rational function as well as a valuative invariant of the matroid, encoding rich combinatorial information. We analyze topological zeta functions of matroids from the vantage point of several…
Continuous-time quantum walks are natural tools for spatial search, where one searches for a marked vertex in a graph. Sometimes, the structure of the graph causes the walker to get trapped, such that the probability of finding the marked…
A quantum walk algorithm can detect the presence of a marked vertex on a graph quadratically faster than the corresponding random walk algorithm (Szegedy, FOCS 2004). However, quantum algorithms that actually find a marked element…
In this article, we give a proof of the link between the zeta function of two families of hypergeometric curves and the zeta function of a family of quintics that was observed numerically by Candelas, de la Ossa, and Rodriguez Villegas. The…
The Parrondo game, devised by Parrondo, means that winning strategy is constructed a combination of losing strategy. This situation is called the Parrondo paradox. The Parrondo game based on quantum walk and the search algorithm via quantum…