Operator-Level Quantum Acceleration of Non-Logconcave Sampling
Not on the map. Why?
Abstract (arXiv)
Sampling from probability distributions of the form σ propto e-β V, where V is a continuous potential, is a fundamental task across physics, chemistry, biology, computer science, and statistics. However, when V is non-convex, the resulting distribution becomes non-logconcave, and classical methods such as Langevin dynamics often exhibit poor performance. We introduce the first quantum algorithm that provably accelerates a broad class of continuous-time sampling dynamics. For Langevin dynamics, our method encodes the target Gibbs measure into the amplitudes of a quantum state, identified as the kernel of a block matrix derived from a factorization of the Witten Laplacian operator. This connection enables Gibbs sampling via singular value thresholding and yields up to a quartic quantum speedup over best-known classical Langevin-based methods in the non-logconcave setting. Building on this framework, we further develop the first quantum algorithm that accelerates replica exchange Langevin diffusion, a widely used method for sampling from complex, rugged energy landscapes.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 36 of its 119 references that are in the map. First posted on arXiv 8 May 2025.
Builds on
36 of 119 references.
References · 36
- 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 243
- 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 227
- 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 208
- 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 197
- 2016High-dimensional Bayesian inference via the Unadjusted Langevin Algorithmcited by 146
- 2018Analysis of Langevin Monte Carlo via convex optimizationcited by 127
- 2018Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problemcited by 123
- 2018Log-concave sampling: Metropolis-Hastings algorithms are fastcited by 118
- 2020Structured Logconcave Sampling with a Restricted Gaussian Oraclecited by 86
- 2019The Randomized Midpoint Method for Log-Concave Samplingcited by 78
- 2022Improved analysis for a proximal algorithm for samplingcited by 73
- 2018Sharp convergence rates for Langevin dynamics in the nonconvex settingcited by 68
24 more
- 2020Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithmcited by 57
- 2019Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradientscited by 51
- 2023Faster high-accuracy log-concave sampling via algorithmic warm startscited by 45
- 2021Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Samplingcited by 44
- 2020Faster Convergence of Stochastic Gradient Langevin Dynamics for Non-Log-Concave Samplingcited by 32
- 2020Logsmooth Gradient Concentration and Tighter Runtimes for Metropolized Hamiltonian Monte Carlocited by 22
- 2016Auxiliary gradient-based sampling algorithmscited by 21
- 2020Accelerating Nonconvex Learning via Replica Exchange Langevin Diffusioncited by 16
- 2023When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?cited by 15
- 2022Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constantscited by 8
- 2023Quantum Hamiltonian Descentcited by 7
- 2023Quantum Langevin Dynamics for Optimizationcited by 7
- 2020Efficient phase-factor evaluation in quantum signal processingcited by 6
- 2019Statistical Estimation of the Poincar'e constant and Application to Sampling Multimodal Distributionscited by 5
- 2023A CS guide to the quantum singular value transformationcited by 4
- 2023Improved Bound for Mixing Time of Parallel Temperingcited by 4
- 2023Stochastic Quantum Sampling for Non-Logconcave Distributions and Estimating Partition Functionscited by 4
- 2023A quantum central path algorithm for linear optimizationcited by 3
- 2022Gibbs Sampling of Continuous Potentials on a Quantum Computercited by 2
- 2025Quantum Hamiltonian Descent for Non-smooth Optimizationcited by 2
- 2025Quantum Speedups for Sampling and Non-convex Optimization with Stochastic Oraclescited by 2
- 2025(Sub)Exponential Quantum Speedup for Optimizationcited by 2
- 2022Using Witten Laplacians to locate index-1 saddle pointscited by 1
- 2024Quantum generalizations of Glauber and Metropolis dynamicscited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.