Quantum Learning Algorithms Imply Circuit Lower Bounds

Quantum Learning Algorithms Imply Circuit Lower Bounds

Published on ● Video Link: https://www.youtube.com/watch?v=zFXN1JAKIYc



Duration: 46:00
237 views
6


Alex Grilo (CNRS and Sorbonne Université)
https://simons.berkeley.edu/talks/quantum-learning-algorithms
Quantum Wave in Computing Reunion




Other Videos By Simons Institute for the Theory of Computing


2021-07-16Linear Growth of Quantum Circuit Complexity
2021-07-16Entanglement Spread in Communication Complexity and Many-Body Physics
2021-07-16Exponential Separations Between Learning With and Without Quantum Memory
2021-07-16A Rigorous and Robust Quantum Speed-up in Supervised Machine Learning
2021-07-16Provably Efficient Machine Learning for Quantum Many-Body Problems
2021-07-16Quantum Pseudorandomness and Classical Complexity
2021-07-15Quantum Generative Training Using Rényi Divergences
2021-07-15Quantum Algorithms for Escaping from Saddle Points
2021-07-15Quantum Pseudo-Randomness From Domain Walls and Spectral Gaps
2021-07-15Noise vs Imprecision in the Hardness of Random Quantum Circuits
2021-07-15Quantum Learning Algorithms Imply Circuit Lower Bounds
2021-07-15One-Way Functions Imply Secure Computation in a Quantum World
2021-07-15Interactive Proofs for Synthesizing Quantum States and Unitaries
2021-07-15Optimization Based Approach for Quantum Signal Processing and Its Energy Landscape
2021-07-15No Quantum Speedup Over Gradient Descent for Non-Smooth Convex Optimization
2021-07-15Symmetries, Graph Properties, and Quantum Speedups
2021-07-15Optimal Learning of Quantum Hamiltonians From High-Temperature Gibbs States
2021-07-15Hamiltonian Complexity in the Thermodynamic Limit
2021-07-15(Sub)Exponential Advantage of Adiabatic Quantum Computation With No Sign Problem
2021-07-15Quantum Garbled Circuits
2021-07-15Strongly Universal Hamiltonian Simulators



Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Alex Grilo
Quantum Wave in Computing Reunion