Full participation (including the capacity to ask questions) will be available via Zoom: https://berkeley.zoom.us/j/93287803112

All talk times are in Pacific time. 

–
Opening Remarks
–
(Sub)Exponential Advantage of Adiabatic Quantum Computation With No Sign Problem
András Pál Gilyén (Caltech)
–
Hamiltonian Complexity in the Thermodynamic Limit
Sandy Irani (UC Irvine)
–
Optimal Learning of Quantum Hamiltonians From High-Temperature Gibbs States
Ewin Tang (University of Washington)
–
Break
–
Symmetries, Graph Properties, and Quantum Speedups
Andrew Childs (University of Maryland)
–
No Quantum Speedup Over Gradient Descent for Non-Smooth Convex Optimization
Robin Kothari (Microsoft)
–
Optimization Based Approach for Quantum Signal Processing and Its Energy Landscape
Lin Lin (UC Berkeley)
–
Interactive Proofs for Synthesizing Quantum States and Unitaries
Henry Yuen (Columbia University)
–
One-Way Functions Imply Secure Computation in a Quantum World
Andrea Coladangelo (UC Berkeley)
–
Quantum Learning Algorithms Imply Circuit Lower Bounds
Alex Grilo (CNRS and Sorbonne Université)
–
Break
–
Preparation and Verification of Tensor Network States
Norbert Schuch (University of Vienna)
–
Noise vs Imprecision in the Hardness of Random Quantum Circuits
Bill Fefferman (University of Chicago)
–
Quantum Pseudo-Randomness From Domain Walls and Spectral Gaps
Nicholas Hunter-Jones (Perimeter Institute and Stanford University)
–
Efficient Certifiable Randomness
Urmila Mahadev (Caltech, Microsoft)
–
Classical Verification of Quantum Computational Advantage
Greg Meyer (UC Berkeley)
–
Device-Independent Protocols From Computational Assumptions
Tony Metger (ETH Zürich)
–
Break
–
On the NLTS Conjecture
Chinmay Nirkhe (UC Berkeley)
–
Strongly Universal Hamiltonian Simulators
Leo Zhou (Harvard University)
–
Quantum Garbled Circuits
Zvika Brakerski (Weizmann Institute of Science)
–
Quantum Algorithms for Escaping from Saddle Points
Tongyang Li (MIT)
–
Quantum Generative Training Using Rényi Divergences
Nathan Wiebe (University of Toronto)
–
Quantum Pseudorandomness and Classical Complexity
William Kretschmer (UT Austin)
–
Break
–
Provably Efficient Machine Learning for Quantum Many-Body Problems
Hsin-Yuan Huang (Caltech)
–
A Rigorous and Robust Quantum Speed-up in Supervised Machine Learning
Yunchao Liu (UC Berkeley)
–
Exponential Separations Between Learning With and Without Quantum Memory
Jordan Cotler (Harvard)
–
Entanglement Spread in Communication Complexity and Many-Body Physics
Aram Harrow (MIT)
–
Linear Growth of Quantum Circuit Complexity
Jonas Haferkamp (ITP Berlin)
–
Improved Upper Bounds on the Stabilizer Rank of Magic States
David Gosset (University of Waterloo)
–
Break
–
Electronic Structure in a Fixed Basis Is QMA-Complete
Bryan O’Gorman (UC Berkeley)
–
What the Foundations of Quantum Computer Science Teach Us About Chemistry
Jarrod R. McClean (Google Quantum)
–
Twisted Product Constructions for LDPC Quantum Codes
Nikolas Breuckmann (University College London)