# Faster quantum mixing for slowly evolving sequences of Markov chains

4 Mar 2015

Markov chain methods are remarkably successful in computational physics, machine learning, and combinatorial optimization. The cost of such methods often reduces to the mixing time, i.e., the time required to reach the steady state of the Markov chain, which scales as $\delta^{-1}$, the inverse of the spectral gap... (read more)

PDF Abstract

# Code Add Remove Mark official

No code implementations yet. Submit your code now