–
Coffee and Check-In
–
Opening Remarks
–
Recent Progress in Quantum Advantage
Scott Aaronson (University of Texas Austin)
–
Break
–
Quantum Advantage Without Structure
Mark Zhandry (NTT Research & Princeton University)
–
Lunch
–
The Hidden Subgroup Problem for Infinite Groups
Greg Kuperberg (UC Davis)
–
Break
–
Dequantizing the Quantum Singular Value Transform
Sev Gharibian (Paderborn University)
–
Break
–
Quantum Linear Algebra Using Subspace States
Anupam Prakash (UC Berkeley)
–
Reception
–
Coffee and Check-In
–
Learning from Quantum Experiments
Robert Huang (Caltech)
–
Break
–
New Quantum Cryptographic Primitives I
Mark Zhandry (Princeton University)
–
Lunch
–
New Quantum Cryptographic Primitives II
Mark Zhandry (Princeton University)
–
Break
–
Quantum Benchmarking
Yunchao Liu (UC Berkeley)
–
Coffee and Check-In
–
Quantum Rewinding Tutorial, Part 1: Motivation and Early Rewinding Techniques
Alex Lombardi (MIT), Fermi Ma (UC Berkeley)
–
Break
–
Quantum Rewinding Tutorial, Part 2: How to Run a Quantum Attacker Many Times
Alex Lombardi (MIT), Fermi Ma (UC Berkeley)
–
Lunch
–
Quantum Rewinding Tutorial, Part 3: Zero Knowledge Simulation Beyond Watrous
Alex Lombardi (MIT), Fermi Ma (UC Berkeley)
–
Coffee and Check-In
–
Hardness of the Shortest Vector Problem: A Simplified Proof and a Survey
Huck Bennett (Oregon State University)
–
Break
–
Bourgain’s Slicing Problem and KLS Isoperimetry up to Polylog
Bo’az Klartag (Weizmann Institute of Science)
–
Lunch
–
Some Recent Results Showing that Lattice Problems Are (sort of) Equivalent in All Norms
Noah Stephens-Davidowitz (Cornell University)
–
Break
–
Doubly Efficient Private Information Retrieval
Elette Boyle (Reichman University (IDC)
–
Single-Server Private Information Retrieval with Sublinear Amortized Time
Alexandra Henzinger (MIT)
–
Coffee and Check-In
–
Optimal Broadcast Encryption and More from Evasive LWE
Hoeteck Wee (École Normale Supérieure, Paris)
–
Candidate Witness Encryption from Lattice Techniques
Rotem Tsabary (Weizmann Institute)
–
Break
–
Lattice-based Zero-knowledge Proofs
Vadim Lyubashevsky (IBM Research)
–
Lunch
–
Batch Arguments for NP and SNARGs for P from LWE
Abhishek Jain (Johns Hopkins)
–
Break
–
Continuous LWE is as Hard as LWE
Neekon Vafa (MIT)