Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Quantum Speedups of Continuous Sampling and Optimization Problems - IPAM at UCLA

Institute for Pure & Applied Mathematics (IPAM) via YouTube

Overview

Explore quantum algorithms for continuous sampling and optimization problems in this 55-minute lecture by Ruizhe Zhang from the Simons Institute for the Theory of Computing. Delve into quantum speedups for sampling from high-dimensional log-concave distributions and their applications in estimating normalizing constants. Examine the approximately convex optimization problem and its implications for robust optimization and nonconvex optimization. Discover a quantum algorithm that outperforms classical counterparts and its application to the quantum version of the zeroth-order stochastic convex bandit problem. Gain insights into the potential of quantum computing for solving fundamental computational challenges in statistics, machine learning, and physics.

Syllabus

Ruizhe Zhang - Quantum Speedups of Continuous Sampling and Optimization Problems - IPAM at UCLA

Taught by

Institute for Pure & Applied Mathematics (IPAM)

Reviews

Start your review of Quantum Speedups of Continuous Sampling and Optimization Problems - IPAM at UCLA

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.