arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.05511quant-phcs.DS
收藏

特殊分布马氏链的量子混合

Quantum mixing of Markov chains for special distributions

Vedran Dunjko, Hans J. Briegel

摘要:

不可约的,时间可逆的马尔可夫链的平稳分布的准备是一个基本的积木在许多启发式方法,算法困难的问题。已经证实,经典混合过程的量子类似物可以在实现这种平稳分布时提供通用的二次加速。这样的加速也意味着一个广泛的启发式算法家族的加速。然而,一个真正的二次加速到目前为止只证明了特殊类的马尔可夫链。这些结果通常预先假定马尔可夫链的基础图的规则结构,以及转移概率的规则性。在这项工作中,我们证明了一个真正的二次加速一类马尔可夫链的限制只是在形式上的平稳分布,而不是直接在马尔可夫链结构本身。特别是,我们可以实现有效的混合时,它是事先已知的分布是单调递减的状态空间上的一个已知的顺序。在此之后,我们表明,我们的方法扩展到更广泛的一类分布,其中只有一小部分的分布的形状是已知的单调。我们的方法是建立在Szegedy型量子化的过渡算子。

英文摘要:

The preparation of the stationary distribution of irreducible, time-reversible Markov chains is a fundamental building block in many heuristic approaches to algorithmically hard problems. It has been conjectured that quantum analogs of classical mixing processes may offer a generic quadratic speed-up in realizing such stationary distributions. Such a speed-up would also imply a speed-up of a broad family of heuristic algorithms. However, a true quadratic speed up has thus far only been demonstrated for special classes of Markov chains. These results often presuppose a regular structure of the underlying graph of the Markov chain, and also a regularity in the transition probabilities. In this work, we demonstrate a true quadratic speed-up for a class of Markov chains where the restriction is only on the form of the stationary distribution, rather than directly on the Markov chain structure itself. In particular, we show efficient mixing can be achieved when it is beforehand known that the distribution is monotonically decreasing relative to a known order on the state space. Following this, we show that our approach extends to a wider class of distributions, where only a fraction of the shape of the distribution is known to be monotonic. Our approach is built on the Szegedy-type quantization of transition operators.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑