default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChinmay Nirkhe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Anand Natarajan, Chinmay Nirkhe:
The status of the quantum PCP conjecture (games version). CoRR abs/2403.13084 (2024)- 2023
- [c8]Anand Natarajan, Chinmay Nirkhe:
A Distribution Testing Oracle Separating QMA and QCMA. CCC 2023: 22:1-22:27 - [c7]Anurag Anshu, Nikolas P. Breuckmann
, Chinmay Nirkhe:
NLTS Hamiltonians from Good Quantum Codes. STOC 2023: 1090-1096 - 2022
- [b1]Chinmay Nirkhe:
Lower bounds on the complexity of quantum proofs. University of California, Berkeley, USA, 2022 - [c6]Sandy Irani, Anand Natarajan, Chinmay Nirkhe, Sujit Rao, Henry Yuen:
Quantum Search-To-Decision Reductions and the State Synthesis Problem. CCC 2022: 5:1-5:19 - [c5]Anurag Anshu, Chinmay Nirkhe:
Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians. ITCS 2022: 6:1-6:22 - [c4]Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman:
The Parametrized Complexity of Quantum Verification. TQC 2022: 3:1-3:18 - [i5]Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman:
The Parameterized Complexity of Quantum Verification. CoRR abs/2202.08119 (2022) - [i4]Anurag Anshu, Nikolas P. Breuckmann, Chinmay Nirkhe:
NLTS Hamiltonians from good quantum codes. CoRR abs/2206.13228 (2022) - 2021
- [i3]Sandy Irani, Anand Natarajan, Chinmay Nirkhe, Sujit Rao, Henry Yuen:
Quantum search-to-decision reductions and the state synthesis problem. CoRR abs/2111.02999 (2021) - 2020
- [i2]Anurag Anshu, Chinmay Nirkhe:
Circuit lower bounds for low-energy states of quantum code Hamiltonians. CoRR abs/2011.02044 (2020)
2010 – 2019
- 2019
- [c3]Adam Bouland, Bill Fefferman, Chinmay Nirkhe, Umesh V. Vazirani:
"Quantum Supremacy" and the Complexity of Random Circuit Sampling. ITCS 2019: 15:1-15:2 - [c2]Thomas C. Bohdanowicz, Elizabeth Crosson, Chinmay Nirkhe, Henry Yuen:
Good approximate quantum LDPC codes from spacetime circuit Hamiltonians. STOC 2019: 481-490 - 2018
- [c1]Chinmay Nirkhe, Umesh V. Vazirani, Henry Yuen:
Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States. ICALP 2018: 91:1-91:11 - [i1]Adam Bouland, Bill Fefferman, Chinmay Nirkhe, Umesh V. Vazirani:
Quantum Supremacy and the Complexity of Random Circuit Sampling. CoRR abs/1803.04402 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 01:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
