Quantum algorithm for exact Monte Carlo sampling

TL;DR

This paper presents a quantum algorithm leveraging Grover's search to perform exact Monte Carlo sampling, achieving polynomial speedup over classical methods for sampling equilibrium distributions in statistical mechanics.

Contribution

It introduces a quantum algorithm that combines Grover's search with exact Monte Carlo methods, providing a polynomial speedup for sampling equilibrium distributions.

Findings

Achieves polynomial speedup over classical sampling methods

Uses Grover's quantum search for exact sampling

Applicable to a wide range of classical statistical mechanics systems

Abstract

We build a quantum algorithm which uses the Grover quantum search procedure in order to sample the exact equilibrium distribution of a wide range of classical statistical mechanics systems. The algorithm is based on recently developed exact Monte Carlo sampling methods, and yields a polynomial gain compared to classical procedures.