All talks listed in Pacific Time. Schedule subject to change.

–
Coffee and Check-in
–
Opening Remarks
–
Dawn in the age of quantum fault tolerance
Stephen Bartlett (University of Sydney)
–
Break
–
Halving the cost of surface codes by running error correction at the logical level
Mike Newman (Google)
–
Fault tolerance with the ZX-calculus and fusion complexes: tools for QEC development in the hardware-focussed regime
Naomi Nickerson (PsiQuantum)
–
Lunch (on your own)
–
Scheduling syndrome measurement circuits
Andrew Cross (IBM)
–
QEC demonstrations leveraging dynamic circuits
Maika Takita (IBM Quantum)
–
Break
–
Quantum Lego: Quantum Codes and their Enumerators from Tensor Networks
Brad Lackey (Microsoft)
–
How to fault-tolerantly realize any quantum circuit with local operations
Shin Ho Choe (Technical University of Munich)
–
Reception
–
Coffee and Check-in
–
From randomized benchmarking to cycle error reconstruction
Joseph Emerson (IQC, University of Waterloo, and Quantum Benchmark Inc.)
–
Break
–
Emergence of Universal Randomness in Quantum Many-body Dynamics
Soonwon Choi (MIT)
–
Using chaos to characterize a programmable analog quantum simulator
Adam Shaw (Caltech)
–
Lunch (on your own)
–
Fundamental limits to quantum computation
Jens Eisert (Freie Universität Berlin)
–
Break
–
Evidence for the utility of quantum computing before fault tolerance
Kristan Temme (IBM)
–
High-fidelity and Fault-tolerant Teleportation of a Logical Qubit on a Trapped-ion Quantum Computer
Natalie Brown (Quantinuum)
–
Coffee and Check-in
–
An Overview of Quantum Algorithms
Ashley Montanaro (Phasecraft and University of Bristol)
–
Break
–
Certifying almost all quantum states with few single-qubit measurements
Robert Huang (California Institute of Technology)
–
Learning Shallow Quantum Circuits and Quantum States Prepared by Shallow Circuits in Polynomial Time
Yunchao Liu (UC Berkeley)
–
Lunch (on your own)
–
A Quantum Speed-Up for Approximating the Top Eigenvector of aMatrix via Improved Tomography
András Gilyén (Alfréd Rényi Institute of Mathematics)
–
Break
–
The Virtues of the Quantum Approximate Optimization Algorithm
Edward Farhi (Google)
–
Continuous-time quantum walks for MAX-CUT are hot
Dan Browne (UCL)
–
Coffee and Check-in
–
Circuit Conspiracies
Scott Aaronson (University of Texas at Austin)
–
Break
–
Analog quantum machine learning for near-term hardware
Susanne Yelin (Harvard University)
–
Hardware-efficient quantum computing using qudits
Christine Muschik (Waterloo)
–
Lunch (on your own)
–
Probing the limits of classical computing with arbitrarily connected quantum circuits
Michael Foss Feig (UMD)
–
Break
–
Exploring the quantum computing frontier with reconfigurable atom arrays
Mikhail Lukin (Harvard University)
–
Panel Discussion on Quantum Advantage (Chair: Bill Fefferman)
–
Coffee and Check-in
–
On Scrambling Times of Quantum Systems, Including Black Holes
Peter Shor (Massachusetts Institute of Technology)
–
Break
–
A NASA Perspective on Quantum Computing, with Emphasis on Recent Results in Distributed Computing
Eleanor Rieffel (NASA Ames Research Center)
–
Quantum neural networks
Kerstin Beer (Macquarie University)
–
Lunch (on your own)
–
Classical algorithm for simulating experimental Gaussian boson sampling
Changhun Oh (University of Chicago)
–
End of Workshop Coffee Break