CHSH (John Clauser, Michael Horne, Abner Shimony, and Richard Holt) game is another view on the Bell’s inequalities, showing that under the hood our world is not classical. The game is played by Alice and Bob, and proceeds as follows:
- a referee generates two independent uniformly chosen random bits (x and y, also called “questions”) and sends x bit to Alice and y bit to Bob
- After receiving the questions, Alice and Bob send their answers back to the referee; an answer is one bit too (a for Alice and b for Bob)
- Alice and Bob win if , where stands for xor operation.
The game is cooperative – Alice and Bob do not play against each other, their goal is to get the highest winning probability together. Before the game starts, Alice and Bob can communicate and decide on the strategy they will use; after the game started, Alice and Bob are not allowed to communicate anymore; Alice doesn’t know what question the referee sent to Bob, and Bob doesn’t know what question the referee sent to Alice.
In the classical world, Alice and Bob have 16 possible deterministic strategies – both Alice and Bob have two possible answers for each of two possible questions, combining them we get possible strategies. Since the probability of is 75%, it can be easily seen that there exists 75%-winning strategy – Alice and Bob simply ignore the questions and answer identically – either by bit 0 both or by bit 1 both; it seems natural that this is the best strategy, and it is indeed so, as can be formally shown by checking all 16 possible strategies.
In the quantum world, Alice and Bob have additional degree of freedom – before the game starts, they share an entangled bipartite state, for example two-qubit EPR state:
Now, Alice and Bob choose the measurement bases according to the questions they receive from the referee, and answer by measuring their qubits in the chosen bases.
Let us denote the basis vectors as :
Alice uses on receiving the question 0, and on receiving the question 1; Bob uses on receiving the question 0, and on receiving the question 1.
If the referee sends questions , Alice and Bob win if they answer identically or . The correspondent probability of winning (given ) is:
Substituting we get
Substituting we get
The cases and are similar to : Alice and Bob win if they answer identically:
In the last case Alice and Bob win if they answer differently, so:
Putting it all together:
if Alice and Bob choose , then
and we obtain the winning probability above 85%, which is significantly better than classical 75%.
Can you please consider changing your font? The bs, ds and us are making my eyes bleed 😉
Changed to some sans serif. Hope it is better now. 🙂
How did you choose theta for Alice and Bob?
Well I didn’t. I just know that the chosen thetas maximize the winning probability; the proof that the max winning probability is 1/2+1/(2*sqrt(2)) (Tsirelson’s bound) can be found in Watrous lectures – https://cs.uwaterloo.ca/~watrous/CPSC519/LectureNotes/20.pdf
Great explanation !! Please keep posting similar things.
Thanks for the article!!
Pingback: Kwantowa gra Johna Bella | Nie od razu naukę zbudowano
Click to access lecture2.pdf
For a bit more explanation of EPR pair etc.