Hi! I am a second-year PhD student at MIT, where I am very fortunate to be advised by Vinod Vaikuntanathan. I am broadly interested in cryptography and quantum information.

Previously, I worked as a quantitative research analyst at Citadel Securities. Before that, I completed my undergraduate degree in mathematics at Princeton University in 2021, where I had the pleasure of being advised by Matt Weinberg. See my CV for more information.

Email: first initial last name at mit dot edu

Publications

Indistinguishability Obfuscation from Bilinear Maps and LPN Variants [TCC] [ePrint]
with Neekon Vafa and Vinod Vaikuntanathan
TCC 2024

Space-Efficient and Noise-Robust Quantum Factoring [CRYPTO] [arXiv] [ePrint]
with Vinod Vaikuntanathan
CRYPTO 2024
Best Paper Award, invited to the Journal of Cryptology
Mentioned in Quanta Magazine and MIT News

On the cut-query complexity of approximating max-cut [ICALP] [arXiv]
with Orestis Plevrakis and Matt Weinberg
ICALP 2024

A proof of the triangular Ashbaugh-Benguria-Payne–Pólya–Weinberger inequality [JST] [arXiv]
with Ryan Arbon, Mohammed Mannan, and Michael Psenka
Journal of Spectral Theory, 2022

Morphology-Aware Meta-Embeddings for Tamil [NAACL]
with Arjun Sai Krishnan
NAACL Student Research Workshop, 2021

Manuscripts

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth [arXiv] [ePrint]
with Greg Kahanamoku-Meyer, Vinod Vaikuntanathan, and Katherine Van Kirk

Cloning Games, Black Holes and Cryptography [arXiv] [ePrint]
with Alex Poremba and Vinod Vaikuntanathan

Regev Factoring Beyond Fibonacci: Optimizing Prefactors [ePrint]

Talks

Indistinguishability Obfuscation from Bilinear Maps and LPN Variants

• MIT CIS Seminar (September 2024)

Space-Efficient and Noise-Robust Quantum Factoring

• CRYPTO 2024 (August 2024)
• IBM Quantum Seminar (November 2023)
• Yale Quantum Institute (November 2023)

The Cut-Query Complexity of Approximating Max-Cut

• ICALP 2024 (July 2024)