ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(Gn)n∈N\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 nnth game. Gap-preserving compression conjecture. There exists a computable map GappedCompressco\texttt{GappedCompress}_{co} that, given G\mathscr{G}, outputs a sequence G′=(Gn′)n∈N\mathscr{G}'=(G_n')_{n\in\mathbb{N}} of complexity O(log⁡n)O(\log n) such that, whenever the complexity of G\mathscr{G} is at most poly(n)\mathrm{poly}(n), for every n∈Nn\in\mathbb{N},

ωco(Gn)=1⟹ωco(Gn′)=1,\omega_{co}(G_n)=1\Longrightarrow\omega_{co}(G_n')=1,

and

ωco(Gn)≤12⟹ωco(Gn′)≤12.\omega_{co}(G_n)\leq\frac{1}{2}\Longrightarrow\omega_{co}(G_n')\leq\frac{1}{2}.

The conjecture would provide a gapped compression procedure for commuting-operator strategies and could establish the hardness of approximating the commuting-operator value. Its status is unknown in the source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.