Understanding Quantum Computing Through Drunken Walks

Abstract

AbstractQuantum random walks have caught the attention of quantum information theorists in recent years. Classical walks have been used to solve or design several highly efficient randomized algorithms, and they are also used in many quantum algorithms, but quantum walks provide an exponential speedup over classical walks since they can solve some oracle problems. For several practical problems, such as the element distinctness problem, the triangle finding problem, and evaluating NAND trees, quantum walks provide polynomial speedups over classical algorithms. In this paper, we propose a new quantum random walk representation based on the drunken walk and the classical random walk. This current portrayal would make it easier for people to comprehend the potential of quantum computing. It will also be shown how to solve a large deviation analysis through quantum walks. This paper includes an explanation of how an inebriated person might locate his friend in a bar after leaving the restroom, as well as a comparison of quantum walks and classical walks.KeywordsQuantum computingQuantum walkRandom walkClassical walkQASM