论文标题
Wang-Landau抽样的量子算法
Quantum algorithm for Wang-Landau sampling
论文作者
论文摘要
已经表明，可以在避免标志问题的方式上在量子计算机上实现大都市算法。但是，平坦的直方图技术通常是首选的，因为它们不会遭受相同的限制，而遭受了现实世界中利益问题的困扰并提供了许多其他好处。特别是，Wang-Landau方法以其效率和准确性而闻名。在这项工作中，我们设计，实施和验证了用于Wang-landau采样的量子算法，从而大大扩展了量子范围的许多人体问题，可通过蒙特卡洛模拟解决。
It has been shown that the Metropolis algorithm can be implemented on quantum computers in a way that avoids the sign problem. However, flat histogram techniques are often preferred as they don't suffer from the same limitations that afflict Metropolis for problems of real-world interest and provide a host of other benefits. In particular, the Wang-Landau method is known for its efficiency and accuracy. In this work we design, implement, and validate a quantum algorithm for Wang-Landau sampling, greatly expanding the range of quantum many body problems solvable by Monte Carlo simulation.
