Mixing Times in Quantum Walks on the Hypercube
F.L. Marquezino, R. Portugal, G. Abal, R. Donangelo

TL;DR
This paper analyzes the mixing times of discrete-time quantum walks on the hypercube, showing they reach a specific distribution faster than classical walks and that decoherence can optimize uniform mixing.
Contribution
It provides an explicit expression for the stationary distribution of quantum walks on the hypercube and investigates how decoherence influences mixing times.
Findings
Quantum walks mix to a non-uniform distribution in O(n) time.
Decoherence at a critical rate minimizes mixing time to uniform distribution.
Controlled decoherence can optimize and preserve uniformity in quantum walks.
Abstract
The mixing time of a discrete-time quantum walk on the hypercube is considered. The mean probability distribution of a Markov chain on a hypercube is known to mix to a uniform distribution in time O(n log n). We show that the mean probability distribution of a discrete-time quantum walk on a hypercube mixes to a (generally non-uniform) distribution pi(x) in time O(n) and the stationary distribution is determined by the initial state of the walk. An explicit expression for pi(x) is derived for the particular case of a symmetric walk. These results are consistent with those obtained previously for a continuous-time quantum walk. The effect of decoherence due to randomly breaking links between connected sites in the hypercube is also considered. We find that the probability distribution mixes to the uniform distribution as expected. However, the mixing time has a minimum at a critical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
