Related papers: Spatial search by continuous-time quantum walks on…
We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous-time, which involves sketching small weighted graphs with self-loops and considering degenerate…
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…
A Plastic Quantum Walk admits both continuous time and continuous spacetime. The model has been recently proposed by one of the authors in \cite{molfetta2019quantum}, leading to a general quantum simulation scheme for simulating fermions in…
For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…
We study, on a $d$ dimensional hypercubic lattice, a random walk which is homogeneous except for one site. Instead of visiting this site, the walker hops over it with arbitrary rates. The probability distribution of this walk and the…
A quantum algorithm that solves the time-dependent Dirac equation on a digital quantum computer is developed and analyzed. The time evolution is performed by an operator splitting decomposition technique that allows for a mapping of the…
We discuss the model of a one-dimensional, discrete-time walk on a line with spatial heterogeneity in the form of a variable set of ultrametric barriers. Inspired by the homogeneous quantum walk on a line, we develop a formalism by which…
We investigate the application of quantum computing algorithms to enhance the efficiency of enumerating self-avoiding walks (SAWs), utilizing quantum properties such as superposition and interference. A Quantum Amplitude Estimation…
We realize a pair of simultaneous ten-step one-dimensional quantum walks with two walkers sharing coins, which we prove is analogous to the ten-step two-dimensional quantum walk with a single walker holding a four-dimensional coin. Our…
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…
If the structure of spacetime is discrete, then Lorentz symmetry should only be an approximation, valid at long length scales. At finite lattice spacings there will be small corrections to the Dirac evolution that could in principle be…
An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…
Discrete-time Quantum Walks (QWs) are transportation models of single quantum particles over a lattice. Their evolution is driven through causal and local unitary operators. QWs are a powerful tool for quantum simulation of fundamental…
Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with…
We consider the 2D alternate quantum walk on a cylinder. We concentrate on the study of the motion along the open dimension, in the spirit of looking at the closed coordinate as a small or "hidden" extra dimension. If one starts from…
We present a polynomial-time quantum algorithm for the Hidden Subgroup Problem over $\mathbb{D}_{2^n}$. The usual approach to the Hidden Subgroup Problem relies on harmonic analysis in the domain of the problem, and the best known algorithm…
We report an efficient methodology for enumerating the Hamiltonian walks in two and three dimensional lattices of large sizes, using the concept of centroids. This strategy, with the help of JAVA programming enables the exact computation of…
Lazy quantum walks were presented by Andrew M. Childs to prove that the continuous-time quantum walk is a limit of the discrete-time quantum walk [Commun.Math.Phys.294,581-603(2010)]. In this paper, we discuss properties of lazy quantum…
Quantum random walks have received much interest due to their non-intuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable…