Abstract:Quantum algorithms can solve some problems exponentially faster than classical algorithms, and the quantum computers that can run them are rapidly getting better. However, implementing a quantum algorithm on a quantum computer is a difficult task that could use some tool support.Such tools are emerging and more are needed, particularly forcompilation and optimization of quantum programs.The challenge is to design tools that run in polynomial time, which is in contrast to simulation which takes exponential time, in general.I will present recent algorithms and tools forscalable compilation and optimization of quantum programs.Bio:Jens Palsberg is a Professor and former Department Chair of Computer Science atUniversity of California, Los Angeles (UCLA). His research interests span the areas of programming languages,software engineering, and quantum computing. He is the director of the UCLA-Amazon Science Hub forHumanity and Artificial Intelligence, an associate editor of ACM Transactions on Quantum Computing, anda member of the ACM Executive Committee. In 2012 he received the ACM SIGPLAN Distinguished Service Award, andin 2023 he received an Excellence in Teaching Award at UCLA for his courses on quantum computing.