• Click on the titles of individual talks for abstract, slides and archived video.

–
Coffee and Check-In
–
Welcome Remarks
–
Classical Simulation of Quantum Many-body Systems with Tensor Networks
Glen Evenbly, University of Sherbrooke
–
Recent Advances in Quantum Simulation
Nathan Wiebe, Microsoft Research
–
Break
–
Classical Approaches to Simulating Quantum Chemistry
Martin Head-Gordon, UC Berkeley
–
Simulating Chemistry on Realistic Quantum Computers
Ryan Babbush, Google
–
Lunch
–
Moderated Discussion
–
Break
–
Analog Quantum Simulations: What We Have, What We Would like to Have, and the Potential for Seeing a Quantum Advantage
Jens Eisert, Freie Universität Berlin
–
Quantum Simulators: Where Do We Stand?
Maciej Lewenstein, Institute of Photonic Sciences
–
Coffee and Check-In
–
Quantum Supremacy: Checking a Quantum Computer with a Classical Supercomputer
John Martinis, UC Santa Barbara
–
Testing Physics with Small Quantum Computers
Ben Reichardt, University of Southern California
–
Break
–
Quantum Simulators and Processors Based on Rydberg Atom Arrays
Mikhail Lukin, Harvard University
–
Lunch
–
Quantum Supremacy and its Applications
Scott Aaronson, University of Texas at Austin
–
Quantum Computing and Simulation with Trapped Ions
Chris Monroe, University of Maryland
–
Break
–
Moderated Discussion
–
Reception
–
Coffee and Check-In
–
Recent Algorithmic Primitives: Linear Combination of Unitaries and Quantum Signal Processing
Robin Kothari, Microsoft Research
–
The Power of Block-encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation
Stacey Jeffery, Centrum Wiskunde & Informatica
–
Break
–
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
Jeongwan Haah, Microsoft Research
–
Improvements in Quantum SDP Solving
Andras Gilyen, Centrum Wiskunde & Informatica
–
FREE AFTERNOON
–
Coffee and Check-In
–
The Short-path Algorithm for Combinatorial Optimization
Matthew Hastings, Microsoft Research
–
Challenges in Adiabatic Optimization
Elizabeth Crosson, California Institute of Technology
–
Break
–
Quantum Algorithms for Classification
Iordanis Kerenidis, Université Paris Diderot
–
Lunch
–
Lightning Talks I
–
Break
–
Lightning Talks II
–
Coffee and Check-In
–
Classical Verification of Quantum Computations
Urmila Mahadev (Caltech)
–
Cryptography for Quantum Computers
Sanjam Garg, UC Berkeley
–
Break
–
Verifying Quantum Proofs with Entangled Games
Anand Natarajan, Massachusetts Institute of Technology
–
Lunch
–
Non-Interactive Verifiable Computation via Non-signaling
Yael Kalai, Microsoft Research
–
Spatial Isolation Implies Zero Knowledge Even in a Quantum World
Tom Gur, UC Berkeley