Chinmay Nirkhe

Computer Science · Physical Sciences

5h-index433citations16works1.32yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Quantum Computing Algorithms and Architecture(15), Computability, Logic, AI Algorithms(7), Quantum Information and Cryptography(5), Low-power high-performance VLSI design(3), Machine Learning and Algorithms(3)

Publications16 total

Separating QMA from QCMA with a classical oracle
arXiv (Cornell University)·2025Open Access
A distribution testing oracle separation between QMA and QCMA
Quantum·2024· 3 citedOpen Access
The status of the quantum PCP conjecture (games version)
arXiv (Cornell University)·2024· 1 citedOpen Access
NLTS Hamiltonians from Good Quantum Codes
2023· 50 citedOpen Access
A Distribution Testing Oracle Separating QMA and QCMA
arXiv (Cornell University)·2022Open Access
NLTS Hamiltonians from classical LTCs
arXiv (Cornell University)·2022Open Access
NLTS Hamiltonians from good quantum codes
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2022· 2 citedOpen Access
The Parametrized Complexity of Quantum Verification
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2022· 2 citedOpen Access
The Parameterized Complexity of Quantum Verification
arXiv (Cornell University)·2022· 4 citedOpen Access
Quantum Search-To-Decision Reductions and the State Synthesis Problem
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 7 citedOpen Access
Circuit lower bounds for quantum code Hamiltonians and an almost linear NLTS theorem
arXiv (Cornell University)·2020Open Access
Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020· 5 citedOpen Access
Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
2019· 16 citedOpen Access
On the complexity and verification of quantum random circuit sampling
Nature Physics·2018· 281 cited
"Quantum Supremacy" and the Complexity of Random Circuit Sampling
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2018· 59 citedOpen Access
Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2018· 3 citedOpen Access

Frequent Co-authors

Anurag Anshu(4), Umesh Vazirani(3), Henry Yuen(3), Anand Natarajan(3), Adam Bouland(2), Bill Fefferman(2), Nikolas P. Breuckmann(2), Srinivasan Arunachalam(2), Sergey Bravyi(2), Bryan O’Gorman(2), Thomas C. Bohdanowicz(1), Elizabeth Crosson(1), Sandy Irani(1), Anand Natarajan(1), Sujit Rao(1), John Bostanci(1), Jonas Haferkamp(1), Mark Zhandry(1), Zhiyang He(1)