Power and Limitations of the QAOA

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,900
Published on ● Video Link: https://www.youtube.com/watch?v=jDl8n7wMSWk


Duration: 32:54
2,811 views
55

Adam Bouland (UC Berkeley)
https://simons.berkeley.edu/talks/tbd-132
Quantum Algorithms



Other Videos By Simons Institute for the Theory of Computing


2020-02-28Recent Advances in Quantum Simulation with Applications to Chemistry and Field Theory
2020-02-28Techniques for Hamiltonian Simulation and Beyond
2020-02-27Estimating the Fault Tolerant Cost of Classically Intractable Quantum Computations
2020-02-27Quantum Distributed Algorithms: Recent Results
2020-02-27Path Detection: A Quantum Computing Primitive
2020-02-27Experimentally Scaling Up Variational Quantum Simulations of Fermions
2020-02-27Prospects for Quantum Computers in Chemistry and Materials Science
2020-02-27Reducing Costs for Quantum Chemistry on NISQ Computers
2020-02-26Using Post-Supremacy Quantum Devices for Practical Applications
2020-02-26Classical Algorithms for Quantum Mean Values
2020-02-26Power and Limitations of the QAOA
2020-02-26The Quantum Approximate Optimization Algorithm: Recent Results
2020-02-25Quantum Algorithms on Convex Bodies
2020-02-25Quantum Algorithms for Second-Order Cone Programming
2020-02-25Faster Quantum and Classical SDP Approximations for Quadratic Binary Optimization
2020-02-25A Classical Algorithm Framework for Dequantizing Quantum Machine Learning
2020-02-25Randomized Algorithms in Linear Algebra
2020-02-25How Hard Is It to Train Variational Quantum Circuits?
2020-02-25Quantum Machine Learning: Prospects and Challenges
2020-02-24Drinfeld Modules are not for Isogeny Based Cryptography
2020-02-24On Quantum Attacks to the Code-Equivalence Problem


Tags:
Quantum Algorithms
UC Berkeley
Computer Science
Theoretical Computer Science
Theory of Computation
Theory of Computing
Simons Institute
Adam Bouland