An example of the difference between quantum and classical random walks

Quantum random walks on congested lattices

We consider quantum random walks on congested lattices and contrast them to classical random walks. Congestion is modelled with lattices that contain static defects which reverse the walker's direction. We implement a dephasing process after each step which allows us to smoothly interpolate between classical and quantum random walkers as well as study the effect of dephasing on the quantum walk. Our key results show that a quantum walker escapes a finite boundary dramatically faster than a classical walker and that this advantage remains in the presence of heavily congested lattices. Also, we …

带陷阱的光子随机行走

Photonic random walks with traps

本文研究一维晶格中带陷阱的光子随机行走，发现经典随机行走中光子必然被陷阱摧毁，而量子随机行走中光子可永久存活，并利用可控退相干的合成网格晶格实现量子与经典随机行走之间的切换。

What is random about a quantum random walk?

We use simple deterministic dynamical systems as coins in studying quantum walks. These dynamical systems can be chosen to display, in the classical limit, a range of behaviors from the integrable to chaotic, or deterministically random. As an example of an integrable coin we study the Fourier walk that generalizes the Hadamard walk and show that the walker slows down with coin dimensionality, which controls the effective Planck constant. Introducing multi-Harper maps as deterministic models of random walks we study the effect of coin chaos on the quantum walk. We also demonstrate that breakin…

The spreading behavior of quantum walks induced by drifted random walks on some magnifier graph

In this paper, we consider the quantum walk on $\mathbb{Z}$ with attachment of one-length path periodically. This small modification to $\mathbb{Z}$ provides localization of the quantum walk. The eigenspace causing this localization is generated by finite length round trip paths. We find that the localization is due to the eigenvalues of an underlying random walk. Moreover we find that the transience of the underlying random walk provides a slow down of the pseudo velocity of the induced quantum walk and a different limit distribution from the Konno distribution.

Limit theorems and absorption problems for one-dimensional correlated random walks

There has recently been considerable interest in quantum walks in connection with quantum computing. The walk can be considered as a quantum version of the so-called correlated random walk. We clarify a strong structural similarity between both walks and study limit theorems and absorption problems for correlated random walks by our PQRS method, which was used in our analysis of quantum walks.