Related papers: Coined Quantum Walks as Quantum Markov Chains
We analyze the role of dimensionality in the time evolution of discrete time quantum walks through the example of the three-state walk on a two-dimensional, triangular lattice. We show that the three-state Grover walk does not lead to…
In this paper we construct (nonhomogeneous) quantum Markov chains associated with open quantum random walks. The quantum Markov chain, like the classical Markov chain, is a fundamental tool for the investigation of the basic properties such…
Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any…
Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with emphasis on their algorithmic applications.
We provide an explanation of recent experimental results of Xue et al., where full revivals in a time-dependent quantum walk model with a periodically changing coin are found. Using methods originally developed for "electric" walks with a…
We demonstrate a quantum walk with time-dependent coin bias. With this technique we realize an experimental single-photon one-dimensional quantum walk with a linearly-ramped time-dependent coin flip operation and thereby demonstrate two…
We study search by quantum walk on a two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [AKR05]. We show what the most natural coin transformation - Grover's diffusion transformation - has a wide class of exceptional…
The staggered quantum walk is a type of discrete-time quantum walk model without a coin which can be generated on a graph using particular partitions of the graph nodes. We design Hamiltonians for potential realization of the staggered…
The conventional spectral mapping theorem for quantum walks can only be applied for walks employing a shift operator whose square is the identity. This theorem gives most of the eigenvalues of the time evolution $U$ by lifting the…
Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian…
We study a class of discrete-time quantum walks with inhomogeneous coins defined in [Y. Shikano and H. Katsura, Phys. Rev. E {\bf 82}, 031122 (2010)]. We establish symmetry properties of the spectrum of the evolution operator, which…
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…
We extend the idea of a discrete-time quantum walk on a graph by placing a qubit on each vertex, and allowing the walker to interact with the qubit at its current position. We show that allowing for a controlled-Z interaction at each time…
We study a 2-D disordered time-discrete quantum walk based on 1-D `generalized elephant quantum walk' where an entangling coin operator is assumed and which paves the way to a new set of properties. We show that considering a given disorder…
Quantum walks (QWs) describe the evolution of quantum systems on graphs. An intrinsic degree of freedom---called the coin and represented by a finite-dimensional Hilbert space---is associated to each node. Scalar quantum walks are QWs with…
We study the dynamics of a generalization of quantum coin walk on the line which is a natural model for a diffusion modified by quantum or interference effects. In particular, our results provide surprisingly simple explanations to…
Our previous work presented explicit formulas for the generalized zeta function and the generalized Ihara zeta function corresponding to the Grover walk and the positive-support version of the Grover walk on the regular graph via the…
In this paper, we investigate the simulation of continuous-time quantum walks on specific classes of graphs, for which it is possible to fast-forward the time-evolution operator to achieve constant-time simulation complexity and to perform…
We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., non-random) case, we allow any…
We prove that a quantum walk can detect the presence of a marked element in a graph in $O(\sqrt{WR})$ steps for any initial probability distribution on vertices. Here, $W$ is the total weight of the graph, and $R$ is the effective…