Welcome! I am a third-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
Recent News
- March 2026: I gave a talk at QuEra on recent work by Greg Kahanamoku-Meyer, Katherine Van Kirk, and myself on improving the concrete costs of Regev’s factoring algorithm. Slides (which Avengers fans may enjoy) are available here.
- February 2026: I gave a talk at the BU Security Seminar on constructions and applications of information-theoretic private information retrieval. Slides are available here.
- February 2026: Alexandra Henzinger, Ted Pyne, and I uploaded a manuscript drawing a connection between information-theoretic private information retrieval and the tree evaluation problem. See pages 183-198 of these slides for a teaser!
- December 2025: Sid Jain, Sascha Schmidhuber, Noah Shutty, and I recently organised a workshop at FOCS 2025 on Breaking and Making Quantum Speedups.
- November 2025: I’m very excited to be interning at Google Quantum AI with Noah Shutty in summer 2026!
Resources
If you are interested in learning about quantum algorithms, I hope some of the below slides might be useful!
- Sid Jain and I gave an introductory tutorial for a workshop at FOCS 2025. We start from classic ideas underlying Shor’s integer factoring algorithm and Grover’s search algorithm, and outline how principles from these have been extended to yield new quantum algorithms in recent years. Slides are available here.
- For a less technical and higher-level overview of what we know about quantum algorithms for factoring integers, see these slides or this video recording.
- If you are a mathematician or number theorist, you might find these slides more beneficial. A key open problem highlighted here is that of finding better classical algorithms for factoring integers of the form $N = P^2Q$ where $P, Q$ are primes and $Q \ll P$. As far as I know, the current state of the art is due to this paper by Erik Mulder.
Publications
Two-Server Private Information Retrieval in Sublinear Time and Quasilinear Space [ePrint] [code]
with Alexandra Henzinger
Eurocrypt 2026
Parallel Spooky Pebbling Makes Regev Factoring More Practical [arXiv] [ePrint] [code]
with Greg Kahanamoku-Meyer and Katherine Van Kirk
Eurocrypt 2026, QIP 2026
Cloning Games, Black Holes and Cryptography [arXiv] [ePrint] [ITCS]
with Alex Poremba and Vinod Vaikuntanathan
ITCS 2026, QIP 2026
The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth [arXiv] [ePrint] [STOC]
with Greg Kahanamoku-Meyer, Vinod Vaikuntanathan, and Katherine Van Kirk
STOC 2025, QIP 2026
Featured on Lakshmi Chandrasekaran’s blog
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants [ePrint] [TCC]
with Neekon Vafa and Vinod Vaikuntanathan
TCC 2024
Featured on Lakshmi Chandrasekaran’s blog
Space-Efficient and Noise-Robust Quantum Factoring [Journal of Cryptology] [public PDF link]
with Vinod Vaikuntanathan
Journal of Cryptology, merge of the following two papers:
- Space-Efficient and Noise-Robust Quantum Factoring [arXiv] [ePrint] [CRYPTO]
CRYPTO 2024
Best Paper Award
Mentioned in Quanta Magazine and MIT News - Regev Factoring Beyond Fibonacci: Optimizing Prefactors [ePrint]
On the cut-query complexity of approximating max-cut [arXiv] [ICALP]
with Orestis Plevrakis and Matt Weinberg
ICALP 2024
A proof of the triangular Ashbaugh-Benguria-Payne–Pólya–Weinberger inequality [arXiv] [JST] [code]
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
Catalytic Tree Evaluation From Matching Vectors [arXiv] [ECCC] [ePrint]
with Alexandra Henzinger and Ted Pyne
Talks
Parallel Spooky Pebbling Makes Regev Factoring More Practical [slides made jointly with Greg and Katherine]
- QuEra Computing (March 2026)
Quantum Algorithms, Old and New [slides]
- FOCS 2025, tutorial for a workshop on Breaking and Making Quantum Speedups (December 2025, with Sid Jain)
Two-Server Private Information Retrieval in Sublinear Time and Quasilinear Space [latest slides]
- Boston University Security Seminar (February 2026, slides)
- MIT CIS Seminar (November 2025, with Alexandra Henzinger, slides)
- MIT Simple Person’s Applied Mathematics Seminar (October 2025)
The Jacobi Factoring Circuit: Classically Hard Factoring in Sublinear Quantum Space and Depth [latest slides]
- Virginia Tech Quantum Seminar (February 2026, slides)
- IQM Quantum Machine Learning Seminar (February 2026, slides)
- QIP 2026 (January 2026, with Katherine Van Kirk, slides)
- Tufts Quantum Computing Seminar (September 2025)
- UNSW Number Theory Days (August 2025, slides)
- Ruhr University Bochum Quantum Information Workshop (April 2025)
- Simons Institute Quantum Colloquium (March 2025, slides, video)
- MIT Quantum Information Seminar (March 2025)
- CMU Theory Seminar (March 2025)
Cloning Games, Black Holes and Cryptography [slides]
- QIP 2026 (January 2026)
- Kyoto University Quantum Cryptography Workshop (October 2025, video)
- CMU CyLab Crypto Seminar (March 2025, video)
Factoring with a Quantum Computer: The State of the Art [latest slides]
- University of Technology Sydney (August 2025, slides)
- University of Sydney (August 2025)
- QuEra Computing (April 2025, with Greg Kahanamoku-Meyer and Katherine Van Kirk)
- MIT Schwarzman College of Computing Cryptography and Security Day (January 2025, slides, video)
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants [slides]
- MIT CIS Seminar (September 2024)
Space-Efficient and Noise-Robust Quantum Factoring [slides]
- CRYPTO 2024 (August 2024)
- IBM Quantum Seminar (November 2023)
- Yale Quantum Institute (November 2023)
The Cut-Query Complexity of Approximating Max-Cut [slides]
- ICALP 2024 (July 2024)
Teaching and Service
- Program Committee Member, QIP 2026
- Teaching Assistant, 6.1200 Mathematics for Computer Science (MIT, Fall 2025)
- Teaching Assistant, COS 445 Economics and Computing (Princeton, Spring 2019)