Related papers: QW-Search/Zeta Correspondence
The running time of a quantum walk search algorithm depends on both the structure of the search space (graph) and the configuration of marked locations. While the first dependence have been studied in a number of papers, the second…
We prove some results connecting the zeta functions of varieties over finite fields with the big Witt ring over $\mathbb Z$. We explore relations with motivic measures and a classical formula of Macdonald on invariants of symmetric products…
The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena…
We provide a framework for relating certain q-series defined by sums over partitions to multiple zeta values. In particular, we introduce a space of polynomial functions on partitions for which the associated q-series are q-analogues of…
In this paper, we study the relation between the zeta function of a Calabi-Yau hypersurface and the zeta function of its mirror. Two types of arithmetic relations are discovered. This motivates us to formulate two general arithmetic mirror…
We define a zeta function woth respect to the twisted Grover matrix of a mixed digraph, and present an exponential expression and a determinant expression of this zeta function. As an application, we give a trace formula with respect to the…
We define a new weighted zeta function for a finite graph and obtain its determinant expression. This result gives the characteristic polynomial of the transition matrix of the Szegedy walk on a graph.
The quantum SearchRank algorithm is a promising tool for a future quantum search engine based on PageRank quantization. However, this algorithm loses its functionality when the $N/M$ ratio between the network size $N$ and the number of…
Quantum walks underlie an important class of quantum computing algorithms, and represent promising approaches in various simulations and practical applications. Here we design stroboscopically monitored quantum walks and their subsequent…
We study the quantum walk search algorithm of Shenvi, Kempe and Whaley [PRA 67 052307 (2003)] on data structures of one to two spatial dimensions, on which the algorithm is thought to be less efficient than in three or more spatial…
In this paper, we analyze the potential for new types of searches using the formalism of scattering random walks on Quantum Computers. Given a particular type of graph consisting of nodes and connections, a "Tree Maze", we would like to…
We define the rank-metric zeta function of a code as a generating function of its normalized $q$-binomial moments. We show that, as in the Hamming case, the zeta function gives a generating function for the weight enumerators of rank-metric…
Spatial search is the problem of finding a marked vertex in a graph. A continuous-time quantum walk in the single-excitation subspace of an $n$ spin system solves the problem of spatial search by finding the marked vertex in $O(\sqrt{n})$…
We introduce the etale framework to study Igusa zeta functions in several variables, generalizing the machinery of vanishing cycles in the univariate case. We define the etale Alexander modules, associated to a morphism of varieties F from…
We address the quantum search of a target node on a cycle graph by means of a quantum walk assisted by continuous measurement and feedback. Unlike previous spatial search approaches, where the oracle is described as a projector on the…
In this paper, we give a formula that connects two variants of multiple zeta values; multitangent functions and symmetric multiple zeta values. As an application of this formula, we give two results. First, we prove Bouillot's conjecture on…
In this work, we study the effect of a moving detector on a discrete time one dimensional Quantum Random Walk where the movement is realized in the form of hopping/shifts. The occupation probability $f(x,t;n,s)$ is estimated as the number…
The present essay aims at investigating whether and how far an algebraic analysis of the Zeta Function and of the Riemann Hypothesis can be carried out. Of course the well-established properties of the Zeta Function, explored in depth in…
Quantum algorithms have demonstrated provable speedups over classical counterparts, yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge. In this work, we decode the quantum…
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…