Hello, I am a PhD student at UC Berkeley. 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.
Follow me on Twitter!
Papers | Talks | Teaching Assistant Positions
Ph.D. Computer Science
University of California, Berkeley. 2017 -
Research Advisor: Umesh Vazirani.
B.S. Mathematics, B.S. Computer Science
California Institute of Technology. 2013 - 2017
Research Advisor: Thomas Vidick.
[my arXiv page]
"Quantum Supremacy" and the complexity of Random Circuit Sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani.
[Abstract] [arXiv:1803.04402] Submitted.
Approximate low-weight check codes and circuit lower bounds for noisy ground states
Chinmay Nirkhe, Umesh Vazirani, and Henry Yuen.
[Abstract] [arXiv:1802.07419] To appear at ICALP 2018 and TQC 2018.
- "Quantum supremacy" and the complexity of Random Circuit Sampling -- Simons Institute Industry Day Lightning Talks, May 2018
- Approximate low-weight check codes and circuit lower bounds for noisy ground states (slides) -- Stanford Institute for Theoretical Physics Seminar, May 2018
- 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
Teaching Assistant PositionsCaltech: