Related papers: Localization of Two-Dimensional Quantum Walks
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
Coherent evolution governs the behaviour of all quantum systems, but in nature it is often subjected to influence of a classical environment. For analysing quantum transport phenomena quantum walks emerge as suitable model systems. In…
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…
The interest in quantum walks has been steadily increasing during the last two decades. It is still worth to present new forms of quantum walks that might find practical applications and new physical behaviors. In this work, we define…
Quantum walks (QWs) exhibit different properties compared with classical random walks (RWs), most notably by linear spreading and localization. In the meantime, random walks that replicate quantum walks, which we refer to as…
A discrete-time staggered quantum walk was recently introduced as a generalization that allows to unify other versions, such as the coined and Szegedy's walk. However, it also produces new forms of quantum walks not covered by previous…
We analyze the dynamics of multiparticle discrete-time quantum walk on the two-dimensional lattice, with an interaction inspired on a classical model for gas collision, called HPP model. In this classical model, the direction of motion…
The exponential speed-up of quantum walks on certain graphs, relative to classical particles diffusing on the same graph, is a striking observation. It has suggested the possibility of new fast quantum algorithms. We point out here that…
Quantum walks subject to decoherence generically suffer the loss of their genuine quantum feature, a quadratically faster spreading compared to classical random walks. This intuitive statement has been verified analytically for certain…
We study how a single lattice defect in a discrete time quantum walk affects the return probability of a quantum particle. This defect at the starting position is modeled by a quantum coin that is distinct from the others over the lattice.…
Quantum walks constitute an important tool for designing quantum algorithms and information processing tasks. In a lackadaisical walk, in addition to the possibility of moving out of a node, the walker can remain on the same node with some…
We connect the Grover walk with sinks to the Grover walk with tails. The survival probability of the Grover walk with sinks in the long time limit is characterized by the centered generalized eigenspace of the Grover walk with tails. The…
Delocalization transition is numerically found in a non-Hermitian extension of a discrete-time quantum walk on a one-dimensional random medium. At the transition, an eigenvector gets delocalized and at the same time the corresponding energy…
We study the localization of probability distribution in a discrete quantum random walk on an infinite chain. With a phase defect introduced in any position of the quantum random walk (QRW), we have found that the localization of the…
We propose a novel implementation of discrete time quantum walks for a neutral atom in an array of optical microtraps or an optical lattice. We analyze a one-dimensional walk in position space, with the coin, the additional qubit degree of…
In the typical spatial search problems solved by continuous-time quantum walk, changing the location of the marked vertices does not alter the search problem. In this paper, we consider search when this is no longer true. In particular, we…
The execution of Grover's quantum search algorithm needs rather limited resources without much fine tuning. Consequently, the algorithm can be implemented in a variety of physical set-ups, which involve wave dynamics but may not need other…
We study electric quantum walks in two dimensions considering Grover, Alternate, Hadamard, and DFT quantum walks. In the Grover walk the behaviour under an electric field is easy to summarize: when the field direction coincides with the x…
We investigate the properties of a quantum walk which can simulate the behavior of a spin $1/2$ particle in a model with an ordinary spatial dimension, and one extra dimension with warped geometry between two branes. Such a setup…
The spatial search problem aims to find a marked vertex of a finite graph using a dynamic with two constraints: (1) The walker has no compass and (2) the walker can check whether a vertex is marked only after reaching it. This problem is a…