Hello, I am a PhD candidate in the Theory Group at UC Berkeley. Starting in Dec 2022, I will be a Research Scientist with IBM Quantum. My research interests are in theoretical computer science centered around quantum information and hardness of approximation. Recently, I've been thinking about the quantum PCP conjecture and achievable tasks for noisy quantum devices.
Papers and Talks
All authorships are alphabetically listed and signify equal contribution.
The parametrized complexity of quantum verification
Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, and Bryan O'Gorman.
Quantum search-to-decision and the state synthesis problem
Sandy Irani, Anand Natarajan, Chinmay Nirkhe, Sujit Rao, and Henry Yuen.
QIP 2022. CCC 2022.
[arXiv:2111.02999] [Recorded Talks/Slides]
Circuit lower bounds for low-energy states of quantum code Hamiltonians
Anurag Anshu and Chinmay Nirkhe.
ITCS 2022. QIP 2021.
[arXiv:2011.02044] [Proceedings Version] [Recorded Talks/Slides]
Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
Thom Bohdanowicz, Elizabeth Crosson, Chinmay Nirkhe, and Henry Yuen.
STOC 2019. QIP 2019. QEC 2019.
[arXiv:1811.00277] [Proceedings Version] [Recorded Talks/Slides]
On the complexity and verification of random circuit sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani.
Nature Physics 2018. ITCS 2019. QIP 2019.
[arXiv:1803.04402] [Journal Version] [News Article] [Notes] [Recorded Talks/Slides]
Approximate low-weight check codes and circuit lower bounds for noisy ground states
Chinmay Nirkhe, Umesh Vazirani, and Henry Yuen.
ICALP 2018. TQC 2018.
[arXiv:1802.07419] [Proceedings Version] [Recorded Talks/Slides]