Related papers: Localization of Two-Dimensional Quantum Walks
We introduce and study a class of discrete-time quantum walks on a one-dimensional lattice. In contrast to the standard homogeneous quantum walks, coin operators are inhomogeneous and depend on their positions in this class of models. The…
Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolutions by Schr\"odinger's equation. In the former, the…
Grover's quantum search algorithm can be formulated as a quantum particle randomly walking on the (highly symmetric) complete graph, with one vertex marked by a nonzero potential. From an initial equal superposition, the state evolves in a…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…
Quantum walks are promising for information processing tasks because on regular graphs they spread quadratically faster than random walks. Static disorder, however, can turn the tables: unlike random walks, quantum walks can suffer Anderson…
An ideal quantum walk transitions from one vertex to another with perfect fidelity, but in physical systems, the particle may be hindered by potential energy barriers. Then the particle has some amplitude of tunneling through the barriers,…
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…
We analyze in detail the discrete--time quantum walk on the line by separating the quantum evolution equation into Markovian and interference terms. As a result of this separation, it is possible to show analytically that the quadratic…
In this paper, we introduce a multidimensional generalization of Kitagawa's split-step discrete-time quantum walk, study the spectrum of its evolution operator for the case of one defect coins, and prove localization of the walk. Using a…
While completely self-avoiding quantum walks have the distinct property of leading to a trivial unidirectional transport of a quantum state, an interesting and non-trivial dynamics can be constructed by restricting the self-avoidance to a…
The discrete quantum walk in N dimensions is analyzed from the perspective of its dispersion relations. This allows understanding known properties, as well as designing new ones when spatially extended initial conditions are considered.…
We consider a new model of quantum walk on a one-dimensional momentum space that includes both discrete jumps and continuous drift. Its time evolution has two stages; a Markov diffusion followed by localized dynamics. As in the well known…
A quantum walker moves on the integers with four extra degrees of freedom, performing a coin-shift operation to alter its internal state and position at discrete units of time. The time evolution is described by a unitary process. We focus…
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…
Quantum walks are considered in a one-dimensional random medium characterized by static or dynamic disorder. Quantum interference for static disorder can lead to Anderson localization which completely hinders the quantum walk and it is…
A quantum walk on a lattice is a paradigm of a quantum search in a database. The database qubit strings are the lattice sites, qubit rotations are tunneling events, and the target site is tagged by an energy shift. For quantum walks on a…
We study the decoherence effects originating from state flipping and depolarization for two-dimensional discrete-time quantum walks using four-state and two-state particles. By quantifying the quantum correlations between the particle and…
We consider a spectral analysis on the quantum walks on graph $G=(V,E)$ with the local coin operators $\{C_u\}_{u\in V}$ and the flip flop shift. The quantum coin operators have commonly two distinct eigenvalues $\kappa,\kappa'$ and…
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…
The evolution of a walker in standard "Discrete-time Quantum Walk (DTQW)" is determined by coin and shift unitary operators. The conditional shift operator shifts the position of the walker to right or left by unit step size while the…