Anand Natarajan

According to our database1, Anand Natarajan authored at least 28 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Classical Commitments to Quantum States.
IACR Cryptol. ePrint Arch., 2024

A Computational Tsirelson's Theorem for the Value of Compiled XOR Games.
IACR Cryptol. ePrint Arch., 2024

The status of the quantum PCP conjecture (games version).
CoRR, 2024

Succinct Arguments for QMA from Standard Assumptions via Compiled Nonlocal Games.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

The Computational Advantage of MIP^∗ Vanishes in the Presence of Noise.
Proceedings of the 39th Computational Complexity Conference, 2024

2023
A Collapsible Polynomial Hierarchy for Promise Problems.
CoRR, 2023

Tectonic-Shift: A Composite Storage Fabric for Large-Scale ML Training.
Proceedings of the 2023 USENIX Annual Technical Conference, 2023

Quantum Free Games.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Bounding the Quantum Value of Compiled Nonlocal Games: From CHSH to BQP Verification.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

A Distribution Testing Oracle Separating QMA and QCMA.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
Quantum Locally Testable Code with Exotic Parameters.
CoRR, 2022

Quantum Search-To-Decision Reductions and the State Synthesis Problem.
Proceedings of the 37th Computational Complexity Conference, 2022

2021
MIP* = RE.
Commun. ACM, 2021

Quantum soundness of testing tensor codes.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Quantum soundness of the classical low individual degree test.
CoRR, 2020

2019
NEEXP in MIP.
CoRR, 2019

Algorithms, Bounds, and Strategies for Entangled XOR Games.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

NEEXP is Contained in MIP.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Two-Player Entangled Games are NP-Hard.
Proceedings of the 33rd Computational Complexity Conference, 2018

2017
A quantum linearity test for robustly verifying entanglement.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016
Robust self-testing of many-qubit states.
CoRR, 2016

Limitations of semidefinite programs for separable states and entangled games.
CoRR, 2016

Tight SoS-Degree Bounds for Approximate Nash Equilibria.
Proceedings of the 31st Conference on Computational Complexity, 2016

2015
Constant-Soundness Interactive Proofs for Local Hamiltonians.
CoRR, 2015

An improved semidefinite programming hierarchy for testing entanglement.
CoRR, 2015

2011
Institutional Work and Artifact Evolution.
Proceedings of the International Conference on Information Systems, 2011

2004
Towards a Social Network Approach for Monitoring Insider Threats to Information Security.
Proceedings of the Intelligence and Security Informatics, 2004


  Loading...