Non-Local Binary Games With Noisy Epr States Are Decidable
summary
Shows that the value of non-local binary games where players share noisy EPR states is decidable by giving an explicit finite bound on how many noisy copies suffice to approximate the optimum to any precision; the bound depends only on the precision, not the game size, so brute-force search becomes effective. Construction uses Pauli-basis Fourier expansion, smoothing via the depolarizing channel, Gaussian replacement and dimensional reduction, rounding to POVMs and a noncommutative invariance principle plus hypercontractivity.
AI-written summary · about