cs.LGNov 6, 2026

Fast Accurate Quantum Monte Carlo without Metropolis Adjustment

Authors: Reuben Cohn-Gordon, Gabriel Pescia, Sumner N. Hearth, Jakob Robnik, Uroš Seljak, Peter Lunts

Organizations: UC Berkeley · Episteme · Los Alamos National Laboratory · Institute for Advanced Study

Abstract

In quantum systems, physical quantities of interest can be expressed as expectation values of a probability distribution, which allows their estimation by Markov Chain Monte Carlo (MCMC) methods. This approach, an instance of Quantum Monte Carlo (QMC), plays a central role in obtaining predictions of system properties relevant to condensed matter and high energy physics. The use of Hamiltonian dynamics to design a Markov kernel, known as Hybrid or Hamiltonian Monte Carlo (HMC), is widespread in quantum applications. In this context, it is standard to use an HMC kernel that is ``adjusted'' with the Metropolis-Hastings (MH) criterion, so that estimates of expectations converge to their true value in the limit of infinite sample size. However, recent work in computational statistics suggests that an unadjusted HMC kernel can be significantly more efficient, while safely maintaining an asymptotic bias which is small relative to the error arising from the variance of the finite sample size. We adapt this approach to the QMC setting, focusing on a challenging and high-dimensional spin-fermion model of a quantum phase transition. We find that unadjusted methods outperform adjusted HMC in terms of effective sample size per gradient call, while retaining accurate results.

Figures & tables

Appendix figures & tables7 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Feb 24, 2026

Counterdiabatic Hamiltonian Monte Carlo

Hamiltonian Monte Carlo (HMC) is a state of the art method for sampling from distributions with differentiable densities, but can converge slowly when applied to challenging multimodal problems. Running HMC with a time varying Hamiltonian, in order to interpolate from an initial tractable distribution to the target of interest, can address this problem. In conjunction with a weighting scheme to eliminate bias, this can be viewed as a special case of Sequential Monte Carlo (SMC) sampling \cite{doucet2001introduction}. However, this approach can be inefficient, since it requires slow change between the initial and final distribution. Inspired by \cite{sels2017minimizing}, where a learned counterdiabatic term added to the Hamiltonian allows for efficient quantum state preparation, we propose Counterdiabatic Hamiltonian Monte Carlo (CHMC), which can be viewed as an SMC sampler with a more efficient kernel. We establish its relationship to recent proposals for accelerating gradient-based sampling with learned drift terms, and demonstrate on simple benchmark problems.
Jul 10, 2026

An End-to-End Hybrid Quantum--Classical Sampling Workflow for Discrete Markov Random Fields: A Reproducible Case Study

Sampling from discrete Markov random fields (MRFs) is a hard problem. We study amplitude-encoded i.i.d. sampling for small MRFs where 2n2^n target probabilities are precomputed classically. This removes quantum exponential speedup but allows a clean comparison against classical MCMC based on independent circuit samples (τ≈1τ\approx 1). Across 60 instances spanning five graph families (1k-step burn-in, 3k retained samples), the mean ESS ratios of Quantum to Single-Site Gibbs, Block Gibbs, Tuned-Block, and Parallel Tempering are 16.3516.35, 7.297.29, 1.821.82, and 1.791.79, showing modern classical samplers substantially close this gap. Amortizing O(2n)O(2^n) preprocessing into wall-clock time, exact inverse-CDF sampling yields 17.7M17.7\text{M} ESS/s versus 488K488\text{K} ESS/s for the quantum sampler (36×36\times mean rate, 153×153\times per-instance), confirming no wall-clock advantage. We characterize MCMC autocorrelation costs and benchmark amplitude-encoded state preparation at n∈{8,10,12}n \in \{8,10,12\}. An MPS scaling study (n≤40n \le 40) shows bond dimension χ=32χ=32 achieves F=0.721±0.059F=0.721\pm0.059 at n=40n=40. Finally, a matched-budget VQC vs. MPS comparison at n∈{8,10,12}n \in \{8,10,12\} shows VQC fidelities fall far below MPS: (FVQC,FMPS)=(0.31,0.99),(0.21,0.96),(0.17,0.88)(F_{\mathrm{VQC}}, F_{\mathrm{MPS}}) = (0.31, 0.99), (0.21, 0.96), (0.17, 0.88) at compressions 10.7×10.7\times, 34.1×34.1\times, and 113.8×113.8\times.
Jul 16, 2026

Delocalization of bias in unadjusted Hamiltonian Monte Carlo and underdamped Langevin

Unadjusted samplers such as unadjusted Hamiltonian Monte Carlo and underdamped Langevin are well-known to be biased. Metropolis--Hastings adjustment has been conventionally incorporated into Hamiltonian Monte Carlo to eliminate the bias. However, this adjustment can significantly increase the iteration complexity due to the small step size required for reasonable Metropolis acceptance rates. In this work, we extend the delocalization of bias phenomenon, previously established for the overdamped Langevin algorithm, to these two unadjusted algorithms. We show that to control the W2W_2 bias of any KK-dimensional marginal of a high-dimensional distribution, O(K)O(\sqrt{K}) integration steps suffice up to log⁡d\log d terms, assuming either weak or sparse interactions among variables. The discrete-time integrators here introduce technical difficulties beyond those of the overdamped setting, which we address through a broadly applicable matrix-polynomial framework that characterizes their propagators. Our result for the underdamped Langevin algorithm is valid for all large friction parameters, implying that the Leimkuhler-Matthews integrator for the overdamped Langevin dynamics also exhibits delocalization of bias.