Faster Quantum and Classical SDP Approximations for Quadratic Binary Optimization

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


Duration: 29:36
443 views
11

Richard Kueng (Caltech)
https://simons.berkeley.edu/talks/tbd-136
Quantum Algorithms



Other Videos By Simons Institute for the Theory of Computing


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
2020-02-24The Complexity of the Continuous Hidden Subgroup Problem
2020-02-24Overview of Multi-Variate Function Based Public-Key Cryptography and Cryptanalysis
2020-02-24Using Kuperberg's Collimation Sieve to Attack CSIDH
2020-02-24Overview of Attacks on Elliptic Curve Isogenies Based Systems


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Quantum Algorithms
Richard Kueng