Quantum and Lattices Joint Reunion Workshop

Program

Extended Reunion: The Quantum Wave in Computing

Location

Calvin Auditorium and Zoom

Date

Monday, June 13 – Friday, June 17, 2022

Back to calendar

8:30 – 8:50 a.m.

Coffee and Check-In

8:50 – 9 a.m.

Opening Remarks

9 – 10 a.m.

Recent Progress in Quantum Advantage

Scott Aaronson (University of Texas Austin)

10 – 10:30 a.m.

Break

10:30 – 11:30 a.m.

Quantum Advantage Without Structure

Mark Zhandry (NTT Research & Princeton University)

11:30 a.m. – 1:30 p.m.

Lunch

1:30 – 2:15 p.m.

The Hidden Subgroup Problem for Infinite Groups

Greg Kuperberg (UC Davis)

2:15 – 2:45 p.m.

Break

2:45 – 3:30 p.m.

Dequantizing the Quantum Singular Value Transform

Sev Gharibian (Paderborn University)

3:30 – 4 p.m.

Break

4 – 4:45 p.m.

Quantum Linear Algebra Using Subspace States

Anupam Prakash (JP Morgan, Chase and Co.)

4:45 – 5:45 p.m.

Reception

8:30 – 9 a.m.

Coffee and Check-In

9 – 10 a.m.

Learning from Quantum Experiments

Robert Huang (Caltech)

10 – 10:30 a.m.

Break

10:30 – 11:30 a.m.

New Quantum Cryptographic Primitives I

Mark Zhandry (Princeton University)

11:30 a.m. – 1 p.m.

Lunch

1 – 2 p.m.

New Quantum Cryptographic Primitives II

Mark Zhandry (Princeton University)

2 – 2:30 p.m.

Break

2:30 – 3:30 p.m.

Quantum Benchmarking

Yunchao Liu (UC Berkeley)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

Quantum Rewinding Tutorial, Part 1: Motivation and Early Rewinding Techniques

Alex Lombardi (MIT),
Fermi Ma (UC Berkeley)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Quantum Rewinding Tutorial, Part 2: How to Run a Quantum Attacker Many Times

Alex Lombardi (MIT),
Fermi Ma (UC Berkeley)

12 – 2 p.m.

Lunch

2 – 3 p.m.

Quantum Rewinding Tutorial, Part 3: Zero Knowledge Simulation Beyond Watrous

Alex Lombardi (MIT),
Fermi Ma (UC Berkeley)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

Hardness of the Shortest Vector Problem: A Simplified Proof and a Survey

Huck Bennett (Oregon State University)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Bourgain’s Slicing Problem and KLS Isoperimetry up to Polylog

Bo’az Klartag (Weizmann Institute of Science)

12 – 2 p.m.

Lunch

2 – 3 p.m.

Some Recent Results Showing that Lattice Problems Are (sort of) Equivalent in All Norms

Noah Stephens-Davidowitz (Cornell University)

3 – 3:30 p.m.

Break

3:30 – 4:15 p.m.

Doubly Efficient Private Information Retrieval

Elette Boyle (Reichman University (IDC)

4:15 – 5 p.m.

Single-Server Private Information Retrieval with Sublinear Amortized Time

Alexandra Henzinger (MIT)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:15 a.m.

Optimal Broadcast Encryption and More from Evasive LWE

Hoeteck Wee (NTT Research)

10:15 – 11 a.m.

Candidate Witness Encryption from Lattice Techniques

Rotem Tsabary (Weizmann Institute)

11 – 11:30 a.m.

Break

11:30 a.m. – 12:30 p.m.

Lattice-based Zero-knowledge Proofs

Vadim Lyubashevsky (IBM Research)

12:30 – 2 p.m.

Lunch

2 – 3 p.m.

Batch Arguments for NP and SNARGs for P from LWE

Abhishek Jain (Johns Hopkins)

3 – 3:30 p.m.

Break

3:30 – 4:30 p.m.

Continuous LWE is as Hard as LWE

Neekon Vafa (MIT)