期刊
出版社
ROYAL SOC
DOI: 10.1098/rspa.2015.0301
关键词
Monte Carlo methods; quantum algorithms; partition functions
资金
- UK EPSRC [EP/L021005/1]
- Engineering and Physical Sciences Research Council [EP/L021005/1] Funding Source: researchfish
- EPSRC [EP/L021005/1] Funding Source: UKRI
Monte Carlo methods use random sampling to estimate numerical quantities which are hard to compute deterministically. One important example is the use in statistical physics of rapidly mixing Markov chains to approximately compute partition functions. In this work, we describe a quantum algorithm which can accelerate Monte Carlo methods in a very general setting. The algorithm estimates the expected output value of an arbitrary randomized or quantum subroutine with bounded variance, achieving a near-quadratic speedup over the best possible classical algorithm. Combining the algorithm with the use of quantum walks gives a quantum speedup of the fastest known classical algorithms with rigorous performance bounds for computing partition functions, which use multiple-stage Markov chain Monte Carlo techniques. The quantum algorithm can also be used to estimate the total variation distance between probability distributions efficiently.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据