Workshops

Summer 2022

Quantum and Lattices Joint Reunion Workshop

Jun 13, 2022 to Jun 17, 2022

Return to event »

Monday, June 13th, 2022
8:30 am–8:50 am		Coffee and Check-In
8:50 am–9:00 am		Opening Remarks
9:00 am–10:00 am		Recent Progress in Quantum Advantage Scott Aaronson (University of Texas Austin)
10:00 am–10:30 am		Break
10:30 am–11:30 am		Quantum Advantage Without Structure Mark Zhandry (NTT Research & Princeton University)
11:30 am–1:30 pm		Lunch
1:30 pm–2:15 pm		The Hidden Subgroup Problem for Infinite Groups Greg Kuperberg (UC Davis)
2:15 pm–2:45 pm		Break
2:45 pm–3:30 pm		Dequantizing the Quantum Singular Value Transform Sev Gharibian (Paderborn University)
3:30 pm–4:00 pm		Break
4:00 pm–4:45 pm		Quantum Linear Algebra Using Subspace States Anupam Prakash (QC-Ware)
4:45 pm–5:45 pm		Reception

Tuesday, June 14th, 2022
8:30 am–9:00 am		Coffee and Check-In
9:00 am–10:00 am		Learning from Quantum Experiments Robert Huang (Caltech)
10:00 am–10:30 am		Break
10:30 am–11:30 am		New Quantum Cryptographic Primitives I Mark Zhandry (Princeton University)
11:30 am–1:00 pm		Lunch
1:00 pm–2:00 pm		New Quantum Cryptographic Primitives II Mark Zhandry (Princeton University)
2:00 pm–2:30 pm		Break
2:30 pm–3:30 pm		Quantum Benchmarking Yunchao Liu (UC Berkeley)

Wednesday, June 15th, 2022
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		Quantum Rewinding Tutorial, Part 1: Motivation and Early Rewinding Techniques Alex Lombardi (MIT) and Fermi Ma (UC Berkeley)
10:30 am–11:00 am		Break
11:00 am–12:00 pm		Quantum Rewinding Tutorial, Part 2: How to Run a Quantum Attacker Many Times Alex Lombardi (MIT) and Fermi Ma (UC Berkeley)
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Quantum Rewinding Tutorial, Part 3: Zero Knowledge Simulation Beyond Watrous Alex Lombardi (MIT) and Fermi Ma (UC Berkeley)

Thursday, June 16th, 2022
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		Hardness of the Shortest Vector Problem: A Simplified Proof and a Survey Huck Bennett (Oregon State University)
10:30 am–11:00 am		Break
11:00 am–12:00 pm		Bourgain’s Slicing Problem and KLS Isoperimetry up to Polylog Bo’az Klartag (Weizmann Institute of Science)
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Some Recent Results Showing that Lattice Problems Are (sort of) Equivalent in All Norms Noah Stephens-Davidowitz (Cornell University)
3:00 pm–3:30 pm		Break
3:30 pm–4:15 pm		Doubly Efficient Private Information Retrieval Elette Boyle (Reichman University (IDC) and NTT Research)
4:15 pm–5:00 pm		Single-Server Private Information Retrieval with Sublinear Amortized Time Alexandra Henzinger (MIT)

Friday, June 17th, 2022
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:15 am		Optimal Broadcast Encryption and More from Evasive LWE Hoeteck Wee (CNRS)
10:15 am–11:00 am		Candidate Witness Encryption from Lattice Techniques Rotem Tsabary (Reichman University (IDC Herzliya))
11:00 am–11:30 am		Break
11:30 am–12:30 pm		Lattice-based Zero-knowledge Proofs Vadim Lyubashevsky (IBM Research)
12:30 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Batch Arguments for NP and SNARGs for P from LWE Abhishek Jain (Johns Hopkins)
3:00 pm–3:30 pm		Break
3:30 pm–4:30 pm		Continuous LWE is as Hard as LWE Neekon Vafa (MIT)