Quantum Hardness of Learning Shallow Classical Circuits

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


Duration: 21:57
429 views
7

Aarthi Sundaram (Microsoft)
https://simons.berkeley.edu/talks/quantum-hardness-learning-shallow-classical-circuits
Quantum Algorithms



Other Videos By Simons Institute for the Theory of Computing


2020-03-25Lockable Obfuscation
2020-03-25Cryptanalysis of Candidate Program Obfuscators
2020-03-24Obfuscation III
2020-03-24Obfuscation IV: A New Assumption enabling iO
2020-03-24Recent Advances on Foundations of Program Obfuscation
2020-03-24Obfuscation from Noisy Linear FE
2020-03-23Homomorphic Signatures and Pre-Processing NIZK
2020-03-23Fully Secure Attribute-Based Encryption for t-CNF from LWE
2020-03-23Tutorial: Encrypted Computation from Lattices
2020-03-16Lattices ∩ Quantum
2020-02-28Quantum Hardness of Learning Shallow Classical Circuits
2020-02-28Exponential Separation Between Shallow Quantum Circuits and Unbounded...
2020-02-28Recent Advances in Quantum Simulation with Applications to Chemistry and Field Theory
2020-02-28Techniques for Hamiltonian Simulation and Beyond
2020-02-27Estimating the Fault Tolerant Cost of Classically Intractable Quantum Computations
2020-02-27Quantum Distributed Algorithms: Recent Results
2020-02-27Path Detection: A Quantum Computing Primitive
2020-02-27Experimentally Scaling Up Variational Quantum Simulations of Fermions
2020-02-27Prospects for Quantum Computers in Chemistry and Materials Science
2020-02-27Reducing Costs for Quantum Chemistry on NISQ Computers
2020-02-26Using Post-Supremacy Quantum Devices for Practical Applications


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Quantum Algorithms
Aarthi Sundaram