Simons Institute Courses

Validated Quantum Advantage via Bell Sampling

Explore Bell sampling as a new model for demonstrating quantum computational advantage, discussing its potential for efficient verification and robustness against noise in quantum circuits.

• YouTube
• 58 minutes
• Self-Paced
• Free Video

Verifiable Quantum Supremacy - What I Hope Will Be Done

Exploring quantum computations feasible on near-term devices, hard to simulate classically, and easy to verify. Discusses potential for demonstrating quantum superiority without relying on unproven assumptions.

• YouTube
• 1 hour 20 minutes
• Self-Paced
• Free Video

How Simulating Balls and Springs Captures the Power of Quantum Computing

Explore how simulating classical ball-spring systems relates to quantum computing power, offering insights into BQP-complete problems and new quantum algorithm design approaches.

• YouTube
• 1 hour 28 minutes
• Self-Paced
• Free Video

Quantum Algorithms for Approximating Partition Functions

Explore advanced quantum algorithms for approximating partition functions, focusing on computational techniques and applications in statistical physics and machine learning.

• YouTube
• 1 hour 6 minutes
• Self-Paced
• Free Video

Quantum Gibbs Sampling

Explore quantum algorithms for sampling quantum Gibbs states, a fundamental concept in quantum computing and statistical mechanics, with applications in computer science.

• YouTube
• 1 hour 26 minutes
• Self-Paced
• Free Video

Quantum Advantage with Shallow Clifford Circuits

Explore Clifford circuits' quantum advantage over classical counterparts, including constant-depth capabilities and open problems in this cutting-edge quantum computing research area.

• YouTube
• 1 hour 10 minutes
• Self-Paced
• Free Video

Dissipative State Preparation and the Dissipative Quantum Eigensolver

Explores a novel quantum algorithm for finding ground states of quantum systems, offering advantages like simplicity, monotonic convergence, and fault resilience in quantum computing applications.

• YouTube
• 1 hour 15 minutes
• Self-Paced
• Free Video

QMA and the Power of Positivity

Explore a powerful QMA variant with non-negative amplitudes, its relationship to NEXP and QMA, and implications for quantum complexity theory.

• YouTube
• 52 minutes
• Self-Paced
• Free Video

Quantum Summer Cluster Workshop - Anand Natarajan

Explore quantum computing advancements with MIT researcher Anand Natarajan in this Simons Institute workshop, delving into cutting-edge developments and future implications.

• YouTube
• 1 hour 6 minutes
• Self-Paced
• Free Video

Making the Leap to Quantum PCPs

Explore quantum error-correcting codes, robust entanglement, and the quantum PCP conjecture. Gain insights into challenges in quantum complexity theory with an intuition-focused approach.

• YouTube
• 50 minutes
• Self-Paced
• Free Video

Random Restrictions and Fourier Concentration - Part 2

Explore advanced concepts in Fourier analysis and random restrictions, focusing on their applications in theoretical computer science and mathematical analysis.

• YouTube
• 56 minutes
• Self-Paced
• Free Video

Random Restrictions and Fourier Concentration - Part 1

Explore random restrictions and Fourier concentration in analysis and theoretical computer science with MIT researcher Esty Kelman.

• YouTube
• 1 hour
• Self-Paced
• Free Video

Introduction to Analysis of Boolean Functions

Explore advanced concepts in Boolean function analysis, including Fourier analysis and applications in theoretical computer science.

• YouTube
• 1 hour 2 minutes
• Self-Paced
• Free Video

Introduction to Analysis of Boolean Functions

Explore foundational concepts in Boolean function analysis, including Fourier analysis and hypercontractivity, with applications in theoretical computer science.

• YouTube
• 1 hour
• Self-Paced
• Free Video

Dynamic Matching - Rounding & Sparsification and New Tools

Explore dynamic matching algorithms, focusing on rounding and sparsification techniques. Learn about new algorithmic primitives for fast static algorithms and their applications in dynamic graph theory.

• YouTube
• 49 minutes
• Self-Paced
• Free Video