An explicit classical strategy for winning a game
arXiv:1510.07431 · doi:10.1088/1367-2630/18/2/025013
Abstract
A game is a generalization of the standard two player game, having different input and output options. In contrast to the binary game, the best classical and quantum winning strategies are not known exactly. In this paper we provide a constructive classical strategy for winning a game, with being a prime. Our construction achieves a winning probability better than , which is in contrast with the previously known constructive strategies achieving only the winning probability of .
arXiv comment11 pages, 3 figures
References in corpus (10)
- Experimental loophole-free violation of a Bell inequality using entangled electron spins separated by 1.3 km
- Bell nonlocality
- Device-independent security of quantum cryptography against collective attacks
- Random Numbers Certified by Bell's Theorem
- Fully device independent quantum key distribution
- Full randomness from arbitrarily deterministic events
- Reexamination of a multisetting Bell inequality for qudits
- Multi-setting Bell inequality for qudits
- Device-independent randomness extraction for arbitrarily weak min-entropy source
- Device-independent randomness amplification with a single device