Quantum walks are powerful tools not only for constructing the quantum speedup algorithms but also for describing specific models in physical processes. Furthermore, the discrete time quantum walk has been experimentally realized in various setups. We apply the concept of the quantum walk to the problems in quantum foundations. We show that randomness and the arrow of time in the quantum walk gradually emerge by periodic projective measurements from the mathematically obtained limit distribution under the time-scale transformation.
Quantum walks are powerful tools not only for constructing the quantum speedup algorithms but also for describing specific models in physical processes. Furthermore, the discrete time quantum walk has been experimentally realized in various setups. We apply the concept of the quantum walk to the problems in quantum foundations. We show that randomness and the arrow of time in the quantum walk gradually emerge by periodic projective measurements from the mathematically obtained limit distribution under the time-scale transformation.
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of research of quantum computation full of exciting open problems for physicists, computer scientists and engineers. In this paper we review theoretical advances on the foundations of both discrete- and continuous-time quantum walks, together with the role that randomness plays in quantum walks, the connections between the mathematical models of coined discrete quantum walks and continuous quantum walks, the quantumness of quantum walks, a summary of papers published on discrete quantum walks and entangle-ment as well as a succinct review of experimental proposals and realizations of discrete-time quantum walks. Furthermore, we have reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete-time quantum walks.
While the microscopic laws of physics are often symmetric under time reversal, most natural processes that we observe are not. The emergent asymmetry between typical and time-reversed processes is referred to as the arrow of time. In quantum physics, an arrow of time emerges when a sequence of measurements is performed on a system. We introduce quantum control tools that can yield dynamics more consistent with time flowing backward than forward. The control tools are based on the explicit construction of a Hamiltonian that can replicate the stochastic trajectories of a monitored quantum system. Such a Hamiltonian can reverse the effect of monitoring and, via a feedback process, generate trajectories consistent with a reversed arrow of time. It can also be used to simulate the backward-in-time dynamics of an open quantum system. Finally, we design a feedback-driven continuous measurement engine powered by the energy pumped into the system by the monitoring process. We show that the engine can operate under experimentally realizable conditions with feedback delay and finite-efficiency measurements.
Quantum walks can be defined in two quite distinct ways: discrete-time and continuous-time quantum walks (DTQWs and CTQWs). For classical random walks, there is a natural sense in which continuous-time walks are a limit of discrete-time walks. Quantum mechanically, in the discrete-time case, an additional ``coin space'' must be appended for the walk to have nontrivial time evolution. Continuous-time quantum walks, however, have no such constraints. This means that there is no completely straightforward way to treat a CTQW as a limit of a DTQW, as can be done in the classical case. Various approaches to this problem have been taken in the past. We give a construction for walks on d-regular, d-colorable graphs when the coin flip operator is Hermitian: from a standard DTQW we construct a family of discrete-time walks with a well-defined continuous-time limit on a related graph. One can think of this limit as a ``coined'' continuous-time walk. We show that these CTQWs share some properties with coined DTQWs. In particular, we look at a spatial search by a DTQW over the two-dimensional (2D) torus (a grid with periodic boundary conditions) of size $\sqrt{N}\ifmmode\times\else\texttimes\fi{}\sqrt{N}$, where it was shown that a coined DTQW can search in time O(NlogN), but a standard CTQW takes $\mathrm{\ensuremath{\Omega}}(N)$ time to search for a marked element. The continuous limit of the DTQW search over the 2D torus exhibits the O(NlogN) scaling, like the coined walk it is derived from. We also look at the effects of graph symmetry on the limiting walk, and show that the properties are similar to those of the DTQW as shown in Krovi and Brun, Phys. Rev. A 75, 062332 (2007).
Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms, and quantum simulation of condensed-matter systems. The key property of quantum walks, which lies at the heart of their quantum information applications, is the possibility for a parametric quantum speedup in propagation compared to classical random walks. In this work we study propagation of quantum walks on percolation-generated two-dimensional random lattices. In large-scale simulations of topological and trivial split-step walks, we identify distinct prediffusive and diffusive behaviors at different timescales. Importantly, we show that even arbitrarily weak concentrations of randomly removed lattice sites give rise to a complete breakdown of the superdiffusive quantum speedup, reducing the motion to ordinary diffusion. By increasing the randomness, quantum walks eventually stop spreading due to Anderson localization. Near the localization threshold, we find that the quantum walks become subdiffusive. The fragility of quantum speedup implies dramatic limitations for quantum information applications of quantum walks on random geometries and graphs.