Power and limitations of quantum computation and quantum cryptography by Dr. Srijita Kundu

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 and cryptography. I focus on proving what quantum computation can and cannot do in concrete models such as query and communication complexity. In this talk, I will share results in both directions:
1. I will talk about direct product theorems for quantum communication complexity, which are a useful lower bound technique for quantum communication protocols.
2. I will talk about quantum proofs being more powerful than classical proofs in query complexity.
Additionally, I will talk about quantum protocols for novel cryptographic tasks such as certified deletion and uncloneable encryption, whose security can be proved using the communication direct product theorems.

Short Bio: Srijita Kundu completed her PhD at the Centre for Quantum Technologies in the National University of Singapore in 2021, under the supervision of Prof. Rahul Jain. Since 2022, she has been a postdoctoral researcher at the Institute for Quantum Computing in the University of Waterloo. She is interested in quantum complexity theory and cryptography.