Quantum Algorithms and Complexity

Speaker

Anargyros Papageorgiou

Abstract

We introduce quantum algorithms and discuss their potential advantages relative to classical algorithms. We are interested in problems in science and engineering which are solved numerically and therefore approximately. We pay special attention to quantum algorithms for ground state eigenvalue estimation and the solution of the Poisson equation and compare them to their classical counterparts.