Anand Natarajan
Anand Natarajan
Postdoc, IQIM and CMS, Caltech
Verified email at caltech.edu - Homepage
Title
Cited by
Cited by
Year
A quantum linearity test for robustly verifying entanglement
A Natarajan, T Vidick
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
56*2017
The Parallel-Repeated Magic Square Game is Rigid
M Coudron, A Natarajan
arXiv preprint arXiv:1609.06306, 2016
292016
Low-degree testing for quantum states
A Natarajan, T Vidick
arXiv preprint arXiv:1801.03821, 2018
24*2018
An improved semidefinite programming hierarchy for testing entanglement
AW Harrow, A Natarajan, X Wu
Communications in Mathematical Physics 352 (3), 881-904, 2017
142017
NEEXP in MIP*
A Natarajan, J Wright
arXiv preprint arXiv:1904.05870, 2019
82019
Two-player entangled games are NP-hard
A Natarajan, T Vidick
arXiv preprint arXiv:1710.03062, 2017
82017
Limitations of semidefinite programs for separable states and entangled games
AW Harrow, A Natarajan, X Wu
Communications in Mathematical Physics 366 (2), 423-468, 2019
7*2019
MIP*= RE
Z Ji, A Natarajan, T Vidick, J Wright, H Yuen
arXiv preprint arXiv:2001.04383, 2020
52020
Algorithms, bounds, and strategies for entangled XOR games
A Bene Watts, AW Harrow, G Kanwar, A Natarajan
10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2018
52018
Tight SoS-Degree Bounds for Approximate Nash Equilibria
A Harrow, AV Natarajan, X Wu
LIPIcs-Leibniz International Proceedings in Informatics 50, 2016
32016
Quantum Blackjack or Can MIT Bring Down the House Again?
JX Lin, JA Formaggio, AW Harrow, AV Natarajan
arXiv preprint arXiv:1908.09417, 2019
2019
Verifying quantum proofs with entangled games
AV Natarajan
Massachusetts Institute of Technology, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–12