This workshop is being live streamed on our website. Full participation (including the capacity to ask questions) will be available via Zoom webinar. 

All talk times are in Pacific Time. 

–
Supremacy Monday
–
Welcome Remarks
–
Quantum Supremacy Using a Programmable Superconducting Processor I
Sergio Boixo (Google Research)
–
Break
–
Towards Closing the Loopholes of Showing a Quantum Advantage for Quantum Simulators
Jens Eisert (Freie Universität Berlin)
–
Break
–
On Entropy from Random Circuit Sampling
Scott Aaronson (University of Texas at Austin)
–
Experimental Tuesday
–
Quantum Computing and Simulation with Atoms
Christopher Monroe (University of Maryland)
–
Break
–
Characterizing and Operating Noisy Quantum Computers
Joel Wallman (University of Waterloo)
–
Break
–
Quantum Supremacy Using a Programmable Superconducting Processor II
Julian Kelly (Google)
–
Quantum Simulations and Information Processing with Programmable Atom Arrays
Mikhail Lukin (Harvard)
–
Theory Wednesday
–
Efficient Classical Simulation of Random Shallow 2d Quantum Circuit
Aram Harrow (MIT)
–
Break
–
The Power of Random Quantum Circuits
Bill Fefferman (University of Chicago)
–
Break
–
Designing Hamiltonians for Quantum Adiabatic Optimization
Elizabeth Crosson (University of New Mexico)
–
Optimization Thursday
–
Classical Algorithms for Quantum Mean Values
Sergey Bravyi (IBM T.J. Watson Research Center)
–
Break
–
Divide-And-Conquer Hybrid Methods for Smaller Quantum Computers
Vedran Dunjko (University of Leiden)
–
Break
–
Obstacles to State Preparation and Variational Optimization from Symmetry Protection
Robert König (Technical University of Munich)
–
Superconducting Friday
–
Quantum Computing With Stabilized Cat Qubits
Alexandre Blais (Universite de Sherbrooke)
–
Break
–
Co-Design of Almost Universal Quantum Computers
Frank Wilhelm-Mauch (Saarland University)
–
Wrap Up Discussion
–
Panel Discussion
Isaac Chuang (MIT), John Martinis (UC Santa Barbara), John Preskill (Caltech), …