Related papers: One Dimensional Quantum Walks with Memory
Quantum walks contribute significantly to developing quantum algorithms and quantum simulations. Here, we introduce a first of its kind one-dimensional quantum walk in the $d$-dimensional quantum domain, where $d>2$, and show its…
We consider the Grover walk as a 4-state quantum walk without memory in one dimension. The walker in our 4-state quantum walk moves to the left or right. We compute the stationary distribution of the walk, in addition, we obtain the weak…
We look at two possible routes to classical behavior for the discrete quantum random walk on the line: decoherence in the quantum ``coin'' which drives the walk, or the use of higher-dimensional coins to dilute the effects of interference.…
We study the motion of two non-interacting quantum particles performing a random walk on a line and analyze the probability that the two particles are detected at a particular position after a certain number of steps (meeting problem). The…
We implement the proof of principle for the quantum walk of one ion in a linear ion trap. With a single-step fidelity exceeding 0.99, we perform three steps of an asymmetric walk on the line. We clearly reveal the differences to its…
We introduce a multi-coin discrete quantum random walk where the amplitude for a coin flip depends upon previous tosses. Although the corresponding classical random walk is unbiased, a bias can be introduced into the quantum walk by varying…
In this article we investigate the effects of shifting position decoherence, arisen from the tunneling effect in the experimental realization of the quantum walk, on the one-dimensional discreet time quantum walk. We show that in the regime…
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,…
We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., non-random) case, we allow any…
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absorbing walls for the one-dimensional case. We compute these…
Quantum walks are versatile simulators of topological phases and phase transitions as observed in condensed matter physics. Here, we utilize a step dependent coin in quantum walks and investigate what topological phases we can simulate with…
In this paper, we numerically study quantum walks on two kinds of two-dimensional graphs: cylindrical strip and Mobius strip. The two kinds of graphs are typical two-dimensional topological graph. We study the crossing property of quantum…
We propose a new hash function QHFM based on controlled alternate quantum walks with memory on cycles, where the jth message bit decides whether to run quantum walk with one-step memory or to run quantum walk with two-step memory at the jth…
The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk, which allows for incoherent…
We analyze a special class of 1-D quantum walks (QWs) realized using optical multi-ports. We assume non-perfect multi-ports showing errors in the connectivity, i.e. with a small probability the multi- ports can connect not to their nearest…
Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…
Quantum walks in an elaborately designed graph, is a powerful tool simulating physical and topological phenomena, constructing analog quantum algorithms and realizing universal quantum computing. Integrated photonics technology has emerged…
We survey recent results of normal and anomalous diffusion of two types of random motions with long memory in ${\Bbb R}^d$ or ${\Bbb Z}^d$. The first class consists of random walks on ${\Bbb Z}^d$ in divergence-free random drift field,…
We introduce a multidimensional walk with memory and random tendency. The asymptotic behaviour is characterized, proving a law of large numbers and showing a phase transition from diffusive to superdiffusive regimes. In first case, we…
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…