Bell Inequalities & Nonlocality
The CHSH game: a measurable proof that nature is not classical.
In 1935 Einstein, Podolsky and Rosen argued that entangled particles must carry hidden instructions. In 1964 John Bell showed that this idea makes a testable prediction, and nature fails the test. Today the test is a game: no classical team wins the CHSH game more than 75% of the time, while players sharing entangled qubits win about 85% of the time.
What you’ll learn
- Define a local hidden-variable (LHV) model and name the assumptions it encodes.
- Prove the CHSH inequality by reducing every local strategy to deterministic ones.
- Derive the correlation for and the quantum value .
- Convert between the CHSH value and the game's winning probability, .
- Explain why a Bell violation rules out local hidden variables but cannot be used to send signals.
Hidden instructions?
Give Alice and Bob the two halves of a Bell pair and send them far apart. If both measure , their bits always agree, yet each bit on its own is a fair coin.
Einstein, Podolsky and Rosen (EPR, 1935) read this as incompleteness: the outcomes must have been fixed at the source, like two sealed envelopes holding matching cards, and quantum mechanics merely does not know which card is inside. A theory of such pre-set answers is a local hidden-variable (LHV) model.
The CHSH game
Clauser, Horne, Shimony and Holt (CHSH, 1969) turned Bell's idea into a robust test. In game form, a referee sends Alice a uniformly random bit and Bob a uniformly random bit . Without communicating, they reply with bits and . They win if
so their answers must agree unless both received , in which case they must disagree.
| Questions | To win | |
|---|---|---|
What is the highest winning probability a classical team can achieve? Shared randomness and any pre-agreed plan are allowed; entanglement and communication during the game are not.
Show the answer
75 %
Always answering wins the three rows that ask for agreement and loses : . The derivation below shows that no classical strategy does better.
A deterministic strategy is four bits: Alice's answer to each question and Bob's answer . Winning every row requires all four equations.
Add the left-hand sides mod 2: every variable appears exactly twice, so the sum is .
The right-hand sides add to . Contradiction: at most three of the four equations can hold.
Each question pair has probability , and at least one of them is lost.
Correlators and the CHSH inequality
Physicists usually state the same bound with outcomes. Let be Alice's outcome when asked , similarly , and define the correlators , the average of the product. The CHSH combination is
Fix . Every is now a definite number (locality: does not depend on ), and the four products regroup.
One bracket is and the other is .
Every deterministic strategy gives exactly .
Measurement independence lets the same appear in all four correlators, so is an average of the and cannot leave .
, so . In row the players must disagree, which flips the sign.
Average over the four equally likely question pairs.
The CHSH inequality is the 75% bound, written in a different currency.
Think first An experiment reports and . Can a local hidden-variable model explain it, and what is the corresponding win rate?
, so no LHV model can produce these correlators. The win rate is .
The quantum strategy: S = 2√2
Now let Alice and Bob share and measure along directions in the X–Z plane of the Bloch sphere. Measuring at Bloch angle means measuring the observable
whose eigenvalues are ; is and is .
fixes and ; swaps them. Either way is a eigenstate.
maps to , which is orthogonal to ; the same holds for .
Expand into four terms; only and survive.
Alice measures or . Bob measures along the two diagonals, .
Three angle pairs differ by . The fourth, , differs by ; its cosine is negative, and the minus sign in turns it into a gain.
With , what winning probability does give?
Show the answer
85.4 %
. Every question pair is won with this same probability: in the three "agree" rows , so , and in row gives the same probability of disagreeing.
What a violation does and does not mean
Experiments since the 1970s violate the CHSH inequality, so at least one LHV assumption fails in nature. Quantum mechanics gives up local hidden variables. It does not give up no-signalling, as a short calculation shows.
Alice's reduced state is maximally mixed (see the partial trace).
Summing over Bob's outcomes replaces his projectors by , whatever his setting is.
Each side sees fair coins. The correlations appear only when the two lists of results are compared, which requires an ordinary classical channel.
Which assumption fails? Bell's theorem says you cannot keep locality, hidden variables and measurement independence all at once. Nonlocal hidden-variable theories such as Bohmian mechanics remain logically possible, but they must be explicitly nonlocal. Theories that deny measurement independence ("superdeterminism") are possible in principle; most physicists regard them as conspiratorial.
A loophole-free experiment measures . Which conclusion is justified?
- Alice can now send Bob messages faster than light
- No local hidden-variable model with settings chosen independently of can reproduce the data
- Every hidden-variable theory is ruled out
- The source must have emitted product states
Show the answer
B. No local hidden-variable model with settings chosen independently of can reproduce the data
by many standard deviations violates the CHSH inequality, which every local model with measurement independence obeys. Nothing more is implied: marginals stay independent of the distant setting, and nonlocal hidden-variable theories are not excluded.
Key takeaways
- Local hidden-variable models (locality + hidden variables + measurement independence) obey , equivalently a CHSH winning probability of at most .
- The proof: every local strategy is a mixture of deterministic ones, and each deterministic strategy gives .
- For , ; with Alice at and Bob at (Bloch angles), and .
- A violation rules out local hidden variables, yet no-signalling holds: each party's marginal statistics ignore the distant setting.
- is the quantum maximum (Tsirelson's bound), and loophole-free experiments since 2015 confirm the violation.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
A Bell test finds and . What CHSH winning probability does this correspond to?
Show the answer
B.
, so . This beats the classical but stays below the quantum maximum .
Why can shared randomness not push a classical team above 75% in the CHSH game?
- Because random bits cannot be shared in advance
- It can, but only by a few percent
- A randomized strategy is a mixture of deterministic ones, and its winning probability is the average of theirs
- Because the referee's questions are correlated with the shared randomness
Show the answer
C. A randomized strategy is a mixture of deterministic ones, and its winning probability is the average of theirs
Conditioned on the shared random value , the strategy is deterministic and wins at most . Averaging over cannot exceed the best term.
Alice and Bob share . Alice measures at Bloch angle (that is, ) and Bob at Bloch angle . What is the probability that their outcomes agree?
Show the answer
D.
and , which equals : the half-angle appears because Bloch angles are twice the Hilbert-space angles.
Alice uses Bloch angles (for ) and (for ). Which choice for Bob (, ) reaches with ?
- and
- and
- and
- and
Show the answer
A. and
With : and , so .
Alice and Bob share . Bob switches his measurement from to . How does the distribution of Alice's outcomes, looked at on its own, change?
- It becomes biased toward Bob's outcome
- It now depends on the angle between their settings
- It stays exactly 50/50
- It collapses to a definite value
Show the answer
C. It stays exactly 50/50
Alice's statistics are determined by her reduced state , which no operation on Bob's side can change. Only the joint statistics depend on both settings.
Go deeper
- Tsirelson's Bound · Why quantum mechanics wins CHSH at most cos²(π/8) of the time.
- Loophole-Free Bell Tests · Locality, detection and freedom-of-choice loopholes, closed.
- Nonlocal Games & Self-Testing · Certifying quantum devices from their statistics alone.
Further reading
- J. S. Bell, "On the Einstein Podolsky Rosen paradox", Physics 1, 195 (1964).
- J. F. Clauser, M. A. Horne, A. Shimony & R. A. Holt, "Proposed experiment to test local hidden-variable theories", Phys. Rev. Lett. 23, 880 (1969).
- M. A. Nielsen & I. L. Chuang, Quantum Computation and Quantum Information, §2.6 (Cambridge, 10th anniv. ed., 2010).
- N. Brunner, D. Cavalcanti, S. Pironio, V. Scarani & S. Wehner, "Bell nonlocality", Rev. Mod. Phys. 86, 419 (2014).