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… Read More »Synthesis and Arithmetic of Quantum Circuits

Speaker: Surbhi Rajput, MSR Student, CSE Dept., IIT Delhi Abstract: In the (single stock) \emph{trading prophet} problem formulated by Correa et al.\ , an online algorithm observes a sequence of prices of a stock. At each step, the algorithm can either buy the stock by paying the current price if it doesn't already hold the… Read More »Trading Prophets: How to trade multiple stocks optimally

Title: Power and limitations of quantum computation and quantum cryptography Speaker: Dr. Srijita Kundu Abstract: Quantum computers are approaching practical viability, and quantum cryptography is already being deployed for secure communication. Understanding the capabilities and limitations of these technologies is crucial for their effective use. My research lies at the intersection of quantum complexity theory… Read More »Power and limitations of quantum computation and quantum cryptography by Dr. Srijita Kundu