[Quantum Seminar] Marek Gluza | New quantum algorithms based on Riemannian optimization скачать в хорошем качестве

[Quantum Seminar] Marek Gluza | New quantum algorithms based on Riemannian optimization

New quantum algorithms based on Riemannian optimization Abstract. I will show how basic aspects of the Riemannian geometry of the unitary group such as its curvature, tangent space and dense covering can guide the design of quantum algorithms. For this, we will derive an explicit formula for tangential gradients of linear cost functions which will show that corresponding state updates are in form of exponentials of commutators. Such unitary operations can be systematically implemented on quantum computers using the framework of double-bracket quantum algorithms which recently resulted in generalizations of the paradigmatic Grover's algorithm and new unitary synthesis formulas for implementing quantum signal processing. I will summarize the results of an ongoing collaboration developing this approach and I hope that at the end of the talk you will feel that knowing linear algebra is enough to take up designing quantum algorithms yourself. Slides https://slides.com/marekgluza/overvie... About. https://scholar.google.com/citations?... Host. IIIT Hyderabad