PhD Defence: Agustín Borgna

Jan 13 15:00 ₂₀₂₃

Abstract: The advent of quantum computers capable of solving problems that are intractable on classical computers has motivated the development of new programming languages and tools for quantum computing. However, the current state of the art in quantum programming is still in its infancy.

In this thesis, we present a series of novel approaches to different aspects of the quantum compilation process based on the ZX calculus. First, we introduce a new intermediate representation for quantum programs capable of encoding bounded recursion and repeated circuit structures in a compact way, based on families of the Scalable extension to the ZX calculus. We then present a compilation algorithm for hybrid circuits containing both quantum and classical gates, based on the pure circuit optimization by Duncan et al. Finally, we define the problem of detecting sections of a quantum circuit that can be translated to classical logic, and introduce an heuristic algorithm to solve it.