Related papers: QW-Search/Zeta Correspondence
We consider a generalization of the Mahler measure of a multivariable polynomial $P$ as the integral of $\log^k|P|$ in the unit torus, as opposed to the classical definition with the integral of $\log|P|$. A zeta Mahler measure, involving…
The defining feature of memoryless quantum walks is that they operate on the vertex space of a graph, and therefore can be used to produce search algorithms with minimal memory. We present a memoryless walk that can find a unique marked…
The scale-free property emerges in various real-world networks and is an essential property which characterizes the dynamics or features of such networks. In this work we investigate the effect of this scale-free property on a quantum…
Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Whether spatial search by continuous-time quantum walk provides a…
The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum random walk (QRW) with the problem of data clustering, and develop two clustering algorithms based on the one…
We first review our previous works of Arakawa and the authors on two, closely related single-variable zeta functions. Their special values at positive and negative integer arguments are respectively multiple zeta values and poly-Bernoulli…
We show a simple generalization of the quantum walk algorithm for search in backtracking trees by Montanaro (ToC 2018) to the case where vertices can have different times of computation. If a vertex $v$ in the tree of depth $D$ is computed…
Finding a marked vertex in a graph can be a complicated task when using quantum walks. Recent results show that for two or more adjacent marked vertices search by quantum walk with Grover's coin may have no speed-up over classical…
Lackadaisical quantum walk(LQW) has been an efficient technique in searching a target state from a database which is distributed on a two-dimensional lattice. We numerically study the quantum search algorithm based on the lackadaisical…
We present several families of graphs that allow both efficient quantum walk implementations and efficient quantum walk based search algorithms. For these graphs, we construct quantum circuits that explicitly implement the full quantum walk…
A new, seemingly useful presentation of zeta functions on complex tori is derived by using contour integration. It is shown to agree with the one obtained by using the Chowla-Selberg series formula, for which an alternative proof is thereby…
We examine the effect of network heterogeneity on the performance of quantum search algorithms. To this end, we study quantum search on a tree for the oracle Hamiltonian formulation employed by continuous-time quantum walks. We use…
An analytic representation with Theta functions on a torus, for systems with variables in Z(d), is considered. Another analytic representation with Theta functions on a strip, for systems with positions in a circle S and momenta in Z, is…
This work examines the time complexity of quantum search algorithms on combinatorial $t$-designs with multiple marked elements using the continuous-time quantum walk. Through a detailed exploration of $t$-designs and their incidence…
The functional relation of the Hurwitz zeta function is proved by using the connection problem of the confluent hypergeometric equation.
Our previous work dealt with the zeta function for the interacting particle system (IPS) including quantum cellular automaton (QCA) as a typical model in the study of ``IPS/Zeta Correspondence". On the other hand, the absolute zeta function…
There are at least three models of discrete-time quantum walks (QWs) on graphs currently under active development. In this work we focus on the equivalence of two of them, known as Szegedy's and staggered QWs. We give a formal definition of…
Since Grover's seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items and we would like to find a marked item. We consider a new variant of this problem in which…
The purpose of this note is to give a brief overview on zeta functions of curve singularities and to provide some evidences on how these and global zeta functions associated to singular algebraic curves over perfect fields relate to each…
Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time…