Related papers: QW-Search/Zeta Correspondence
Quantum walks, being the quantum analogue of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the `glued trees' algorithm, which provides…
In this paper, an elementary method to find the values of the Riemann Zeta function at even natural numbers, and to find values of a closely related series at odd natural numbers is presented. Another method, specifically for the evaluation…
In previous work (arXiv:1908.09589), we studied rational generating functions ("ask zeta functions") associated with graphs and hypergraphs. These functions encode average sizes of kernels of generic matrices with support constraints…
Quantum walk search may exhibit phenomena beyond the intuition from a conventional random walk theory. One of such examples is exceptional configuration phenomenon -- it appears that it may be much harder to find any of two or more marked…
We introduce a new tool for quantum algorithms called quantum fast-forwarding (QFF). The tool uses quantum walks as a means to quadratically fast-forward a reversible Markov chain. More specifically, with $P$ the Markov chain transition…
Quantum walks (QW) are of crucial importance in the development of quantum information processing algorithms. Recently, several quantum algorithms have been proposed to implement network analysis, in particular to rank the centrality of…
Building on the mapping relations between analytic functions and periodic functions using the abstract operators $\cos(h\partial_x)$ and $\sin(h\partial_x)$, and by defining the Zeta and related functions including the Hurwitz Zeta function…
A number of conjectures have been given recently concerning the connection between the antiferromagnetic XXZ spin chain at $\Delta = - \frac12$ and various symmetry classes of alternating sign matrices. Here we use the integrability of the…
Szegedy's quantum walk is a quantization of a classical random walk or Markov chain, where the walk occurs on the edges of the bipartite double cover of the original graph. To search, one can simply quantize a Markov chain with absorbing…
We define the zeta function of a noncommutative K3 surface over a finite field, an invariant under Fourier-Mukai equivalence that can be used to define point counts in this noncommutative setting. These point counts can be negative, and can…
Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
We study zeta-functions for a one parameter family of quintic threefolds defined over finite fields and for their mirror manifolds and comment on their structure. The zeta-function for the quintic family involves factors that correspond to…
The spatial search problem aims to find a marked vertex of a finite graph using a dynamic with two constraints: (1) The walker has no compass and (2) the walker can check whether a vertex is marked only after reaching it. This problem is a…
Results of extensive computations of moments of the Riemann zeta function on the critical line are presented. Calculated values are compared with predictions motivated by random matrix theory. The results can help in deciding between those…
For any integers $k\geq 2$, $q\geq 1$ and any finite set $\mathcal{A}=\{{\boldsymbol{\alpha}}_1,\cdots,{\boldsymbol{\alpha}}_q\}$, where ${ \boldsymbol{\alpha}_t}=(\alpha_{t,1},\cdots,\alpha_{t,k})~(1\leq t\leq q)$ with…
Quantum walks have wide applications in quantum information, such as universal quantum computation, so it is important to explore properties of quantum walks thoroughly. We propose a novel method to implement discrete-time quantum walks…
We introduce the Peierls substitution to a two-dimensional discrete-time quantum walk on a square lattice to examine the spreading dynamics and the coin-position entanglement in the presence of an artificial gauge field. We use the ratio of…
We formulate Grover's unstructured search algorithm as a chiral quantum walk, where transitioning in one direction has a phase conjugate to transitioning in the opposite direction. For small phases, this breaking of time-reversal symmetry…
The integrated shear 3-point correlation function $\zeta_{\pm}$ measures the correlation between the local shear 2-point function $\xi_{\pm}$ and the 1-point shear aperture mass in patches of the sky. Unlike other higher-order statistics,…