Synthesis and Arithmetic of Quantum Circuits

Speaker: Amolak Kalra (https://sites.google.com/view/amolakratankalra/home)

Abstract: Efficient decomposition of a unitary operator U using words from a universal gate set G is a fundamental problem in quantum computing. The process by which this is achieved is called circuit synthesis. This problem arises naturally in the context of quantum circuit
compilation. In this talk, I will introduce this problem and explain how one can use tools from number theory to solve it. I will then explain some recent results that build on this connection.