An improved semidefinite programming hierarchy for testing entanglement. - Aram W. Harrow; Anand Natarajan 001; Xiaodi Wu 001 (CoRR, 2015)

Tight SoS-Degree Bounds for Approximate Nash Equilibria. - Aram W. Harrow; Anand Natarajan 001; Xiaodi Wu 001 (CCC, 2016)

Limitations of semidefinite programs for separable states and entangled games. - Aram W. Harrow; Anand Natarajan 001; Xiaodi Wu 001 (CoRR, 2016)

Robust self-testing of many-qubit states. - Anand Natarajan 001; Thomas Vidick (CoRR, 2016)

A quantum linearity test for robustly verifying entanglement. - Anand Natarajan 001; Thomas Vidick (STOC, 2017)

Two-Player Entangled Games are NP-Hard. - Anand Natarajan 001; Thomas Vidick (CCC, 2018)

Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA. - Anand Natarajan 001; Thomas Vidick (FOCS, 2018)

NEEXP is Contained in MIP. - Anand Natarajan 001; John Wright 004 (FOCS, 2019)

Algorithms, Bounds, and Strategies for Entangled XOR Games. - Adam Bene Watts; Aram W. Harrow; Gurtej Kanwar; Anand Natarajan 001 (ITCS, 2019)

NEEXP in MIP. - Anand Natarajan 001; John Wright 004 (CoRR, 2019)

Quantum soundness of the classical low individual degree test. - Zhengfeng Ji; Anand Natarajan 001; Thomas Vidick; John Wright 004; Henry Yuen (CoRR, 2020)

Quantum soundness of testing tensor codes. - Zhengfeng Ji; Anand Natarajan 001; Thomas Vidick; John Wright 004; Henry Yuen (FOCS, 2021)

MIP* = RE. - Zhengfeng Ji; Anand Natarajan 001; Thomas Vidick; John Wright 004; Henry Yuen (Commun. ACM, 2021)

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

Quantum Locally Testable Code with Exotic Parameters. - Andrew W. Cross; Zhiyang He; Anand Natarajan 001; Mario Szegedy; Guanyu Zhu (CoRR, 2022)

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

Bounding the Quantum Value of Compiled Nonlocal Games: From CHSH to BQP Verification. - Anand Natarajan 001; Tina Zhang (FOCS, 2023)

Quantum Free Games. - Anand Natarajan 001; Tina Zhang (STOC, 2023)

A Collapsible Polynomial Hierarchy for Promise Problems. - Chirag Falor; Shu Ge; Anand Natarajan 001 (CoRR, 2023)

The Computational Advantage of MIP^∗ Vanishes in the Presence of Noise. - Yangjing Dong; Honghao Fu; Anand Natarajan 001; Minglong Qin; Haochen Xu; Penghui Yao (CCC, 2024)

Succinct Arguments for QMA from Standard Assumptions via Compiled Nonlocal Games. - Tony Metger; Anand Natarajan 001; Tina Zhang (FOCS, 2024)

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

A Computational Tsirelson's Theorem for the Value of Compiled XOR Games. - David Cui; Giulio Malavolta; Arthur Mehta; Anand Natarajan 001; Connor Paddock; Simon Schmidt; Michael Walter 005; Tina Zhang (IACR Cryptol. ePrint Arch., 2024)

Classical Commitments to Quantum States. - Sam Gunn; Yael Tauman Kalai; Anand Natarajan 001; Agi Villanyi (IACR Cryptol. ePrint Arch., 2024)

Quantum Locally Testable Code with Constant Soundness. - Andrew W. Cross; Zhiyang He; Anand Natarajan 001; Mario Szegedy; Guanyu Zhu (Quantum, 2024)

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