default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnand Natarajan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Yangjing Dong, Honghao Fu, Anand Natarajan, Minglong Qin, Haochen Xu, Penghui Yao:
The Computational Advantage of MIP^∗ Vanishes in the Presence of Noise. CCC 2024: 30:1-30:71- [c15]Tony Metger, Anand Natarajan, Tina Zhang:
Succinct Arguments for QMA from Standard Assumptions via Compiled Nonlocal Games. FOCS 2024: 1193-1201 - [i18]Anand Natarajan, Chinmay Nirkhe:
The status of the quantum PCP conjecture (games version). CoRR abs/2403.13084 (2024) - [i17]Tony Metger, Anand Natarajan, Tina Zhang:
Succinct arguments for QMA from standard assumptions via compiled nonlocal games. CoRR abs/2404.19754 (2024) - [i16]David Cui, Giulio Malavolta, Arthur Mehta, Anand Natarajan, Connor Paddock, Simon Schmidt, Michael Walter, Tina Zhang:
A Computational Tsirelson's Theorem for the Value of Compiled XOR Games. IACR Cryptol. ePrint Arch. 2024: 348 (2024) - [i15]Sam Gunn, Yael Tauman Kalai, Anand Natarajan, Agi Villanyi:
Classical Commitments to Quantum States. IACR Cryptol. ePrint Arch. 2024: 606 (2024) - 2023
- [c14]Anand Natarajan, Chinmay Nirkhe:
A Distribution Testing Oracle Separating QMA and QCMA. CCC 2023: 22:1-22:27 - [c13]Anand Natarajan, Tina Zhang:
Bounding the Quantum Value of Compiled Nonlocal Games: From CHSH to BQP Verification. FOCS 2023: 1342-1348 - [c12]Anand Natarajan, Tina Zhang:
Quantum Free Games. STOC 2023: 1603-1616 - [c11]Mark Zhao, Satadru Pan, Niket Agarwal, Zhaoduo Wen, David Xu, Anand Natarajan, Pavan Kumar, Shiva Shankar P., Ritesh Tijoriwala, Karan Asher, Hao Wu, Aarti Basant, Daniel Ford, Delia David, Nezih Yigitbasi, Pratap Singh, Carole-Jean Wu:
Tectonic-Shift: A Composite Storage Fabric for Large-Scale ML Training. USENIX ATC 2023: 433-449 - [i14]Anand Natarajan, Tina Zhang:
Quantum free games. CoRR abs/2302.04322 (2023) - [i13]Chirag Falor, Shu Ge, Anand Natarajan:
A Collapsible Polynomial Hierarchy for Promise Problems. CoRR abs/2311.12228 (2023) - [i12]Yangjing Dong, Honghao Fu, Anand Natarajan, Minglong Qin, Haochen Xu, Penghui Yao:
The Computational Advantage of MIP* Vanishes in the Presence of Noise. CoRR abs/2312.04360 (2023) - 2022
- [c10]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 - [i11]Andrew W. Cross, Zhiyang He, Anand Natarajan, Mario Szegedy, Guanyu Zhu:
Quantum Locally Testable Code with Exotic Parameters. CoRR abs/2209.11405 (2022) - 2021
- [j1]Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen:
MIP* = RE. Commun. ACM 64(11): 131-138 (2021) - [c9]Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen:
Quantum soundness of testing tensor codes. FOCS 2021: 586-597 - [i10]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) - [i9]Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen:
Quantum soundness of testing tensor codes. CoRR abs/2111.08131 (2021) - 2020
- [i8]Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen:
MIP*=RE. CoRR abs/2001.04383 (2020) - [i7]Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen:
Quantum soundness of the classical low individual degree test. CoRR abs/2009.12982 (2020)
2010 – 2019
- 2019
- [c8]Anand Natarajan, John Wright:
NEEXP is Contained in MIP. FOCS 2019: 510-518 - [c7]Adam Bene Watts, Aram W. Harrow, Gurtej Kanwar, Anand Natarajan:
Algorithms, Bounds, and Strategies for Entangled XOR Games. ITCS 2019: 10:1-10:18 - [i6]Anand Natarajan, John Wright:
NEEXP in MIP. CoRR abs/1904.05870 (2019) - 2018
- [c6]Anand Natarajan, Thomas Vidick:
Two-Player Entangled Games are NP-Hard. CCC 2018: 20:1-20:18 - [c5]Anand Natarajan, Thomas Vidick:
Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA. FOCS 2018: 731-742 - [i5]Adam Bene Watts, Aram W. Harrow, Gurtej Kanwar, Anand Natarajan:
Algorithms, Bounds, and Strategies for Entangled XOR Games. CoRR abs/1801.00821 (2018) - 2017
- [c4]Anand Natarajan, Thomas Vidick:
A quantum linearity test for robustly verifying entanglement. STOC 2017: 1003-1015 - 2016
- [c3]Aram W. Harrow, Anand Natarajan, Xiaodi Wu:
Tight SoS-Degree Bounds for Approximate Nash Equilibria. CCC 2016: 22:1-22:25 - [i4]Anand Natarajan, Thomas Vidick:
Robust self-testing of many-qubit states. CoRR abs/1610.03574 (2016) - [i3]Aram W. Harrow, Anand Natarajan, Xiaodi Wu:
Limitations of semidefinite programs for separable states and entangled games. CoRR abs/1612.09306 (2016) - 2015
- [i2]Aram W. Harrow, Anand Natarajan, Xiaodi Wu:
An improved semidefinite programming hierarchy for testing entanglement. CoRR abs/1506.08834 (2015) - [i1]Anand Natarajan, Thomas Vidick:
Constant-Soundness Interactive Proofs for Local Hamiltonians. CoRR abs/1512.02090 (2015) - 2011
- [c2]Murali Venkatesh, Anand Natarajan:
Institutional Work and Artifact Evolution. ICIS 2011
2000 – 2009
- 2004
- [c1]Anand Natarajan, Liaquat Hossain:
Towards a Social Network Approach for Monitoring Insider Threats to Information Security. ISI 2004: 501-507
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 2025-01-21 00:24 CET 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:
