Speaker
Dr
Ethan Epperly
(UC Berkeley)
Description
The fundamental building blocks of iterative linear algebra algorithms in ordinary digital computation are matrix–vector multiplications and inner products. In quantum computing, we lose easy access to both primitives. But we also gain replacements. Instead of matrix–vector products, we can apply the unitary time evolution operator $e^{-itA}$, and we have access to noisy—but statistically unbiased—measurements of inner products. How can we solve linear algebra problems with these primitives? What is the greatest possible accuracy achievable? This talk will address these questions with a focus on eigenvalue problems and on the presenter's own research. No prior knowledge of quantum computing is expected.
Author
Dr
Ethan Epperly
(UC Berkeley)