How fast do quantum walks mix?

01/14/2020
by   Shantanav Chakraborty, et al.
0

The fundamental problem of sampling from the limiting distribution of quantum walks on networks, known as mixing, finds widespread applications in several areas of quantum information and computation. Of particular interest in most of these applications, is the minimum time beyond which the instantaneous probability distribution of the quantum walk remains close to this limiting distribution, known as the quantum mixing time. However this quantity is only known for a handful of specific networks. In this letter, we prove an upper bound on the quantum mixing time for almost all networks, i.e.the fraction of networks for which our bound holds, goes to one in the asymptotic limit. To this end, using several results in random matrix theory, we find the quantum mixing time of Erdös-Renyi random networks: networks of n nodes where each edge exists with probability p independently. For example for dense random networks, where p is a constant, we show that the quantum mixing time is O(n^3/2 + o(1)). Besides opening avenues for the analytical study of quantum dynamics on random networks, our work could find applications beyond quantum information processing. Owing to the universality of Wigner random matrices, our results on the spectral properties of random graphs hold for general classes of random matrices that are ubiquitous in several areas of physics. In particular, our results could lead to novel insights into the equilibration times of isolated quantum systems defined by random Hamiltonians, a foundational problem in quantum statistical mechanics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2019

On analog quantum algorithms for the mixing of Markov chains

The problem of sampling from the stationary distribution of a Markov cha...
research
09/26/2022

How to Sample From The Limiting Distribution of a Continuous-Time Quantum Walk

We introduce ε-projectors, using which we can sample from limiting distr...
research
08/29/2021

Well-mixing vertices and almost expanders

We study regular graphs in which the random walks starting from a positi...
research
08/29/2022

Multidimensional Quantum Walks, with Application to k-Distinctness

While the quantum query complexity of k-distinctness is known to be O(n^...
research
11/16/2020

Multiple Random Walks on Graphs: Mixing Few to Cover Many

Random walks on graphs are an essential primitive for many randomised al...
research
10/18/2022

On Hitting Times for General Quantum Markov Processes

Random walks (or Markov chains) are models extensively used in theoretic...
research
05/26/2020

Entanglement formation in continuous-variable random quantum networks

Entanglement is not only important for understanding the fundamental pro...

Please sign up or login with your details

Forgot password? Click here to reset