2018/03/22 by Mahesh N. Jayakody, Jayakody, Mahesh N., Asiri Nanayakkara +1
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Bounded function #Computation #Computer science #Curse of dimensionality #Dimension (graph theory) #FOS: Physical sciences #Mathematical analysis #Mathematics #Physics #Pure mathematics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum algorithm #Quantum computer #Quantum mechanics #Quantum walk #Quantum-Dot Cellular Automata #Random walk #Space (punctuation) #Statistical physics #Statistics #quant-ph
paper · pdf · doi:10.48550/arxiv.1803.08258
published in arXiv (Cornell University) (Cornell University)
arxiv created 2018/03/22 · openalex publication_date 2018/03/22 · arxiv updated 2018/03/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
In this study we show a way of achieving the reverse evolution of n-dimensional quantum walks by introducing interventions on the coin degree of freedom during the forward progression of the coin-walker system. Only a single intervention is required to reverse a quantum walker on a line to its initial positon and the number of interventions increases with the dimensionality of the walk. We present an analytical treatment to prove these results. This reversion scheme can be used to generate periodic bounded quantum walks and to control the locations where particle can be found with highest probability. From the point of view of quantum computations and simulations, this scheme could be useful in resetting quantum operations and implementing certain quantum gates.