Analysis Seminar: "Wasserstein distance and its application in quantum circuit complexity"

Speaker: Kaifeng Bu, Harvard University

Abstract: Quantum circuit complexity—a measure of the minimum number of gates needed to implement a given unitary transformation—is a fundamental concept in quantum computation, with widespread applications ranging from determining the running time of quantum algorithms to understanding the physics of black holes. In this talk, I will introduce our recent results on quantum circuit complexity via quantum resource and Wasserstein distance. Moreover, I will also talk about the connection between quantum version of Wasserstein distance and quantum relative entropy, the quantum version of Fourier entropy influence inequality, and their applications in quantum computation.

Host: Walton Green