Quantum walks: a comprehensive review

  title={Quantum walks: a comprehensive review},
  author={Salvador El{\'i}as Venegas-Andraca},
  journal={Quantum Information Processing},
  • S. Venegas-Andraca
  • Published 2012
  • Computer Science, Physics, Mathematics
  • Quantum Information Processing
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… Expand
Quantum logic using correlated one-dimensional quantum walks
It is shown that even in the simplest case of a quantum walk on a one dimensional graph, these correlations can be shaped to yield a complete set of compact quantum logic operations, helping push towards the realization of a general purpose quantum computer. Expand
A quantum walk on the half line with a particular initial state
  • T. Machida
  • Physics, Mathematics
  • Quantum Inf. Process.
  • 2016
This paper tries to obtain a limit theorem for a quantum walk on the half line by the usage of the Fourier analysis, and Substituting a quantumwalk on the line for it will lead to a possibility that the Fouriers analysis is useful to compute a limit distribution of the quantumWalk on thehalf line. Expand
Floquet-engineered quantum walks
The walking mechanism based on its particle-wave duality is unveiled and tailoring quantum walks using the walking mechanism (Floquet oscillations) under designed time-dependent coins, to manipulate the desired state on demand, as in universal quantum computation primitives. Expand
A Review of Quantum Random Walks and their Algorithmic Applications
In this paper, we introduce the concept of random walks and the motivation behind them from a computer scientist’s perspective. Then we dive into quantum random walks, and present the two mainExpand
Universal one-dimensional discrete-time quantum walks and their implementation on near term quantum hardware
Different forms of discrete-time quantum walks are presented and their equivalence for physical realizations are shown and addressed to address scalability to higher dimensions and larger quantum processors. Expand
Discrete-time quantum walk on circular graph: Simulations and effect of gate depth and errors
We investigate the counterparts of random walks in universal quantum computing and their implementation using standard quantum circuits. Quantum walks have been recently well investigated forExpand
Generalized teleportation by quantum walks
This work develops a generalized teleportation scheme based on quantum walks with two coins, which is the first scheme of realizing communicating protocol with quantum walks, thus opening wider applications. Expand
Quantum walks as mathematical foundation for quantum gates
  • D. Solenov
  • Computer Science, Physics
  • Quantum Inf. Comput.
  • 2020
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving theExpand
Quantum Walk in Terms of Quantum Bernoulli Noise and Quantum Central Limit Theorem for Quantum Bernoulli Noise
As a unitary quantum walk with infinitely many internal degrees of freedom, the quantum walk in terms of quantum Bernoulli noise (recently introduced by Wang and Ye) shows a rather classicalExpand
One-dimensional discrete-time quantum walks with general coin
Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp theExpand


Discrete quantum walks and quantum image processing
This thesis proposes methods for storing and retrieving images using non-entangled and entangled qubits, and studies a case in which 4 different values are randomly stored in a single qubit, and shows that quantum mechanical properties can, in certain cases, allow better reproduction of original stored values compared with classical methods. Expand
Quantum Walks for Computer Scientists
The purpose of this lecture is to provide a concise yet comprehensive introduction to quantum walks, an emerging field of quantum computation, is a generalization of random walks into the quantum mechanical world. Expand
Quantum walks, quantum gates, and quantum computers
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of theExpand
On the Relationship Between Continuous- and Discrete-Time Quantum Walk
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantumExpand
A random walk approach to quantum algorithms
  • V. Kendon
  • Mathematics, Physics
  • Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2006
Surprisingly, the effect of making the walk slightly less than perfectly quantum can optimize the properties of the quantum walk for algorithmic applications, which forms the basis of a quantum speed up, which can be exploited to solve problems faster. Expand
Universal quantum computation using the discrete-time quantum walk
A proof that continuous-time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by A. M. Childs [Phys. Rev. Lett. 102, 180501Expand
Quantum Stochastic Walks: A Generalization of Classical Random Walks and Quantum Walks
We introduce the quantum stochastic walk (QSW), which determines the evolution of a generalized quantum-mechanical walk on a graph that obeys a quantum stochastic equation of motion. Using anExpand
Exploring topological phases with quantum walks
The quantum walk was originally proposed as a quantum-mechanical analog of the classical random walk, and has since become a powerful tool in quantum information science. In this paper, we show thatExpand
Relationship between quantum walks and relativistic quantum mechanics
Quantum walk models have been used as an algorithmic tool for quantum computation and to describe various physical processes. This article revisits the relationship between relativistic quantumExpand
Coined quantum walks on percolation graphs
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.Expand