Robust product self-testing conjecture for synchronous games

About 2 years old · traced to

Let \mcG1\mcG_1 and \mcG2\mcG_2 be two synchronous games. Robust product self-testing conjecture. The product game \mcG1×\mcG2\mcG_1\times\mcG_2 is a robust self-test for its perfect strategies if and only if both \mcG1\mcG_1 and \mcG2\mcG_2 are robust self-tests for their perfect strategies. The preceding exact product and parallel-repetition results for ordinary self-testing motivate this robust analogue; its status is not established in the supplied text.

References

Primary source

Yuming Zhao, “Robust self-testing for nonlocal games with robust game algebras”, arXiv:2411.03259 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.