Related papers: One Dimensional Quantum Walks with Two-step Memory
The quantum walk was originally proposed as a quantum mechanical analogue of the classical random walk, and has since become a powerful tool in quantum information science. In this paper, we show that discrete time quantum walks provide a…
A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distribution after N steps is determined by reshuffling the first N distributions that arise in a classical random walk with the same initial…
A novel concept of quantum random access memory (qRAM) employing a quantum walk is provided. Our qRAM relies on a bucket brigade scheme to access the memory cells. Introducing a bucket with chirality left and right as a quantum walker, and…
We present a method for bidirectional teleportation of a single qubit using quantum walks on two independent one dimensional lattices and two independent cycles with four vertices, employing nearest neighbor jumps with coin outcomes. In…
Quantum walks are widely and successfully used to model diverse physical processes. This leads to computation of the models, to explore their properties. Quantum walks have also been shown to be universal for quantum computing. This is a…
We investigate continuous-time quantum walks of two indistinguishable particles (bosons, fermions or hard-core bosons) in one-dimensional lattices with nearest-neighbour interactions. The two interacting particles can undergo independent-…
A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…
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…
The study of quantum walk processes has been widely divided into two standard variants, the discrete-time quantum walk (DTQW) and the continuous-time quantum walk (CTQW). The connection between the two variants has been established by…
Inspired by the classical phenomenon of random walk, the concept of quantum walk has emerged recently as a powerful platform for the dynamical simulation of complex quantum systems, entanglement production and universal quantum computation.…
Coined quantum walks may be interpreted as the motion in position space of a quantum particle with a spin degree of freedom; the dynamics are determined by iterating a unitary transformation which is the product of a spin transformation and…
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 present a scheme for multi-bit quantum random number generation using a single qubit discrete-time quantum walk in one-dimensional space. Irrespective of the initial state of the qubit, quantum interference and entanglement of particle…
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…
An explicit formula of the Hamiltonians generating one-dimensional discrete-time quantum walks is given. The formula is deduced by using the algebraic structure introduced previously. The square of the Hamiltonian turns out to be an…
We propose a scheme to implement the one-dimensional coined quantum walk with electrons transported through a two-dimensional network of spintronic semiconductor quantum rings. The coin degree of freedom is represented by the spin of the…
We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.
Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the…
We consider two independent quantum walks on separate lines augmented by partial or full swapping of coins after each step. For classical random walks, swapping or not swapping coins makes little difference to the random walk…
Quantum walks constitute a rich area of quantum information science, where multipartite entanglement plays a central role in the dynamics and scalability of quantum advantage over classical simulators. In this work, we study the…