Главная
Study mode:
on
1
Intro
2
Dequantizing quantum lipear algebra
3
Unifying quantum linear algebra
4
Matrix notation
5
Input/output assumptions of QML
6
Powering up classical computation with measurements
7
Sample and query access
8
Quantum-inspired sketching, aka importance sampling
9
Importance sampling can approximate matrix products
10
All we need are RUR decompositions
11
Main theorem: even singular value transformation
12
Proof sketch of main theprem
13
Interpreting the even SVT result
14
Comparing quantum-inspired SVT to quantum SVT
15
Applications
16
Implications for exponential speedups in QML
Description:
Explore a classical algorithm framework for dequantizing quantum machine learning in this 34-minute lecture by Ewin Tang from the University of Washington. Delve into topics such as quantum linear algebra, matrix notation, input/output assumptions of QML, and the powering up of classical computation with measurements. Examine sample and query access, quantum-inspired sketching, and importance sampling techniques for approximating matrix products. Learn about RUR decompositions and the main theorem on even singular value transformation. Compare quantum-inspired SVT to quantum SVT, and investigate the implications for exponential speedups in quantum machine learning. This talk, part of the Quantum Algorithms series at the Simons Institute, provides valuable insights into the intersection of classical and quantum computational approaches in machine learning.

A Classical Algorithm Framework for Dequantizing Quantum Machine Learning

Simons Institute
Add to list
0:00 / 0:00