Related papers: Decoherence in Quantum Walks on the Hypercube
We show that quantum walks interpolate between a coherent `wave walk' and a random walk depending on how strongly the walker's coin state is measured; i.e., the quantum walk exhibits the quintessentially quantum property of complementarity,…
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 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, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…
Decoherence in quantum bit circuits is presently a major limitation to their use for quantum computing purposes. We present experiments, inspired from NMR, that characterise decoherence in a particular superconducting quantum bit circuit,…
We present evidence that decoherence can produce a smooth quantum-to-classical transition in nonlinear dynamical systems. High-resolution tracking of quantum and classical evolutions reveals differences in expectation values of…
We compare discrete-time quantum walks on graphs to their natural classical equivalents, which we argue are lifted Markov chains, that is, classical Markov chains with added memory. We show that these can simulate quantum walks, allowing us…
We propose an experimental realization of discrete quantum random walks using neutral atoms trapped in optical lattices. The random walk is taking place in position space and experimental implementation with present day technology --even…
We consider a network model, embedded on the Manhattan lattice, of a quantum localisation problem belonging to symmetry class C. This arises in the context of quasiparticle dynamics in disordered spin-singlet superconductors which are…
We characterize quantumness of the so-called quantum walks (whose dynamics is governed by quantum mechanics) by introducing two computable measures which are stronger than the variance of the walker's position probability distribution. The…
Temporal fluctuations in the Hadamard walk on circles are studied. A temporal standard deviation of probability that a quantum random walker is positive at a given site is introduced to manifest striking differences between quantum and…
A classical lazy random walk on cycles is known to mix to the uniform distribution. In contrast, we show that a continuous-time quantum walk on cycles exhibit strong non-uniform mixing properties. Our results include the following: - The…
Quantum walks in atomic systems, owing to their continuous nature, are especially well-suited for the simulation of many-body physics and can potentially offer an exponential speedup in solving certain black box problems. Photonics offers…
One can view quantum mechanics as a generalization of classical probability theory that provides for pairwise interference among alternatives. Adopting this perspective, we ``quantize'' the classical random walk by finding, subject to a…
Quantum walks are the quantum mechanical analogue of classical random walks and an extremely powerful tool in quantum simulations, quantum search algorithms, and even for universal quantum computing. In our work, we have designed and…
We have studied the decoherence properties of adiabatic quantum computation (AQC) in the presence of in general non-Markovian, e.g., low-frequency, noise. The developed description of the incoherent Landau-Zener transitions shows that the…
We study the decoherence properties of a two-level (qubit) system homogeneously coupled to an environmental many-body system at a quantum transition, considering both continuous and first-order quantum transitions. In particular, we…
Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the…
Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks…
We study some discrete symmetries of unbiased (Hadamard) and biased quantum walk on a line, which are shown to hold even when the quantum walker is subjected to environmental effects. The noise models considered in order to account for…