I am a PhD student at UC Berkeley in the EECS Department studying CS Theory. I am advised by Umesh Vazirani. I got my Bachelor's in 2017 from Caltech where I worked on research problems with Thomas Vidick.
My research interests are in theoretical computer science centered around quantum information and hardness of approximation. Some of my favorite research topics are the qPCP Conjecture, Multiprover Interactive Proofs, and Quantum Supremacy.
For an introduction to the current state of affairs in quantum computing, I recommend this manuscript by John Preskill.
[my arXiv page]
Quantum Supremacy and the complexity of Random Circuit Sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani.
Approximate low-weight check codes and circuit lower bounds for noisy ground states
Chinmay Nirkhe, Umesh Vazirani, and Henry Yuen.
[Abstract] [arXiv:1802.07419] Submitted.
Teaching Assistant PositionsCaltech:
- Complexity-theoretic evidence for Random Circuit Sampling (slides) -- UC Berkeley Visit Days, March 2018
- Approximate low weight check codes -- Caltech IQIM, February 2018
- The matrix multiplication tensor (slides) -- Caltech math 10, November 2016
- Quantum pseudo-telepathy games -- Caltech undergraduate math club, November 2016