Workshops

Spring 2020

Quantum Algorithms

Feb 25, 2020 to Feb 28, 2020

Return to event »

Tuesday, February 25th, 2020
9:00 am–9:20 am		Coffee and Check In
9:20 am–9:30 am		Welcome Remarks
9:30 am–10:00 am		Quantum Machine Learning: Prospects and Challenges Iordanis Kerenidis (CNRS / QC Ware)
10:00 am–10:30 am		How Hard Is It to Train Variational Quantum Circuits? Xiaodi Wu (University of Maryland)
10:30 am–10:45 am		Break
10:45 am–11:15 am		Randomized Algorithms in Linear Algebra Ravi Kannan (Microsoft Research India)
11:15 am–11:45 am		A Classical Algorithm Framework for Dequantizing Quantum Machine Learning Ewin Tang (University of Washington)
11:45 am–12:30 pm		Discussion on Quantum Machine Learning
12:30 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Faster Quantum and Classical SDP Approximations for Quadratic Binary Optimization Richard Kueng (Caltech)
2:30 pm–3:00 pm		Quantum Algorithms for Second-Order Cone Programming Anupam Prakash (QC Ware)
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Quantum Algorithms on Convex Bodies Tongyang Li (University of Maryland)
4:00 pm–5:00 pm		Reception

Wednesday, February 26th, 2020
9:00 am–9:30 am		Coffee and Check In
9:30 am–10:00 am		The Quantum Approximate Optimization Algorithm: Recent Results Edward Farhi (Google)
10:00 am–10:30 am		Power and Limitations of the QAOA Adam Bouland (UC Berkeley)
10:30 am–11:00 am		Classical Algorithms for Quantum Mean Values David Gosset (University of Waterloo)
11:00 am–11:15 am		Break
11:15 am–12:00 pm		Discussion on Optimization
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Lightning Talks
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Using Post-Supremacy Quantum Devices for Practical Applications Jarrod McClean (Google)

Thursday, February 27th, 2020
9:00 am–9:30 am		Coffee and Check In
9:30 am–10:00 am		Prospects for Quantum Computers in Chemistry and Materials Science Garnet Chan (Caltech)
10:00 am–10:30 am		Reducing Costs for Quantum Chemistry on NISQ Computers Birgitta Whaley (UC Berkeley)
10:30 am–11:00 am		Experimentally Scaling Up Variational Quantum Simulations of Fermions Ryan Babbush (Google)
11:00 am–11:15 am		Break
11:15 am–12:00 pm		Discussion on Chemistry
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Path Detection: A Quantum Computing Primitive Shelby Kimmel (Middlebury College)
2:30 pm–3:00 pm		Quantum Distributed Algorithms: Recent Results François Le Gall (Nagoya University)
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Estimating the Fault Tolerant Cost of Classically Intractable Quantum Computations Craig Gidney (Google)

Friday, February 28th, 2020
9:00 am–9:30 am		Coffee and Check In
9:30 am–10:15 am		Techniques for Hamiltonian Simulation and Beyond András Pál Gilyén (Caltech)
10:15 am–11:00 am		Recent Advances in Quantum Simulation with Applications to Chemistry and Field Theory Nathan Wiebe (University of Washington)
11:00 am–11:15 am		Break
11:15 am–12:00 pm		Discussion on Hamiltonian Simulation
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Exponential Separation Between Shallow Quantum Circuits and Unbounded Fan-In Shallow Classical Circuits Robin Kothari (Microsoft Research)
2:30 pm–3:00 pm		Quantum Hardness of Learning Shallow Classical Circuits Aarthi Sundaram (Microsoft)
3:00 pm–3:30 pm		Final Discussions and Coffee