Fetching the paper…
Reading the bibliography…
We present quantum algorithms for sampling from non-logconcave probability distributions in the form of $\pi(x) \propto \exp(-\beta f(x))$.
Quantum algorithm for estimating volumes of convex bodies
Shouvanik Chakrabarti, Andrew M. Childs, Shih-Han Hung, Tongyang Li, Chunhao Wang, and Xiaodi Wu · 1908
Earlier work this paper cites.
A Lower Bound for the Smallest Eigenvalue of the Laplacian
Jeff Cheeger · 1971
Earlier work this paper cites.
Introduction to modern statistical
David Chandler · 1987
Earlier work this paper cites.
Generalization of an inequality by talagrand and links with the logarithmic sobolev inequality
F. Otto and C. Villani · 2000
Earlier work this paper cites.
Adiabatic quantum state generation and statistical zero knowledge
Dorit Aharonov and Amnon Ta-Shma · 2003
Earlier work this paper cites.
Modified logarithmic sobolev inequalities for some models of random walk
Sharad Goel · 2004
Earlier work this paper cites.
Quantum speed-up of markov chain based algorithms
M. Szegedy · 2004
Earlier work this paper cites.
Fixed-point quantum search
Lov K. Grover · 2005
Earlier work this paper cites.
Quantum speedup of classical mixing processes
Peter C. Richter · 2007
Earlier work this paper cites.
Geometric random walks: a survey
Santosh Vempala · 2007
Earlier work this paper cites.
Speedup via quantum sampling
Pawel Wocjan and Anura Abeyesinghe · 2008
Earlier work this paper cites.
Quantum algorithm for approximating partition functions
Pawel Wocjan, Chen-Fu Chiang, Daniel Nagaj, and Anura Abeyesinghe · 2009
Cited alongside, same era.
Search via quantum walk
Fré déric Magniez, Ashwin Nayak, Jérémie Roland, and Miklos Santha · 2011
Cited alongside, same era.
Mcmc using hamiltonian dynamics
Radford M Neal et al · 2011
Cited alongside, same era.
Bayesian posterior sampling via stochastic gradient fisher scoring
Sungjin Ahn, Anoop Korattikara, and Max Welling · 2012
Cited alongside, same era.
Quantum speedup of Monte Carlo methods
Ashley Montanaro · 2015
Cited alongside, same era.
Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
Alain Durmus and Éric Moulines · 2017
Cited alongside, same era.
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe · 2019
Later among the works it cites.
Sampling can be faster than optimization
Yi-An Ma, Yuansi Chen, Chi Jin, Nicolas Flammarion, and Michael I Jordan · 2019
Later among the works it cites.
Rapid convergence of the unadjusted langevin algorithm: Isoperimetry suffices
Santosh Vempala and Andre Wibisono · 2019
Later among the works it cites.
Estimating normalizing constants for log-concave distributions: Algorithms and lower bounds
Rong Ge, Holden Lee, and Jianfeng Lu · 2020
Later among the works it cites.
Adaptive quantum simulated annealing for Bayesian inference and estimating partition functions
Aram W. Harrow and Annie Y. Wei · 2020
Later among the works it cites.
Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Non-convex learning via stochastic gradient langevin dynamics: a nonasymptotic analysis
Maxim Raginsky, Alexander Rakhlin, and Matus Telgarsky · 2017
Cited alongside, same era.
A hitting time analysis of stochastic gradient Langevin dynamics
Yuchen Zhang, Percy Liang, and Moses Charikar · 2017
Cited alongside, same era.
Underdamped Langevin MCMC: A non-asymptotic analysis
Xiang Cheng, Niladri S. Chatterji, Peter L. Bartlett, and Michael I. Jordan · 2018
Cited alongside, same era.
Lectures on Convex Optimization
Y. Nesterov · 2018
Cited alongside, same era.
Srinivasan Arunachalam, Vojtech Havlicek, Giacomo Nannicini, Kristan Temme, and Pawel Wocjan · 2021
Later among the works it cites.
Faster convergence of stochastic gradient Langevin dynamics for non-log-concave sampling
Difan Zou, Pan Xu, and Quanquan Gu · 2021
Later among the works it cites.
Quantum algorithms for sampling log-concave distributions and estimating normalizing constants, 2022
Andrew M. Childs, Tongyang Li, Jin-Peng Liu, Chunhao Wang, and Ruizhe Zhang · 2022
Later among the works it cites.
Probabilistic machine learning: an introduction
Kevin P Murphy · 2022
Later among the works it cites.
A sublinear-time quantum algorithm for approximating partition functions
Arjan Cornelissen and Yassine Hamoudi · 2023
Closest in time.