3 problems

CoRE-hardness conjecture. Deciding which of these two cases holds is $\mathrm{coRE}$-hard; equivalently, $\mathrm{MIP}^{\mathrm{co}}=\mathrm{coRE}$.

Let $\mcG_1$ and $\mcG_2$ be two synchronous games. Robust product self-testing conjecture. The product game $\mcG_1\times\mcG_2$ is a robust self-test for its perfect strategies i…

Let $\mathscr{G}=(G_n)_{n\in\mathbb{N}}$ be a sequence of nonlocal games, and let the complexity of a sequence refer to the complexity of its $n$th game. Gap-preserving compression…