Quantum Algorithms

Program

The Quantum Wave in Computing

Location

Calvin Lab Auditorium

Date

Tuesday, Feb. 25 – Friday, Feb. 28, 2020

Back to calendar

9 – 9:20 a.m.

Coffee and Check In

9:20 – 9:30 a.m.

Welcome Remarks

9:30 – 10 a.m.

Quantum Machine Learning: Prospects and Challenges

Iordanis Kerenidis (CNRS / QC Ware)

10 – 10:30 a.m.

How Hard Is It to Train Variational Quantum Circuits?

Xiaodi Wu (University of Maryland)

10:30 – 10:45 a.m.

Break

10:45 – 11:15 a.m.

Randomized Algorithms in Linear Algebra

Ravi Kannan (Microsoft Research India)

11:15 – 11:45 a.m.

A Classical Algorithm Framework for Dequantizing Quantum Machine Learning

Ewin Tang (University of Washington)

11:45 a.m. – 12:30 p.m.

Discussion on Quantum Machine Learning

12:30 – 2 p.m.

Lunch

2 – 2:30 p.m.

Faster Quantum and Classical SDP Approximations for Quadratic Binary Optimization

Richard Kueng (Caltech)

2:30 – 3 p.m.

Quantum Algorithms for Second-Order Cone Programming

Anupam Prakash (QC Ware)

3 – 3:30 p.m.

Break

3:30 – 4 p.m.

Quantum Algorithms on Convex Bodies

Tongyang Li (University of Maryland)

4 – 5 p.m.

Reception

9 – 9:30 a.m.

Coffee and Check In

9:30 – 10 a.m.

The Quantum Approximate Optimization Algorithm: Recent Results

Edward Farhi (Google)

10 – 10:30 a.m.

Power and Limitations of the QAOA

Adam Bouland (UC Berkeley)

10:30 – 11 a.m.

Classical Algorithms for Quantum Mean Values

David Gosset (University of Waterloo)

11 – 11:15 a.m.

Break

11:15 a.m. – 12 p.m.

Discussion on Optimization

12 – 2 p.m.

Lunch

2 – 3 p.m.

Lightning Talks

3 – 3:30 p.m.

Break

3:30 – 4 p.m.

Using Post-Supremacy Quantum Devices for Practical Applications

Jarrod McClean (Google)

9 – 9:30 a.m.

Coffee and Check In

9:30 – 10 a.m.

Prospects for Quantum Computers in Chemistry and Materials Science

Garnet Chan (Caltech)

10 – 10:30 a.m.

Reducing Costs for Quantum Chemistry on NISQ Computers

Birgitta Whaley (UC Berkeley)

10:30 – 11 a.m.

Experimentally Scaling Up Variational Quantum Simulations of Fermions

Ryan Babbush (Google)

11 – 11:15 a.m.

Break

11:15 a.m. – 12 p.m.

Discussion on Chemistry

12 – 2 p.m.

Lunch

2 – 2:30 p.m.

Path Detection: A Quantum Computing Primitive

Shelby Kimmel (Middlebury College)

2:30 – 3 p.m.

Quantum Distributed Algorithms: Recent Results

François Le Gall (Nagoya University)

3 – 3:30 p.m.

Break

3:30 – 4 p.m.

Estimating the Fault Tolerant Cost of Classically Intractable Quantum Computations

Craig Gidney (Google)

9 – 9:30 a.m.

Coffee and Check In

9:30 – 10:15 a.m.

Techniques for Hamiltonian Simulation and Beyond

András Pál Gilyén (Caltech)

10:15 – 11 a.m.

Recent Advances in Quantum Simulation with Applications to Chemistry and Field Theory

Nathan Wiebe (University of Washington)

11 – 11:15 a.m.

Break

11:15 a.m. – 12 p.m.

Discussion on Hamiltonian Simulation

12 – 2 p.m.

Lunch

2 – 2:30 p.m.

Exponential Separation Between Shallow Quantum Circuits and Unbounded Fan-In Shallow Classical Circuits

Robin Kothari (Microsoft Research)

2:30 – 3 p.m.

Quantum Hardness of Learning Shallow Classical Circuits

Aarthi Sundaram (Microsoft)

3 – 3:30 p.m.

Final Discussions and Coffee