Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States. - Chinmay Nirkhe; Umesh V. Vazirani; Henry Yuen (ICALP, 2018)

"Quantum Supremacy" and the Complexity of Random Circuit Sampling. - Adam Bouland; Bill Fefferman; Chinmay Nirkhe; Umesh V. Vazirani (ITCS, 2019)

Good approximate quantum LDPC codes from spacetime circuit Hamiltonians. - Thomas C. Bohdanowicz; Elizabeth Crosson; Chinmay Nirkhe; Henry Yuen (STOC, 2019)

Quantum Search-To-Decision Reductions and the State Synthesis Problem. - Sandy Irani; Anand Natarajan 001; Chinmay Nirkhe; Sujit Rao; Henry Yuen (CCC, 2022)

Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians. - Anurag Anshu; Chinmay Nirkhe (ITCS, 2022)

The Parametrized Complexity of Quantum Verification. - Srinivasan Arunachalam; Sergey Bravyi 001; Chinmay Nirkhe; Bryan O'Gorman (TQC, 2022)

The Parameterized Complexity of Quantum Verification. - Srinivasan Arunachalam; Sergey Bravyi 001; Chinmay Nirkhe; Bryan O'Gorman (CoRR, 2022)

Lower bounds on the complexity of quantum proofs - Chinmay Nirkhe (2022)

A Distribution Testing Oracle Separating QMA and QCMA. - Anand Natarajan 001; Chinmay Nirkhe (CCC, 2023)

NLTS Hamiltonians from Good Quantum Codes. - Anurag Anshu; Nikolas P. Breuckmann; Chinmay Nirkhe (STOC, 2023)

The status of the quantum PCP conjecture (games version). - Anand Natarajan 001; Chinmay Nirkhe (CoRR, 2024)

On the hardness of cloning and connections to representation theory. - Vojtech Havlícek; Chinmay Nirkhe (CoRR, 2024)

A distribution testing oracle separation between QMA and QCMA. - Anand Natarajan 001; Chinmay Nirkhe (Quantum, 2024)