Towards characterizing the non-locality of entangled quantum states (Q387027)

Shared classical randomness cannot explain the behavior of entangled quantum systems. As a simple game to demonstrate this non-local property of quantum mechanics, it is shown that \(n\)-classical players will lose the game with substantial probability, but always won by players share an entangled, quantum state. Further, for a quantitative characterization of non-locality of \(n\)-partite quantum state and in order to win the \(n\)-player games, a new type of separations is obtained. Particularly, to simulate two separated qubits of an \(n\)-partite GHZ state at least \(\Omega(\log\log n)\) bits of information are required.