DeepAI AI Chat
Log In Sign Up

Enabling Quantum Speedup of Markov Chains using a Multi-level Approach

by   Xiantao Li, et al.
Penn State University

Quantum speedup for mixing a Markov chain can be achieved based on the construction of slowly-varying r Markov chains where the initial chain can be easily prepared and the spectral gaps have uniform lower bound. The overall complexity is proportional to r. We present a multi-level approach to construct such a sequence of r Markov chains by varying a resolution parameter h. We show that the density function of a low-resolution Markov chain can be used to warm start the Markov chain with high resolution. We prove that in terms of the chain length the new algorithm has O(1) complexity rather than O(r).


page 1

page 2

page 3

page 4


Sequential quantum mixing for slowly evolving sequences of Markov chains

In this work we consider the problem of preparation of the stationary di...

Iterated Decomposition of Biased Permutations Via New Bounds on the Spectral Gap of Markov Chains

The spectral gap of a Markov chain can be bounded by the spectral gaps o...

Markov Chain Models of Refugee Migration Data

The application of Markov chains to modelling refugee crises is explored...

Stick-breaking processes, clumping, and Markov chain occupation laws

We consider the connections among `clumped' residual allocation models (...

Circularly-Coupled Markov Chain Sampling

I show how to run an N-time-step Markov chain simulation in a circular f...

Correlation decay for hard spheres via Markov chains

We improve upon all known lower bounds on the critical fugacity and crit...