Efficient Quantum Monte Carlo through Cluster Expansions

The sign problem remains a major obstacle to extending the success of Monte Carlo methods to generic quantum many-body systems. A powerful alternative relies on cluster expansions, which provide convergent representations of free energies and related quantities, with applications ranging from tensor network contractions to quantum dynamics and circuits. Within their convergence regime, these expansions often yield deterministic polynomial-time algorithms. However, such methods require exhaustive enumeration of connected clusters, leading to a computational overhead of (N epsilon-1) O(Δ), where N is the system size, epsilon the desired precision, and Δ the interaction-graph degree. This becomes particularly severe in long-range systems, where Δ N, resulting in quasi-polynomial runtimes. Here, we introduce a Markov chain algorithm that samples cluster expansions directly in the space of connected clusters, replacing deterministic enumeration by Monte Carlo sampling. Because sampling occurs in an abstract cluster space rather than a physical configuration space, the conventional exponential sign problem is absent within the convergence regime. For general polymer models, we establish an FPRAS with runtime (N 4 epsilon-3). For quantum partition functions at temperatures β at mostβ sampling O(1), this improves to (N 3+1/D epsilon-3), where D is the lattice dimension. The framework directly applies to long-range quantum systems with interactions proportional to1/r α, including 2-local models with α>2D.