Synthesis and Arithmetic of Quantum Circuits
Bharti 501 IIT Campus, Hauz Khas, New DelhiSpeaker: 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… Read More »Synthesis and Arithmetic of Quantum Circuits