Math Analysis Seminar: Quantum Algorithms

Tuesday, October 30, 2018

3:00 PM-4:00 PM

Brian Allen, United States Military Academy

Title: Understanding the Complexity of Quantum Algorithms Through Riemannian Geometry

Abstract: Almost ten years ago Nielsen, Dowling, Gu, and Doherty discovered an exciting relationship between the complexity of quantum algorithms and the geodesics of a particular Riemannian metric on the space of unitary matrices. In this talk we will explore this beautiful connection by surveying the basics of quantum computing, discussing the concept of complexity of quantum algorithms, and lastly giving the big ideas behind the connection to geometry. No particular knowledge of quantum computing or Riemannian geometry will be assumed.

Contact Information

Hugo Woerdeman
hugo@math.drexel.edu