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

–
Coffee and Check-In
–
Rapid mixing for Gibbs states within a logical sector: a dynamical view of self-correcting quantum memories
Thiago Bergamaschi (UC Berkeley)
–
Break
–
Learning quantum Gibbs states locally and efficiently
Anthony Chen (UC Berkeley and MIT)
–
Lunch (on your own)
–
A distillation–teleportation protocol for fault-tolerant QRAM
Andras Gilyen (HUN-REN Alfréd Rényi Institute of Mathematics), Alexander M. Dalzell (AWS Center for Quantum Computing)
–
Break
–
The Jacobi factoring circuit, and other developments in quantum factoring
Greg Kahanamoku-Meyer (MIT)
–
Reception
–
Coffee and Check-In
–
Universal generalized lattice surgery by gauging logical operators
Dominic Williamson (The University of Sydney)
–
Break
–
Extractors: Building a Quantum Computer with QLDPC Codes
Zhiyang (Sunny) He (MIT)
–
Lunch (on your own)
–
Quantum fault tolerance with constant-space and logarithmic-time overheads
Chris Pattison (Caltech)
–
Break
–
Quantum computational advantage with polyloglog-depth noisy circuits
Quynh Nguyen (Harvard University)
–
Coffee and Check-In
–
One-shot signatures
Mark Zhandry (NTT Research)
–
Break
–
Quantum Versions of the Karp-Lipton Theorem
Scott Aaronson (University of Texas at Austin)
–
Lunch (on your own)
–
Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from #P-Hardness
Dakshita Khuarna (University of Illinois Urbana-Champaign)
–
Break
–
Learning Stabilizers with Noise
Yihui Quek (MIT)
–
Coffee and Check-In
–
Quasi-quantum states and the quasi-quantum PCP theorem
Miklos Santha (National University of Singapore)
–
Break
–
A streaming quantum PCP from a new quantum gap amplification procedure
Yantian (Tina) Zhang (MIT)
–
Lunch (on your own)
–
An area law for the maximally-mixed ground state in arbitrarily degenerate systems with good AGSP
Itai Arad (CQT Singapore)
–
Break
–
Succinct arguments for QMA from standard assumptions, without quantum PCPs
Anand Natarajan (MIT)