AbstractSampling from a given distribution is a fundamental computational problem and has broad applications in statistics, machine learning, physics, etc. We systematically investigate the quantum speedup of Monte Carlo methods, quantum mean estimation, and fast-forwarding of reversible Markov chains. We develop quantum algorithms for sampling log-concave distributions (with density e^{-f(x)} ...
Time:2022.06.03,13:00-14:00Venue:BIMSA Room 1129B,Zoom: 844 6385 1365Speaker:Haoyu Sun (U. Texas, Austin)