Related papers: Decoherence on a two-dimensional quantum walk usin…

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.…

Solid state quantum bits are a promising candidate for the realization of a scalable quantum computer, however, they are usually strongly limited by decoherence. We consider a double quantum dot charge qubit, whose basis states are defined…

We study the response of spreading behavior, of two-dimensional discrete-time quantum walks, to glassy disorder in the jump length. We consider different discrete probability distributions to mimic the disorder, and three types of coin…

The Grover walk, which is related to the Grover's search algorithm on a quantum computer, is one of the typical discrete time quantum walks. However, a localization of the two-dimensional Grover walk starting from a fixed point is striking…

We demonstrate a previously unknown two-photon effect in a discrete-time quantum walk. Two identical bosons with no mutual interactions nonetheless can remain clustered together as they walk on a lattice of directionally-reversible optical…

We investigate the two-component quantum walk in one-dimensional lattice. We show that the inter-component interaction strength together with the hopping imbalance between the components exhibit distinct features in the quantum walk for…

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-…

Multi-dimensional quantum walks usually require large coin spaces. Here we show that the non-localized case of the spatial density probability of the two-dimensional Grover walk can be obtained using only a two-dimensional coin space and a…

Using the methods of quantum trajectories we study effects of dissipative decoherence on the accuracy of the Grover quantum search algorithm. The dependence on the number of qubits and dissipation rate are determined and tested numerically…

We show analytically that particle trapping appears in a quantum process called "quantum walk", in which the particle moves macroscopically correlating to the inner states. It has been well known that a particle in the ``Hadamard walk" with…

We study the evolution of quantum correlations in two-particle discrete-time non-unitary quantum walks on a line with gain and loss. The two particles are initially prepared in a maximally entangled state and evolve independently. Using…

Quantum walks have a host of applications, ranging from quantum computing to the simulation of biological systems. We present an intrinsically stable, deterministic implementation of discrete quantum walks with single photons in space. The…

We present an investigation of many-particle quantum walks in systems of non-interacting distinguishable particles. Along with a redistribution of the many-particle density profile we show that the collective evolution of the many-particle…

We prove analytical results showing that decoherence can be useful for mixing time in a continuous-time quantum walk on finite cycles. This complements the numerical observations by Kendon and Tregenna (Physical Review A 67 (2003), 042315)…

One-dimensional discrete-time quantum walk has played an important role in development of quantum algorithms and protocols for different quantum simulations. The speedup observed in quantum walk algorithms is attributed to quantum…

We study and experimentally implement a double-slit quantum eraser in the presence of a controlled decoherence mechanism. A two-photon state, produced in a spontaneous parametric down conversion process, is prepared in a maximally entangled…

We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and…

We study the influence of particle interaction on a quantum walk on a bipartite one-dimensional lattice with decay from every second site. The corresponding non-interacting (linear) system has been shown to have a topological transition…

Recently several quantum search algorithms based on quantum walks were proposed. Those algorithms differ from Grover's algorithm in many aspects. The goal is to find a marked vertex in a graph faster than classical algorithms. Since the…

We study a generalized Hadamard walk in one dimension with three inner states. The particle governed by the three-state quantum walk moves, in superposition, both to the left and to the right according to the inner state. In addition to…