Analog quantum algorithms for the mixing of Markov chains
Analog quantum algorithms for the mixing of Markov chains
The problem of sampling from the stationary distribution of a Markov chain finds widespread applications in a variety of fields. The time required for a Markov chain to converge to its stationary distribution is known as the classical mixing time. In this article, we deal with analog quantum algorithms for …