All talks are listed in Pacific Time. Schedule subject to change.

–
Coffee and Check-in
–
Opening Remarks
–
Verifiable Quantum Supremacy: What I Hope Will Be Done
Scott Aaronson (University of Texas at Austin)
–
Break
–
Validated Quantum Advantage via Bell Sampling
Dominik Hangleiter (University of Maryland)
–
Lunch (on your own)
–
A Phase Transition in Linear Cross-Entropy Benchmarking
Abhinav Deshpande (IBM)
–
Break
–
Utility, Computational Cost, and Effective Quantum Volume of NISQ Experiments
Benajmin Villalonga (Google)
–
Reception
–
Coffee and Check-in
–
Quantum Advantage with Shallow Clifford Circuits
Daniel Grier (UC San Diego)
–
Break
–
Quantum Gibbs Sampling
Anthony Chen (Caltech)
–
Lunch (on your own)
–
Quantum Algorithms for Approximating Partition Functions
Yassine Hamoudi (Simons Institute)
–
Break
–
How Simulating Balls and Springs Captures the Power of Quantum Computing
Robin Kothari (Google)
–
Coffee and Check-in
–
Making the Leap to Quantum PCPs
Chinmay Nirkhe (IBM)
–
Break
–
Compiled Nonlocal Games: From CHSH to BQP Verification
Anand Natarajan (MIT)
–
Lunch (on your own)
–
QMA and the Power of “Positivity”
Kunal Marwaha (University of Chicago)
–
Break
–
Dissipative State Preparation and the Dissipative Quantum Eigensolver
Toby Cubitt (University College London)
–
Coffee and Check-in
–
Geometry, Entropy and Complexity in Quantum Gravity (Part I)
Patrick Hayden (Stanford)
–
Break
–
Geometry, Entropy and Complexity in Quantum Gravity (Part II)
Patrick Hayden (Stanford)
–
Lunch (on your own)
–
Quantum Commitments and Black Hole Radiation Decoding
Fermi Ma (UC Berkeley)
–
Break
–
Learning Beyond Stabilizer States
William Kretschmer (University of Texas at Austin)
–
Coffee and Check-in
–
Improved Machine Learning Algorithm for Predicting Ground State Properties
Laura Lewis (Caltech)
–
Break
–
Approaching the Quantum Singleton Bound with Approximate Error Correction
Louis Golowich (UC Berkeley)
–
Lunch (on your own)
–
Lightning Talks (In-Person Only)
–
Break
–
Lightning Talks (In-Person Only)