Chinmay Nirkhe
Chinmay Nirkhe
IBM Research
Verified email at - Homepage
Cited by
Cited by
On the complexity and verification of quantum random circuit sampling
A Bouland, B Fefferman, C Nirkhe, U Vazirani
Nature Physics 15 (2), 159-163, 2019
NLTS Hamiltonians from good quantum codes
A Anshu, NP Breuckmann, C Nirkhe
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1090-1096, 2023
Approximate low-weight check codes and circuit lower bounds for noisy ground states
C Nirkhe, U Vazirani, H Yuen
45th International Colloquium on Automata, Languages, and Programming …, 2018
Quantum search-to-decision reductions and the state synthesis problem
S Irani, A Natarajan, C Nirkhe, S Rao, H Yuen
37th Computational Complexity Conference (CCC 2022) 234 (5), 5:1--5:19, 2022
Circuit lower bounds for low-energy states of quantum code Hamiltonians
A Anshu, C Nirkhe
arXiv preprint arXiv:2011.02044, 2020
Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
TC Bohdanowicz, E Crosson, C Nirkhe, H Yuen
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
The Parameterized Complexity of Quantum Verification
S Arunachalam, S Bravyi, C Nirkhe, B O'Gorman
17th Conference on the Theory of Quantum Computation, Communication and …, 2022
Lower bounds on the complexity of quantum proofs
C Nirkhe
University of California, Berkeley, 2022
A Distribution Testing Oracle Separating QMA and QCMA
A Natarajan, C Nirkhe
38th Computational Complexity Conference (CCC 2023), 2023
Limitations on Brandão-Harrow limitation for 4-local Hamiltonians
A Anshu, C Nirkhe
The system can't perform the operation now. Try again later.
Articles 1–10