Quantum Complexity Theory Courses and Certifications

IEEE

QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge

Explore QMA-hardness of local density matrix consistency and its implications for quantum zero-knowledge proofs in this advanced quantum computing talk.

• YouTube
• 26 minutes
• On-Demand
• Free Video

Simons Institute

Panel on Quantum Machine Learning and Barren Plateaus

Expert panel explores quantum machine learning challenges, focusing on barren plateaus and their implications for algorithm design and practical quantum computing applications.

• YouTube
• 49 minutes
• On-Demand
• Free Video

Simons Institute

Summer Cluster in Quantum Computation - Polylogues

Explore key themes in quantum computation with experts discussing complexity theory, protocols, entanglement, algorithms, and quantum chemistry in this insightful panel discussion.

• YouTube
• 32 minutes
• On-Demand
• Free Video

Simons Institute

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
• On-Demand
• Free Video

Simons Institute

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
• On-Demand
• Free Video

Simons Institute

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
• On-Demand
• Free Video

Simons Institute

The Quantum Games PCP - Results and Confessions

Explore quantum complexity theory, focusing on the quantum PCP conjecture and its relation to interactive proof systems. Learn about recent developments and challenges in this cutting-edge field.

• YouTube
• 48 minutes
• On-Demand
• Free Video

Simons Institute

NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes

Explores breakthroughs in complexity theory using low-rate quantum LDPC codes, improving NLTS Hamiltonians and Sum-of-Squares hierarchy lower bounds with novel code construction techniques.

• YouTube
• 44 minutes
• On-Demand
• Free Video

Simons Institute

Oracle Separations Between QMA and QCMA

Explores recent non-standard oracle separations between QMA and QCMA, discussing connections to sparse Hamiltonians and potential paths towards standard oracle separation.

• YouTube
• 47 minutes
• On-Demand
• Free Video

Simons Institute

Quantum Complexity of Clique Homology

Explore the quantum mechanical structure in topology, connecting complexity theory to QMA hardness and examining implications for quantum algorithms and PCPs.

• YouTube
• 44 minutes
• On-Demand
• Free Video

Simons Institute

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
• On-Demand
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Making the Leap to Quantum PCPs - IPAM at UCLA

Explore quantum PCPs, NLTS conjecture, and quantum error-correcting codes. Discover connections to quantum complexity theory and future research directions in this intuition-focused talk.

• YouTube
• 50 minutes
• On-Demand
• Free Video

IEEE

Quantum Computing Advancements - Session 5A, Part 2

Explore advanced quantum computing concepts and their applications in this IEEE conference session, delving into cutting-edge research and theoretical developments.

• YouTube
• 1 hour 31 minutes
• On-Demand
• Free Video

Ryan O'Donnell

Grover's Algorithm for SAT with Approximate 'p' - Lesson 59

Exploring Grover's Algorithm for SAT with approximate knowledge of 'p', demonstrating how near-exact estimation suffices for finding satisfying assignments efficiently in quantum computing.

• YouTube
• 14 minutes
• On-Demand
• Free Video

Institute for Advanced Study

Shallow Quantum Circuits

Explore the potential of shallow quantum circuits in quantum information processing, focusing on their applications and limitations in various computational tasks.

• YouTube
• 1 hour 35 minutes
• On-Demand
• Free Video