YoVDO

A Quantum Computing Algorithm to Speed Up Metropolis Sampling

Offered By: Cambridge Materials via YouTube

Tags

Quantum Computing Courses Statistical Mechanics Courses Computational Physics Courses Numerical Simulations Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a cutting-edge quantum computing algorithm designed to accelerate Metropolis sampling in this 24-minute Lennard-Jones Centre discussion group seminar by Prof. Guglielmo Mazzola from the University of Zurich. Delve into the central problem of sampling from multidimensional finite-temperature classical Boltzmann probability distributions in numerical simulations across physics, chemistry, and beyond. Discover how this innovative algorithm, executable on quantum computers, offers a scaling advantage over state-of-the-art Metropolis schemes. Learn how the uncorrelated collapses of a wave function can be leveraged as trial updates, resulting in non-local yet effective moves in the configuration space. Trace the algorithm's development from its 2021 inception for continuous systems to its adaptation for spin systems suitable for hardware implementation. Gain insights into its experimental demonstration and explore further reading materials, including references to published articles. This seminar, held on May 15, 2023, provides a comprehensive overview of a groundbreaking approach to quantum-enhanced sampling techniques.

Syllabus

A quantum computing algorithm to speed up Metropolis sampling


Taught by

Cambridge Materials

Related Courses

Tsunamis and Storm Surges: Introduction to Coastal Disasters
Waseda University via edX
Introduction to Dynamical Models in Biology
Indian Institute of Technology Guwahati via Swayam
Spacecraft Dynamics Capstone: Mars Mission
University of Colorado Boulder via Coursera
Mathematical Modeling of Manufacturing Processes
Indian Institute of Technology Guwahati via Swayam
Computational Science in Engineering
Indian Institute of Technology Kanpur via Swayam