–
Coffee and Check In
–
Welcome Remarks
–
Programmable Quantum Simulators: Past and Present
I, ke Chuang (MIT)
–
Break
–
The Complexity of the Local Hamiltonian Problem
Sandy Irani (UC Irvine)
–
Lunch
–
Introduction to Quantum Chemistry
Bryan O'Gorman (UC Berkeley/NASA Ames)
–
Break
–
Ab Initio Chemistry and Materials Science: The Limits of Classical Computation and Prospects for Quantum Algorithms
A, lec White (Caltech)
–
Reception
–
Coffee and Check In
–
Quantum Algorithms -- An Overview of Techniques
András Gilyén (Caltech)
–
Break
–
Quantum Singular Value Transformation and Its Algorithmic Applications
András Gilyén (Caltech)
–
Lunch
–
Quantum-Inspired Classical Linear Algebra
Ewin Tang (University of Washington)
–
Coffee and Check In
–
Multiprover Protocols I
Henry Yuen (University of Toronto)
–
Break
–
Multiprover Protocols II
Henry Yuen (University of Toronto)
–
Lunch
–
Classical Commitment to Quantum States
Urmila Mahadev (Microsoft Research)
–
Break
–
Authenticating Quantum States
Yfke Dulek (QuSoft)
–
Coffee and Check In
–
Post-Quantum Cryptography
Daniel Bernstein (University of Illinois at Chicago)
–
Break
–
Quantum Algorithms and Post-Quantum Cryptography
Sean Hallgren (Pennsylvania State University)
–
Lunch
–
Recent Advances in Zero-Knowledge Proofs in the Quantum Setting
Alex Bredariol Grilo (CWI and QuSoft)
–
Town Hall Discussion
–
Coffee and Check In
–
Quantum Supremacy I
Adam Bouland (UC Berkeley)
–
Break
–
Quantum Supremacy II
Adam Bouland (UC Berkeley)
–
Lunch
–
Random Circuit Sampling: Thoughts and Open Problems
Scott Aaronson (University of Texas at Austin)