Circuit Complexity Courses and Certifications

Kavli Institute for Theoretical Physics

Sharp Transitions in Quantum Circuit Complexity

Explore sharp transitions in quantum circuit complexity and their implications for quantum dynamics and computational theory.

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

Qiskit

Quantum Algorithmic Foundations: Understanding Quantum Information and Computation - Lesson 6

Explore computational costs in quantum and classical computing, focusing on circuit implementations, Boolean operations, and methods for performing classical computations using quantum circuits.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

Ryan O'Donnell

Graduate Complexity Theory

Dive into advanced computational complexity theory with graduate-level lectures covering hierarchy theorems, circuits, interactive proofs, and cutting-edge research topics.

• YouTube
• 1 day 11 hours 50 minutes
• On-Demand
• Free Video

Ryan O'Donnell

Quantum Complexity - Quantum Computation at CMU

Explore quantum complexity, error probabilities, and complexity classes in this advanced lecture on quantum computation and information theory.

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

Paul G. Allen School

Innovations in Theoretical Computer Science 2020 - Session 10

Explores cutting-edge research in theoretical computer science, covering topics like computational hardness, random strings, decision trees, and pseudorandomness. Features presentations from leading experts in the field.

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

Association for Computing Machinery (ACM)

Optimizing Semi-Honest Secure Multiparty Computation for the Internet

Optimizing secure multiparty computation for internet use, focusing on efficiency improvements in BMR protocol and OT-based methods for honest-minority settings.

• YouTube
• 27 minutes
• On-Demand
• Conference Talk

Simons Institute

A Survey on MCSP

Explore Boolean devices and the Minimum Circuit Size Problem (MCSP) in this comprehensive survey, delving into computational complexity theory and its implications.

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

Simons Institute

Logic and Probabilistic Circuits - Lecture 4

Explore advanced concepts in logic and probabilistic circuits, focusing on their applications in database theory and artificial intelligence.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

Simons Institute

Logic and Probabilistic Circuits - Part 3

Explore advanced concepts in logic and probabilistic circuits, focusing on their applications in database theory and AI algorithms.

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

IEEE

Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization

Explore groundbreaking research on circuit complexity theory, focusing on the connection between derandomization techniques and establishing lower bounds for circuit sizes across various computational models.

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

IEEE

Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits

Explore the complexity theory concept of non-deterministic quasi-polynomial time and its average-case hardness for ACC circuits in this advanced computer science presentation.

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

IEEE

Tight Quantum Time-Space Tradeoffs for Function Inversion

Explore quantum time-space tradeoffs for function inversion, examining classical tradeoffs, circuit complexity, and a generic framework. Delve into proof overviews and multi-instance gains.

• YouTube
• 26 minutes
• On-Demand
• Conference Talk

IEEE

The Constant Depth Formula and Partial Function Versions of MCSP are Hard

Explore the complexity of MCSP variants, including partial function and constant depth formula versions, and their implications for circuit lower bounds and computational hardness.

• YouTube
• 23 minutes
• On-Demand
• Conference Talk

Simons Institute

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

Simons Institute

Circuit Conspiracies - Verifiable NISQ Quantum Supremacy and AI Interpretability

Exploring quantum circuit properties and their implications for NISQ quantum supremacy, with connections to AI interpretability and neural networks.

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