Related papers: Realization of a quantum walk with one and two tra…
We propose an implementation of a quantum walk on a circle on an optomechanical system by encoding the walker on the phase space of a radiation field and the coin on a two-level state of a mechanical resonator. The dynamics of the system is…
We observe that changing a phase at a single point in a discrete quantum walk results in a rather surprising localization effect. For certain values of this phase change the possibility of localization strongly depends on the internal…
The quantum random walk has drawn special interests because its remarkable features to the classical counterpart could lead to new quantum algorithms. In this paper, we propose a feasible scheme to implement quantum random walks on a line…
Quantum walks are referred to as quantum analogs to random walks in mathematics. They have been studied as quantum algorithms in quantum information for quantum computers. There are two types of quantum walks. One is the discrete-time…
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…
The quantum walk is a dynamical protocol which describes the motion of spinful particles on a lattice. Also, it has been demonstrated to be a powerful platform to explore topological quantum matter. Recently, the quantum walk in coherent…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
Quantum walks of correlated particles offer the possibility to study large-scale quantum interference, simulate biological, chemical and physical systems, and a route to universal quantum computation. Here we demonstrate quantum walks of…
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 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…
We report on the possibility of controlling quantum random walks with a step-dependent coin. The coin is characterized by a (single) rotation angle. Considering different rotation angles, one can find diverse probability distributions for…
Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more…
We have investigated ion dynamics associated with a dual linear ion trap where ions can be stored in and moved between two distinct locations. Such a trap is a building block for a system to engineer arbitrary quantum states of ion…
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…
This letter treats the quantum random walk on the line determined by a 2 times 2 unitary matrix U. A combinatorial expression for the mth moment of the quantum random walk is presented by using 4 matrices, P, Q, R and S given by U. The…
Quantum walks can be used either as tools for quantum algorithm development or as entanglement generators, potentially useful to test quantum hardware. We present a novel algorithm based on a discrete Hadamard quantum walk on a line with…
We explore a continuous-time quantum walk starting at a single vertex on the discrete path and cycle with a cubic nonlinearity. Such nonlinearities arise in Bose-Einstein condensates described by the Gross-Pitaevskii equation or by…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
Experiments directed towards the development of a quantum computer based on trapped atomic ions are described briefly. We discuss the implementation of single qubit operations and gates between qubits. A geometric phase gate between two ion…
Exploiting multi-dimensional quantum walks as feasible platforms for quantum computation and quantum simulation is attracting constantly growing attention from a broad experimental physics community. Here, we propose a two-dimensional…