Gap-preserving compression for commuting-operator strategies
Statement
Let be a sequence of nonlocal games, and let the complexity of a sequence refer to the complexity of its th game. Gap-preserving compression conjecture. There exists a computable map that, given , outputs a sequence of complexity such that, whenever the complexity of is at most , for every ,
and
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.