research
∙
02/08/2023
Quantum free games
The complexity of free games with two or more classical players was esse...
share
research
∙
09/23/2022
Quantum Locally Testable Code with Exotic Parameters
In this paper, we present a few simple constructions of quantum locally ...
research
∙
11/15/2021
Quantum soundness of testing tensor codes
A locally testable code is an error-correcting code that admits very eff...
research
∙
11/04/2021
Quantum search-to-decision reductions and the state synthesis problem
It is a useful fact in classical computer science that many search probl...
research
∙
09/27/2020
Quantum soundness of the classical low individual degree test
Low degree tests play an important role in classical complexity theory, ...
research
∙
01/13/2020
MIP*=RE
We show that the class MIP* of languages that can be decided by a classi...
research
∙
04/11/2019
NEEXP in MIP*
We study multiprover interactive proof systems. The power of classical m...
research
∙
01/02/2018
Algorithms, Bounds, and Strategies for Entangled XOR Games
We study the complexity of computing the commuting-operator value ω^* of...
research
∙
10/09/2017
