Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier

Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=siXr6otMSZQ


Duration: 12:40
69 views
1

Fermi Ma (Simons and Berkeley)
Meet the Fellows Welcome Event



Other Videos By Simons Institute for the Theory of Computing


2021-09-13Data Efficient Methods for Reinforcement Learning
2021-09-13Theoretical Foundations of Data-Driven Algorithm Design
2021-09-13Distribution-Free Robustness
2021-09-13Pseudorandom Generators and Small-Space Derandomization
2021-09-13Preconditioning and Locality in Algorithm Design
2021-09-13Query, Communication and Discrepancy
2021-09-13Dynamic Linear Algebra
2021-09-13Let's Sample Perfectly
2021-09-13A Complexity-Theoretic Perspective on Fairness
2021-09-13Quantum Simulation of Relativistic Electronic Structure Hamiltonians
2021-09-13Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier
2021-09-13Quantum Necromancy and the Hardness of Observing Schrodinger's Cat
2021-09-13Short Proof of a Spectral Chernoff Bound for Local Hamiltonians
2021-09-13Fundamental Limits and Optimal Uses of Data in Modern Learning Problems
2021-09-13Convex Programs, Computational Phase Transitions, and Robust Algorithms
2021-09-13Information Theory and Statistics
2021-09-13Understanding Statistical-to-Computational Gaps via Low-Degree Polynomials
2021-09-13Sharp Threshold for the Planted Matching Problem
2021-09-13Correlation Adjusted Debiasing (CAD): Debiasing the Lasso with Inaccurate Covariate Model
2021-09-13On Query-to-Communication Lifting for Adversary Bounds
2021-09-13One-Way Functions Imply Secure Computation in a Quantum World


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Meet the Fellows Welcome Event
Fermi Ma