Seminar • Algorithms and Complexity • Synthesis and Arithmetic of Quantum Circuits

Please note: This seminar will take place on DC 1304 and online.

Amolak Ratan Kalra, PhD candidate
Institute for Quantum Computing, University of Waterloo

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 of our more recent results that build on this connection.

To attend this seminar in person, please go to DC 1304. You can also attend virtually on Zoom.