CHSH inequality

From Infogalactic: the planetary knowledge core
(Redirected from CHSH Bell test)
Jump to: navigation, search

<templatestyles src="Module:Hatnote/styles.css"></templatestyles>

In physics, the CHSH inequality can be used in the proof of Bell's theorem, which states that certain consequences of entanglement in quantum mechanics cannot be reproduced by local hidden variable theories. Experimental verification of violation of the inequalities is seen as experimental confirmation that nature cannot be described by local hidden variables theories. CHSH stands for John Clauser, Michael Horne, Abner Shimony, and Richard Holt, who described it in a much-cited paper published in 1969 (Clauser et al., 1969).[1] They derived the CHSH inequality, which, as with John Bell's original inequality (Bell, 1964),[2] is a constraint on the statistics of "coincidences" in a Bell test experiment which is necessarily true if there exist underlying local hidden variables (local realism). This constraint can, on the other hand, be infringed by quantum mechanics.

Statement of the inequality

The usual form of the CHSH inequality is:

- 2 \leq S \leq 2

 

 

 

 

(1)

where

S = E(a, b) - E(a, b^\prime) + E(a^\prime, b) + E(a^\prime, b^\prime)

 

 

 

 

(2)

a and a′ are detector settings on side A, b and b′ on side B, the four combinations being tested in separate subexperiments. The terms E(a, b) etc. are the quantum correlations of the particle pairs, where the quantum correlation is defined to be the expectation value of the product of the "outcomes" of the experiment, i.e. the statistical average of A(aB(b), where A and B are the separate outcomes, using the coding +1 for the '+' channel and −1 for the '−' channel. Clauser et al.'s 1969[1] derivation was oriented towards the use of "two-channel" detectors, and indeed it is for these that it is generally used, but under their method the only possible outcomes were +1 and −1. In order to adapt it to real situations, which at the time meant the use of polarised light and single-channel polarisers, they had to interpret '−' as meaning "non-detection in the '+' channel", i.e. either '−' or nothing. They did not in the original article discuss how the two-channel inequality could be applied in real experiments with real imperfect detectors, though it was later proved (Bell, 1971)[3] that the inequality itself was equally valid. The occurrence of zero outcomes, though, means it is no longer so obvious how the values of E are to be estimated from the experimental data.

The mathematical formalism of quantum mechanics predicts a maximum value for S of 22,[4] which is greater than 2, and CHSH violations are therefore predicted by the theory of quantum mechanics.

A typical CHSH experiment

Schematic of a "two-channel" Bell test
The source S produces pairs of photons, sent in opposite directions. Each photon encounters a two-channel polariser whose orientation can be set by the experimenter. Emerging signals from each channel are detected and coincidences counted by the coincidence monitor CM.

In practice most actual experiments have used light rather than the electrons that Bell originally had in mind. The property of interest is, in the best known experiments (Aspect, 1981-2),[5][6][7] the polarisation direction, though other properties can be used. The diagram shows a typical optical experiment. Coincidences (simultaneous detections) are recorded, the results being categorised as '++', '+−', '−+' or '−−' and corresponding counts accumulated.

Four separate subexperiments are conducted, corresponding to the four terms E(a, b) in the test statistic S (2). The settings a, a′, b and b′ are generally in practice chosen to be 0, 45°, 22.5° and 67.5° respectively — the "Bell test angles" — these being the ones for which the QM formula gives the greatest violation of the inequality.

For each selected value of a and b, the numbers of coincidences in each category \left \{ N_{++}, N_{--}, N_{+-}, N_{-+} \right \} are recorded. The experimental estimate for E(a, b) is then calculated as:

E = \frac {N_{++}  - N_{+-} - N_{-+} + N_{--}} {N_{++}  + N_{+-} + N_{-+}+ N_{--}}

 

 

 

 

(3)

Once all the E’s have been estimated, an experimental estimate of S (2) can be found. If it is numerically greater than 2 it has infringed the CHSH inequality and the experiment is declared to have supported the QM (Quantum Mechanics) prediction and ruled out all local hidden variable theories.

The CHSH paper lists many preconditions (or "reasonable and/or presumable assumptions") to derive the simplified theorem and formula. For example, for the method to be valid, it has to be assumed that the detected pairs are a fair sample of those emitted. In actual experiments, detectors are never 100% efficient, so that only a sample of the emitted pairs are detected. A subtle, related requirement is that the hidden variables do not influence or determine detection probability in a way that would lead to different samples at each arm of the experiment.

Derivation of the CHSH inequality

The original 1969 derivation will not be given here since it is not easy to follow and involves the assumption that the outcomes are all +1 or −1, never zero. Bell's 1971 derivation is more general. He effectively assumes the "Objective Local Theory" later used by Clauser and Horne (Clauser, 1974).[8] It is assumed that any hidden variables associated with the detectors themselves are independent on the two sides and can be averaged out from the start. Another derivation of interest is given in Clauser and Horne's 1974 paper, in which they start from the CH74 inequality.

It would appear from both these later derivations that the only assumptions really needed for the inequality itself (as opposed to the method of estimation of the test statistic) are that the distribution of the possible states of the source remains constant and the detectors on the two sides act independently.

Bell's 1971 derivation

The following is based on page 37 of Bell's Speakable and Unspeakable (Bell, 1971),[3] the main change being to use the symbol ‘E’ instead of ‘P’ for the expected value of the quantum correlation. This avoids any implication that the quantum correlation is itself a probability.

We start with the standard assumption of independence of the two sides, enabling us to obtain the joint probabilities of pairs of outcomes by multiplying the separate probabilities, for any selected value of the "hidden variable" λ. λ is assumed to be drawn from a fixed distribution of possible states of the source, the probability of the source being in the state λ for any particular trial being given by the density function ρ(λ), the integral of which over the complete hidden variable space is 1. We thus assume we can write:

E(a, b) = \int \underline {A}(a, \lambda)\underline {B}(b, \lambda)\rho(\lambda)d\lambda

where A and B are the average values of the outcomes. Since the possible values of A and B are −1, 0 and +1, it follows that:

\left | \underline {A} \right | \leq 1 \quad \left | \underline {B} \right | \leq 1

 

 

 

 

(4)

Then, if a, a′, b and b′ are alternative settings for the detectors,

\begin{align}
E(a, b) - E(a, b^\prime) & = \int \left [ \underline {A}(a, \lambda)\underline {B}(b, \lambda) - \underline {A}(a, \lambda)\underline {B}(b^\prime, \lambda) \right ] \rho(\lambda)d\lambda \\
& = \int \underline {A}(a, \lambda)\underline {B}(b, \lambda) \left [1 \pm \underline {A}(a^\prime, \lambda)\underline {B}(b^\prime, \lambda) \right ]\rho(\lambda)d\lambda \; - \int \underline {A}(a, \lambda)\underline {B}(b^\prime, \lambda) \left [1 \pm \underline {A}(a^\prime, \lambda)\underline {B}(b, \lambda) \right ] \rho(\lambda) d\lambda
\end{align}

Taking absolute values of both sides, and applying the triangle inequality to the right-hand side, we obtain

\left | E(a, b) - E(a, b^\prime) \right | \leq \left | \int \underline {A}(a, \lambda)\underline {B}(b, \lambda) \left [ 1 \pm \underline {A}(a^\prime, \lambda)\underline {B}(b^\prime, \lambda) \right ]\rho(\lambda) d\lambda \right | + \left | \int \underline {A}(a, \lambda)\underline {B}(b^\prime, \lambda) \left [1 \pm \underline {A}(a^\prime, \lambda)\underline {B}(b, \lambda) \right ] \rho(\lambda) d\lambda \right |

We use the fact that  \left [ 1 \pm \underline {A}(a^\prime, \lambda)\underline {B}(b^\prime, \lambda) \right ] \rho(\lambda) and  \left [ 1 \pm \underline {A}(a^\prime, \lambda)\underline {B}(b, \lambda) \right ] \rho(\lambda) are both non-negative to rewrite the right-hand side of this as

\int \left | \underline {A}(a, \lambda)\underline {B}(b, \lambda) \right | \left | \left [ 1 \pm \underline {A}(a^\prime, \lambda)\underline {B}(b^\prime, \lambda)\right ] \rho(\lambda)d\lambda \right | +\ \int \left | \underline {A}(a, \lambda)\underline {B}(b^\prime, \lambda) \right | \left | \left [ 1 \pm \underline {A}(a^\prime, \lambda)\underline {B}(b, \lambda) \right ] \rho(\lambda) d\lambda \right |

By (4), this must be less than or equal to

\int \left [ 1 \pm \underline {A}(a^\prime, \lambda)\underline {B}(b^\prime, \lambda) \right ] \rho(\lambda) d\lambda + \int \left [ 1 \pm \underline {A}(a^\prime, \lambda)\underline {B}(b, \lambda) \right ] \rho(\lambda) d\lambda

which, using the fact that the integral of ρ(λ) is 1, is equal to

2 \pm \left [ \int \underline {A}(a^\prime, \lambda)\underline {B}(b^\prime, \lambda)\rho(\lambda)d\lambda + \int  \underline {A}(a^\prime, \lambda)\underline {B}(b, \lambda)\rho(\lambda)d\lambda \right ]

which is equal to 2 \pm \left [ E(a^\prime,b^\prime)+E(a^\prime,b) \right ].

Putting this together with the left-hand side, we have:

\left | E(a, b) - E(a, b^\prime) \right | \; \leq 2 \; \pm \left [ E(a^\prime,b^\prime) + E(a^\prime,b) \right ]

which means that the left-hand side is less than or equal to both 2 + \left [ E(a^\prime,b^\prime) + E(a^\prime,b) \right ] and 2 - \left [ E(a^\prime,b^\prime) + E(a^\prime,b) \right ]. That is:

\left | E(a, b) - E(a, b^\prime) \right | \; \leq \; 2 - \left | E(a^\prime,b^\prime) + E(a^\prime,b) \right |

from which we obtain

2
\; \geq \; \left | E(a, b) - E(a, b^\prime) \right | + \left | E(a^\prime, b^\prime) + E(a^\prime, b) \right |
\; \geq \; \left | E(a, b) - E(a, b^\prime) + E(a^\prime, b^\prime) + E(a^\prime, b) \right|

(by the triangle inequality again), which is the CHSH inequality.

Derivation from Clauser and Horne's 1974 inequality

In their 1974 paper,[8] Clauser and Horne show that the CHSH inequality can be derived from the CH74 one. As they tell us, in a two-channel experiment the CH74 single-channel test is still applicable and provides four sets of inequalities governing the probabilities p of coincidences.

Working from the inhomogeneous version of the inequality, we can write:

- 1 \; \leq \; p_{jk}(a, b) - p_{jk}(a, b\prime) + p_{jk}(a\prime, b) + p_{jk}(a\prime, b\prime) - p_{jk}(a\prime) - p_{jk}(b) \; \leq \; 0

where j and k are each '+' or '−', indicating which detectors are being considered.

To obtain the CHSH test statistic S (2), all that is needed is to multiply the inequalities for which j is different from k by −1 and add these to the inequalities for which j and k are the same.

Experiments using the CHSH test

Many Bell test experiments conducted subsequent to Aspect's second experiment in 1982 have used the CHSH inequality, estimating the terms using (3) and assuming fair sampling. Some dramatic violations of the inequality have been reported.[9] (4) Today, this formulation of the Bell inequality remains in use.

See also

References

  1. 1.0 1.1 Lua error in package.lua at line 80: module 'strict' not found.
  2. Lua error in package.lua at line 80: module 'strict' not found., reproduced as Ch. 2 of Lua error in package.lua at line 80: module 'strict' not found.
  3. 3.0 3.1 J. S. Bell, in Foundations of Quantum Mechanics, Proceedings of the International School of Physics “Enrico Fermi”, Course XLIX, B. d’Espagnat (Ed.) (Academic, New York, 1971), p. 171 and Appendix B. Pages 171-81 are reproduced as Ch. 4 of J. S. Bell, Speakable and Unspeakable in Quantum Mechanics (Cambridge University Press 1987)
  4. Lua error in package.lua at line 80: module 'strict' not found.
  5. Lua error in package.lua at line 80: module 'strict' not found.
  6. Lua error in package.lua at line 80: module 'strict' not found.
  7. Lua error in package.lua at line 80: module 'strict' not found.
  8. 8.0 8.1 Lua error in package.lua at line 80: module 'strict' not found.
  9. Lua error in package.lua at line 80: module 'strict' not found.