Simons Institute Courses

Construction and Decoding of Short Codes

Explore advanced techniques for constructing and decoding short-length codes, including staircase matrix codes, ordered statistic decoding, and innovative algorithms for polar codes.

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

An Overview of Quantum Algorithms

Explore quantum algorithms' applications in cryptography, search, optimization, and quantum system simulation, covering both large-scale and near-term quantum computing approaches.

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

Using Chaos to Characterize a Programmable Analog Quantum Simulator

Explore chaos in analog quantum simulators, uncovering random behavior, estimating fidelity, and learning noise models for large-scale entangled states using Rydberg atom arrays.

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

High-fidelity and Fault-tolerant Teleportation of a Logical Qubit on a Trapped-ion Quantum Computer

Explore fault-tolerant quantum teleportation using trapped-ion technology, focusing on error correction codes, circuit designs, and real-time decoding for future large-scale quantum devices.

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

Emergence of Universal Randomness in Quantum Many-body Dynamics

Explore universal randomness in quantum dynamics, deep thermalization, and Hilbert-space ergodicity. Learn about applications in quantum information theory and experimental observations.

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

Evidence for the Utility of Quantum Computing Before Fault Tolerance

Explore noise mitigation in quantum computing, demonstrating reliable results from a 127-qubit processor and discussing the potential of pre-fault-tolerant quantum devices.

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

Fundamental Limits to Quantum Computation

Explores quantum computing's potential and limitations, discussing learnability, error mitigation, and non-unital noise impacts on near-term devices and fault-tolerant systems.

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

Hardware-Efficient Quantum Computing Using Qudits

Explore hardware-efficient quantum simulations using qudits, enabling complex gauge field computations and opening doors for near-term quantum devices.

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

Analog Quantum Machine Learning for Near-Term Hardware

Explore analog quantum machine learning's potential on current hardware for cognitive tasks, energy calculations, and quantum metrology enhancements using programmable quantum simulators.

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

Probing the Limits of Classical Computing with Arbitrarily Connected Quantum Circuits

Explore the computational gap between classical and quantum computers through random circuit sampling in highly connected geometries, focusing on limitations and potential improvements.

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

Continuous-Time Quantum Walks for MAX-CUT Optimization

Explore quantum walks for MAX-CUT optimization, linking Hamiltonians to thermalization. Discover novel insights into unitary dynamics for combinatorial problems using multi-stage walks and Floquet systems.

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

Learning Shallow Quantum Circuits and Quantum States in Polynomial Time

Efficient algorithms for learning shallow quantum circuits and states, extending to polylog depth. Key techniques involve reconstructing low-complexity quantum systems from local observables.

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

Quantum Constraint Satisfaction - Richard M. Karp Distinguished Lecture

Explore quantum Hamiltonian complexity, comparing it to classical constraint satisfaction. Learn about QMA-completeness, search-to-decision, dichotomy theorems, and coping with QMA-hardness in quantum applications.

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

Fault Tolerance with the ZX-Calculus and Fusion Complexes: Tools for QEC Development

Unifying frameworks for quantum error correction: ZX calculus and fusion complexes connect hardware-specific models to abstract fault tolerance, aiding QEC design for various qubit technologies.

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

Parameterized Inapproximability of the Minimum Distance Problem over All Fields

Explores inapproximability of Minimum Distance Problem for linear codes over finite fields, proving W[1]-hardness. Extends results to Shortest Vector Problem on integer lattices.

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