Better Non-Local Games from Hidden Matching
classification
🪐 quant-ph
keywords
strategybettercertaintyclassicalconstructepr-pairsgamegames
read the original abstract
We construct a non-locality game that can be won with certainty by a quantum strategy using log n shared EPR-pairs, while any classical strategy has winning probability at most 1/2+O(log n/sqrt{n}). This improves upon a recent result of Junge et al. in a number of ways.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.