Review on Quantum Walk Algorithm
Wenda Zhou
Abstract
Abstract Quantum walk is the quantum version of classical random walk, which has shown great advantage over classical algorithms. In this article, main discoveries and breakthroughs along with several applications in the last two decades are reviewed and discussed. Reducing hitting time and diminishing mixing time, as two hot research fields, are addressed. Possibility of universal computation with more generic case of quantum walk is also mentioned. In the future, we can expect new methods and models being feasible ways to approach the theoretical lower bounds of related problems, as well as more efficient applications on specific scene.
Topics & Concepts
Quantum walkRandom walkComputer scienceMixing (physics)QuantumComputationQuantum computerQuantum algorithmAlgorithmTheoretical computer scienceStatistical physicsMathematicsPhysicsQuantum mechanicsStatisticsQuantum Computing Algorithms and ArchitectureCloud Computing and Resource ManagementQuantum Information and Cryptography