Hybrid Classical-Quantum Algorithms

Hybrid Classical-Quantum Algorithms

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


Duration: 1:21:27
1,792 views
22

Aram Harrow (MIT)
Quantum Colloquium, January 26th, 2021
https://simons.berkeley.edu/talks/hybrid-classical-quantum-algorithms

Quantum computers offer power to solve some problems that goes far beyond what is possible classically. But classical computers have advantages that are likely to persist: they do not suffer from decoherence, and they can access large data sets. I will describe algorithms for optimization and inference that combine the strengths of both platforms.



Other Videos By Simons Institute for the Theory of Computing


2021-02-02SAT-Solving
2021-02-01SAT-Centered Complexity Theory
2021-01-31Proof Complexity C
2021-01-29Specification, Verification and Synthesis in Cyberphysical Systems
2021-01-29SAT-Solving
2021-01-28Verification and Control of Partially Observable Probabilistic Systems
2021-01-27Games on Graphs: from Logic and Automata to Algorithms
2021-01-27Proof Complexity D
2021-01-27Proof Complexity B
2021-01-27Proof Complexity A
2021-01-27Hybrid Classical-Quantum Algorithms
2021-01-26Introduction to Automata on Infinite Words
2021-01-25Dancing Around SAT 5
2021-01-25Dancing Around SAT 3
2021-01-25Dancing Around SAT 4
2021-01-25Dancing Around SAT 6
2021-01-25Dancing Around SAT 2
2021-01-25Dancing Around SAT 1
2021-01-25A Tutorial on Logic, With an Emphasis on the Connections With Automata Theory
2021-01-22Games: From Logic and Automata to Algorithms 3
2021-01-22Games: From Logic and Automata to Algorithms 2


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing