Anand Natarajan
Massachusetts Institute of Technology(US)
Publications by Year
Research Areas
Quantum Computing Algorithms and Architecture, Quantum Mechanics and Applications, Complexity and Algorithms in Graphs, Quantum Information and Cryptography, Computability, Logic, AI Algorithms
Most-Cited Works
- → MIP* = RE(2021)160 cited
- → A quantum linearity test for robustly verifying entanglement(2017)51 cited
- → Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA(2018)40 cited
- → An Improved Semidefinite Programming Hierarchy for Testing Entanglement(2017)29 cited
- → The Parallel-Repeated Magic Square Game is Rigid(2016)23 cited
- → Robust self-testing of many-qubit states(2016)23 cited
- → NEEXP is Contained in MIP(2019)22 cited
- → Limitations of Semidefinite Programs for Separable States and Entangled Games(2019)14 cited
- → Quantum soundness of the classical low individual degree test(2020)12 cited
- → Quantum blackjack: Advantages offered by quantum strategies in communication-limited games(2020)9 cited