–
Coffee and Check In
–
Welcome Remarks
–
Quantum Machine Learning: Prospects and Challenges
Iordanis Kerenidis (CNRS / QC Ware)
–
How Hard Is It to Train Variational Quantum Circuits?
Xiaodi Wu (University of Maryland)
–
Break
–
Randomized Algorithms in Linear Algebra
Ravi Kannan (Microsoft Research India)
–
A Classical Algorithm Framework for Dequantizing Quantum Machine Learning
Ewin Tang (University of Washington)
–
Discussion on Quantum Machine Learning
–
Lunch
–
Faster Quantum and Classical SDP Approximations for Quadratic Binary Optimization
Richard Kueng (Caltech)
–
Quantum Algorithms for Second-Order Cone Programming
Anupam Prakash (QC Ware)
–
Break
–
Quantum Algorithms on Convex Bodies
Tongyang Li (University of Maryland)
–
Reception
–
Coffee and Check In
–
The Quantum Approximate Optimization Algorithm: Recent Results
Edward Farhi (Google)
–
Power and Limitations of the QAOA
Adam Bouland (UC Berkeley)
–
Classical Algorithms for Quantum Mean Values
David Gosset (University of Waterloo)
–
Break
–
Discussion on Optimization
–
Lunch
–
Lightning Talks
–
Break
–
Using Post-Supremacy Quantum Devices for Practical Applications
Jarrod McClean (Google)
–
Coffee and Check In
–
Prospects for Quantum Computers in Chemistry and Materials Science
Garnet Chan (Caltech)
–
Reducing Costs for Quantum Chemistry on NISQ Computers
Birgitta Whaley (UC Berkeley)
–
Experimentally Scaling Up Variational Quantum Simulations of Fermions
Ryan Babbush (Google)
–
Break
–
Discussion on Chemistry
–
Lunch
–
Path Detection: A Quantum Computing Primitive
Shelby Kimmel (Middlebury College)
–
Quantum Distributed Algorithms: Recent Results
François Le Gall (Nagoya University)
–
Break
–
Estimating the Fault Tolerant Cost of Classically Intractable Quantum Computations
Craig Gidney (Google)
–
Coffee and Check In
–
Techniques for Hamiltonian Simulation and Beyond
András Pál Gilyén (Caltech)
–
Recent Advances in Quantum Simulation with Applications to Chemistry and Field Theory
Nathan Wiebe (University of Washington)
–
Break
–
Discussion on Hamiltonian Simulation
–
Lunch
–
Exponential Separation Between Shallow Quantum Circuits and Unbounded Fan-In Shallow Classical Circuits
Robin Kothari (Microsoft Research)
–
Quantum Hardness of Learning Shallow Classical Circuits
Aarthi Sundaram (Microsoft)
–
Final Discussions and Coffee