Workshops

Spring 2020

Quantum Wave in Computing Reunion

Jul 12, 2021 to Jul 16, 2021

Return to event »

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.

Monday, July 12th, 2021
8:50 am–9:00 am		Opening Remarks
9:00 am–9:45 am		(Sub)Exponential Advantage of Adiabatic Quantum Computation With No Sign Problem András Pál Gilyén (Caltech)
9:45 am–10:30 am		Hamiltonian Complexity in the Thermodynamic Limit Sandy Irani (UC Irvine)
10:30 am–11:15 am		Optimal Learning of Quantum Hamiltonians From High-Temperature Gibbs States Ewin Tang (University of Washington)
11:15 am–11:45 pm		Break
11:45 am–12:30 pm		Symmetries, Graph Properties, and Quantum Speedups Andrew Childs (University of Maryland)
12:30 pm–1:15 pm		No Quantum Speedup Over Gradient Descent for Non-Smooth Convex Optimization Robin Kothari (Microsoft)
1:15 pm–2:00 pm		Optimization Based Approach for Quantum Signal Processing and Its Energy Landscape Lin Lin (UC Berkeley)

Tuesday, July 13th, 2021
9:00 am–9:45 am		Interactive Proofs for Synthesizing Quantum States and Unitaries Henry Yuen (Columbia University)
9:45 am–10:30 am		One-Way Functions Imply Secure Computation in a Quantum World Andrea Coladangelo (UC Berkeley)
10:30 am–11:15 am		Quantum Learning Algorithms Imply Circuit Lower Bounds Alex Grilo (CNRS and Sorbonne Université)
11:15 am–11:45 am		Break
11:45 am–12:30 pm		Preparation and Verification of Tensor Network States Norbert Schuch (University of Vienna)
12:30 pm–1:15 pm		Noise vs Imprecision in the Hardness of Random Quantum Circuits Bill Fefferman (University of Chicago)
1:15 pm–2:00 pm		Quantum Pseudo-Randomness From Domain Walls and Spectral Gaps Nicholas Hunter-Jones (Perimeter Institute and Stanford University)

Wednesday, July 14th, 2021
9:00 am–9:45 am		Efficient Certifiable Randomness Urmila Mahadev (Caltech, Microsoft)
9:45 am–10:30 am		Classical Verification of Quantum Computational Advantage Greg Meyer (UC Berkeley)
10:30 am–11:15 am		Device-Independent Protocols From Computational Assumptions Tony Metger (ETH Zürich)
11:15 am–11:45 am		Break
11:45 am–12:30 pm		On the NLTS Conjecture Chinmay Nirkhe (UC Berkeley)
12:30 pm–1:15 pm		Strongly Universal Hamiltonian Simulators Leo Zhou (Harvard University)
1:15 pm–2:00 pm		Quantum Garbled Circuits Zvika Brakerski (Weizmann Institute of Science)

Thursday, July 15th, 2021
9:00 am–9:45 am		Quantum Algorithms for Escaping from Saddle Points Tongyang Li (MIT)
9:45 am–10:30 am		Quantum Generative Training Using Rényi Divergences Nathan Wiebe (University of Toronto)
10:30 am–11:15 am		Quantum Pseudorandomness and Classical Complexity William Kretschmer (UT Austin)
11:15 am–11:45 am		Break
11:45 am–12:30 pm		Provably Efficient Machine Learning for Quantum Many-Body Problems Hsin-Yuan Huang (Caltech)
12:30 pm–1:15 pm		A Rigorous and Robust Quantum Speed-up in Supervised Machine Learning Yunchao Liu (UC Berkeley)
1:15 pm–2:00 pm		Exponential Separations Between Learning With and Without Quantum Memory Jordan Cotler (Harvard)

Friday, July 16th, 2021
9:00 am–9:45 am		Entanglement Spread in Communication Complexity and Many-Body Physics Aram Harrow (MIT)
9:45 am–10:30 am		Linear Growth of Quantum Circuit Complexity Jonas Haferkamp (ITP Berlin)
10:30 am–11:15 am		Improved Upper Bounds on the Stabilizer Rank of Magic States David Gosset (University of Waterloo)
11:15 am–11:45 am		Break
11:45 am–12:30 pm		Electronic Structure in a Fixed Basis Is QMA-Complete Bryan O’Gorman (UC Berkeley)
12:30 pm–1:15 pm		What the Foundations of Quantum Computer Science Teach Us About Chemistry Jarrod R. McClean (Google Quantum)
1:15 pm–2:00 pm		Twisted Product Constructions for LDPC Quantum Codes Nikolas Breuckmann (University College London)