Classical random walk with memory versus quantum walk on a one-dimensional infinite chain

Publication date: Available online 3 May 2019Source: Physics Letters AAuthor(s): Jingfeng Wu, Peng Xu, Xuanmin ZhuAbstractQuantum walk is a very useful tool for building quantum algorithms due to the faster spreading of probability distributions as compared to a classical random walk. Comparing the spreading of the probability distributions of a quantum walk with that of a mnemonic classical random walk on a one-dimensional infinite chain, we find that the classical random walk could have a faster spreading than that of the quantum walk conditioned on a finite number of walking steps. Quantum walk surpasses classical random walk with memory in spreading speed when the number of steps is large enough. However, in such a situation, quantum walk would seriously suffer from decoherence. Therefore, classical walk with memory may have some advantages in practical applications.

Source: Physics Letters A - May 4, 2019 Category: Physics Source Type: research