Introduction to Commuting Local Hamiltonian Problems
Explore quantum complexity through commuting local Hamiltonian problems, focusing on quantum PCP, area laws, and quantum gravity connections.
When and How are Promise Constraint Satisfaction Problems Efficiently Solvable
Delve into the mathematical foundations of Constraint Satisfaction Problems (CSP), exploring algorithmic efficiency, polymorphisms, and promise CSP applications in graph coloring and discrepancy minimization.
NLTS Hamiltonians from Good Quantum Codes - Understanding Low-Energy States and Circuit Complexity
Delve into the complexity of NLTS conjecture, quantum LDPC codes, and their connection to local Hamiltonians, exploring circuit lower bounds and many-body entanglement principles.
Identity Check Problem for Shallow Quantum Circuits
Explore an efficient classical algorithm for checking quantum circuit identity, focusing on shallow geometrically local circuits and their distance approximation to identity channels.
3D-Local Noisy Shallow Quantum Circuits - A Colossal Advantage Against Classical Computing
Explore groundbreaking research demonstrating quantum computing superiority using 3D-local noisy circuits, showcasing unprecedented advantages over classical computing in fault-tolerant quantum systems.
Parity vs. AC0 with Simple Quantum Preprocessing
Delve into quantum computation theory exploring the limitations of QNC0 and AC0 circuits in computing parity functions, with insights into decision tree complexity and nonlocal channels.
Quantum Advantage from One-Way Functions
Delve into quantum advantage theory through one-way functions, exploring inefficient-verifier proofs of quantumness and their construction from classical bit commitments in cryptography.
Quantum PCPs: On Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
Delve into advanced quantum PCP theory, exploring adaptivity, multiple unentangled provers, and their connections to local Hamiltonians through rigorous mathematical frameworks and complexity theory analysis.
Constant-Depth Circuits for Uniformly Controlled Gates and Boolean Functions
Explore constant-depth quantum circuits using Fan-Out and Global Tunable gates, focusing on implementations for Uniformly Controlled Gates and quantum memory applications.
Computational Quantum Secret Sharing
Discover groundbreaking advances in quantum secret sharing schemes, exploring computational security approaches that achieve efficient distribution and reconstruction of quantum states with reduced share sizes.
PAC Learning: From Finite Families to CNF Formulas - Lecture on March 20, 2023
Dive into PAC learning concepts, exploring finite families, conjunctions, k-CNFs, and NP-completeness in proper learning for 2-term CNF through advanced computational complexity theory.
Quantum State Learning Implies Circuit Lower Bounds
Delve into groundbreaking research connecting quantum state tomography with circuit complexity, exploring implications for quantum learning algorithms and classical circuit lower bounds.
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.
A Brief Introduction to Algorithms, Game Theory and Risk-Averse Decision Making
Explore algorithms, game theory, and risk-averse decision making, covering shortest paths, NP-Complete problems, equilibria, and various risk frameworks for real-world applications.
Oral History - Russell Impagliazzo in Conversation with Dick Karp
Explore key developments in theoretical computer science through an engaging conversation between Russell Impagliazzo and Dick Karp, covering topics from NP-completeness to computational biology.
Beyond Worst-Case Analysis - Panel Discussion
Experts discuss advanced algorithmic analysis, exploring beyond worst-case scenarios to improve efficiency and understanding in computer science and machine learning applications.
Leslie G. Valiant - Turing Award Lecture 2010
Explore computational learning theory, machine learning, and brain modeling with Leslie G. Valiant, 2010 ACM Turing Award winner, as he discusses his groundbreaking research and insights.
PCPs and Global Hyper-contractivity - Lecture 1
Explore advanced concepts in theoretical computer science, focusing on Probabilistically Checkable Proofs and global hyper-contractivity with expert Dor Minzer.
PCPs and Global Hyper-contractivity - Lecture 3
Explore advanced concepts in PCPs and global hyper-contractivity with Dor Minzer, delving into complex mathematical theories and their applications in analysis and theoretical computer science.
Linearity Testing Over the Biased Cube
Explores linearity testing in p-biased settings, presenting a 4-query test with optimal soundness. Discusses structural results and direct product tests for functions correlated to linear functions under random restrictions.
PCPs and Global Hyper-contractivity - Lecture 2
Explore advanced concepts in PCPs and global hyper-contractivity with Dor Minzer, delving into complex mathematical theories and their applications in analysis and theoretical computer science.