AQC 2016 - Quantum Monte Carlo vs Tunneling vs. Adiabatic Optimization

Channel:
United States Google TechTalks
Subscribers:
348,000
Published on ● Video Link: https://www.youtube.com/watch?v=t8BPaY06XCo


Duration: 36:46
1,753 views
21

A Google TechTalk, June 27, 2016, presented by Aram Harrow (MIT)
ABSTRACT: Can quantum adiabatic evolution solve optimization problems much faster than classical computers? One piece of evidence for this has been their apparent advantage in "tunneling" through barriers to escape local minima. However, I will argue that quantum Monte Carlo is at most polynomially slower than stochastic quantum adiabatic optimization under a wide variety of settings. I will then discuss some prospects for demonstrating quantum supremacy with a near-term quantum computer. I will explain the difficulties in achieving this using adiabatic evolution and will explain the possibility of achieving this with low-depth quantum circuits.

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 - Scaling Analysis & Instantons for Thermally-Assisted Tunneling and Quantum MC Simulations
2016-10-20AQC 2016 - The Quantum Spin Glass Transition on the Regular Random Graph
2016-10-20AQC 2016 - A Fully-Programmable Measurement-Feedback OPO Ising Machine with All-to-All Connectivity
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


Tags:
google techtalk
quantum computing