Title: Limiting behavior of decoherent quantum walks.
In quantum computing, it has been proved that in some cases, a quantum algorithm is faster than its classical counterpart,
e.g. Shor's algorithm of factorization is an exponential speed-up, and Grover's search algorithm is a square speed-up over the classical algorithms. One of the most important problems in this area is to understand the effect of decoherence during the computational processes.
In this talk, Professor Yang will focus on the problems of decoherence of quantum walks and quantum computing.
In particular, he will speak on the following results.
1. The decoherence equation.
2. The scaling limit of a decoherent quantum random walk on 1-dimensional lattice is Gaussian.
3. Ergodicity of finite-dimensional symmetric decoherent quantum walks.
