🚧 This webpage is currently under construction, so please forgive the noise! 🚧


I am a fourth-year Ph.D. candidate in theoretical computer science at Princeton University where I’m fortunate to be co-advised by Professors Ran Raz and Mark Zhandry.

My research interests lie in the areas of quantum information, cryptography, and complexity theory, and more generally at the intersections of physics, information, and computation.

In the past (before starting my Ph.D.), I have also done research in electrical engineering, experimental physics, machine learning, and computational neuroscience.

I am a co-founder and the core maintainer of TigerPath, a web app now used by thousands of Princeton undergraduate students to plan their four-year schedules. It was written about in the Daily Princetonian.


My research examines the power of quantum computation and quantum information in two contexts:

Quantum Cryptography

How can we use quantum states and quantum information to produce cryptographic primitives and constructions that would not be possible with only classical information? What kinds of cryptographic objects only arise out of the marriage of both the guarantees of quantum no-go theorems and the efficiency assumptions of computational complexity?

Quantum Complexity Theory

How are the capabilities of interacting systems affected by the presence of quantum information? Can we use the power given by quantum no-go theorems to give rise to stronger guarantees on the resources required to perform interactive computation?




I am very friendly, so feel free to reach out to me at