Simons Institute Courses

Low-Overhead Fault Tolerance in Two Dimensions

Explore a fault-tolerance scheme achieving low space overhead using geometrically local circuits, addressing limitations in quantum coding theory and syndrome extraction.

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

What is Your Logical Qubit? Understanding Quantum Error Correction

Explore quantum error correction, logical qubits, and operations in this talk. Understand key differences and importance in recent experimental reports on quantum computing advancements.

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

Layer Codes - Advances in Quantum Coding Theory

Explore advanced quantum coding theory with a focus on layer codes, examining their structure and applications in quantum information processing.

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

Decoding Quantum Low Density Parity Check Codes

Explore quantum LDPC code decoders, focusing on belief propagation variants. Learn about challenges, performance improvements, and practical applications in quantum error correction.

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

Introduction to qLDPC Codes

Explore quantum low-density parity-check codes, their applications in quantum error correction, and recent advancements in the field of quantum coding theory.

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

High-Threshold and Low-Overhead Fault-Tolerant Quantum Memory

Explores a novel quantum error correction protocol with high encoding rate, achieving 0.8% error threshold. Demonstrates potential for efficient fault-tolerant quantum memory using fewer physical qubits.

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

Instance Optimal Iterative Methods for Matrix Function Approximation

Explores instance-optimality of Lanczos method for matrix function approximation, extending conjugate gradient analysis to rational and other function classes. Discusses recent progress and open questions.

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

Robust Learning of a Single Neuron via Sharpness

Explores cyclic block coordinate methods in optimization, presenting novel perspectives and improved algorithms that break long-standing computational barriers, with applications in statistical learning.

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

Tight Bounds for Active LP Regression and Beyond

Explore optimization techniques and algorithm design for active lp regression, focusing on tight bounds and their applications in various computational domains.

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

The Complexity of Dynamic Least-Squares Regression

Explores complexity of dynamic least-squares regression, proving sharp separations in update time and presenting lower bounds through gap-amplification reduction from Online Matrix Vector Conjecture.

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

Fast Algorithms for Regression Problems

Explore efficient algorithms for p-norm regression, overcoming challenges in large-scale data analysis and optimization with recent breakthroughs and generalizable techniques.

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

Recent Progress on Submodular Function Minimization

Explore recent advancements in submodular function minimization algorithms, leveraging convex optimization methods to address open questions and improve efficiency in discrete optimization.

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

Quotient Sparsification for Submodular Functions

Explores sparsification of matroids and submodular functions, unifying graph and hypergraph cut sparsifiers with applications to set systems and algorithmic efficiency.

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

Discrepancy Minimization via Regularization

Explore a novel algorithmic framework for discrepancy minimization, reinterpreting key breakthroughs and proving conjectures for pseudorandom instances through regularization techniques.

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

Breaking the Quadratic Gap for Strongly Polynomial Solvers to Combinatorial Linear Programs

Explore advanced optimization techniques for combinatorial linear programs, focusing on breaking the quadratic gap in strongly polynomial solvers using interior-point methods.

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