advanced · Physics · Bell Nonlocality & Device-Independence
Checkpoint: Win the CHSH Game
This checkpoint pulls the module's core thread together: build the CHSH Bell operator explicitly,
evaluate it on a Bell state to get the quantum value S, and convert that into the probability of
winning the CHSH game. You will reproduce the optimal quantum strategy purely by linear algebra.
The plan
The CHSH value is the expectation of the Bell operator in the shared state:
B=A0⊗(B0+B1)+A1⊗(B0−B1),S=⟨Φ+∣B∣Φ+⟩.
Take the optimal observables in the X–Z plane,
A0=Z,A1=X,B0=2Z+X,B1=2Z−X,
and the maximally entangled state ∣Φ+⟩=21(∣00⟩+∣11⟩). Because
everything is real and lies in the X–Z plane, you can work with real 2×2 and 4×4
matrices throughout — no complex arithmetic needed.
Building the operator
Form the two single-party combinations B0+B1=2Z and B0−B1=2X, then take
Kronecker products with Alice's observables and add:
B=Z⊗(2Z)+X⊗(2X)=2(Z⊗Z+X⊗X).
On ∣Φ+⟩, both Z⊗Z and X⊗X act as +1 (it is a +1 eigenstate of each),
so ⟨B⟩=2(1+1)=22. The exercise computes this by explicit
matrix–vector arithmetic rather than by spotting the eigenvalues, so the answer is forced by the
linear algebra.
From S to the win probability
Using pwin=21+8S from the game lesson,
pwin=21+822=21+42=cos28π≈0.8536.
Try it
Construct the 4×4 Bell operator with Kronecker products, evaluate S=⟨Φ+∣B∣Φ+⟩ by direct summation, and return pwin=21+S/8. A correct
implementation yields cos2(π/8)≈0.8536 — beating the classical ceiling of 0.75 and
winning the CHSH game.
Run your code to see the quantum state.
Sign in on the full site to ask questions and join the discussion.