AQC - 2016 Quantum vs. Classical Optimization - A Status Report on the Arms Race

Subscribers:
348,000
Published on ● Video Link: https://www.youtube.com/watch?v=YILfnhUeT7E



Duration: 38:17
3,099 views
43


A Google TechTalk, June 27, 2016, presented by Helmut Katzgraber (Texas A&M)
ABSTRACT: To date, a conclusive detection of quantum speedup remains elusive. However, recent results from quantum Monte Carlo simulations, as well as the D-Wave 2X quantum annealer show a scaling that clearly outperforms state-of-the-art classical simulated annealing. In this talk an overview of recent benchmarks, as well as attempts to "tickle" any quantumness out of quantum annealing machines is given. Furthermore, we present a generic framework to validate benchmarks and to detect parameter regimes where quantum annealing might excel over classical heuristics. As such, we provide capabilities to aide in the search for the "killer" application for quantum optimization technologies. Finally, an overview of different sequential, non-tailored, as well as specialized tailored classical state-of-the-art algorithms is given. Current quantum annealing technologies must outperform these to claim the crown in the race for quantum speedup.

Presented at the Adiabatic Quantum Computing Conference, June 26-29, 2016, at Google's Los Angeles office.




Other Videos By Google TechTalks


2016-10-20AQC 2016 - Origin and Suppression of 1/f Magnetic Flux Noise
2016-10-20AQC 2016 - Building Quantum Annealer v2.0
2016-10-20AQC 2016 - Roadmap for Building a Quantum Computer
2016-10-20AQC 2016 - Driving Spin Systems with Noisy Control Fields: Limits to Adiabatic Protocol
2016-10-20AQC 2016 - An Optimal Stopping Approach for Benchmarking Probabilistic Optimizers
2016-10-20AQC 2016 - Quantum Annealing via Environment-Mediated Quantum Diffusion
2016-10-20AQC 2016 - Inhomogeneous Quasi-adiabatic Driving of Quantum Critical Dynamics
2016-10-20AQC 2016 - Quantum Monte Carlo vs Tunneling vs. Adiabatic Optimization
2016-10-20AQC 2016 - Simulated Quantum Annealing Can Be Exponentially Faster Than Classical
2016-10-20AQC 2016 - Quantum Monte Carlo Simulations and Quantum Annealing
2016-10-20AQC - 2016 Quantum vs. Classical Optimization - A Status Report on the Arms Race
2016-10-20AQC 2016 - What is the Computational Value of Finite Range Tunneling?
2016-10-20AQC 2016 - Opening Remarks: Why We Believe Quantum Annealing Will Succeed
2016-10-14Tracing Android
2016-10-12Programming Line-Rate Routers
2016-09-15Grammatical Framework: Formalizing the Grammars of the World
2016-09-06ZuriHac2016: Parallelizing and Distributing Scientific Software in Haskell
2016-09-06ZuriHac 2016 - Meet Hadrian: A New Build System for GHC
2016-09-06ZuriHac 2016: Generic (and type-level) Programming with Generics-sop
2016-09-06ZuriHac 2016 - Low-level Haskell: An Interactive Tour Through the STG
2016-09-06ZuriHac 2016: Monad Homomorphisms



Tags:
google techtalk
quantum computing