![]() |
|
|||||||||||||||||
Bell's theorem
Bell considered a setup in which two observers, now commonly referred to as Alice and Bob, perform independent measurements on a system S prepared in some fixed state. Moreover, on each trial, Alice and Bob can choose between various detector settings; after repeated trials Alice and Bob collect statistics on their measurements and correlate the results. In one version of this setup, Alice can choose between two detector settings to measure one of XA or YA, and Bob can choose between detector settings to measure either XB or YB. Each measurement has one of two possible outcomes +1, −1. As an example, consider a composite system consisting of two electrons prepared in a special state, one of which is sent to Alice and the other one to Bob. Alice and Bob then each measure the spin of their electron along one of two perpendicular axes. There are two key assumptions in Bell's analysis: (1) each measurement reveals an objective physical property of the system (2) a measurement taken by one observer has no effect on the measurement taken by the other. In the version of the inequality due to Clauser, Horne, Shimony and Holt (called the CHSH form): where C denotes correlation. Experimental tests of Bell inequalities support the failure of local realism, and in particular, that some of unexpected correlations suggested by the EPR thought experiment do in fact occur. However, by the no-communication theorem, it is impossible for Alice to communicate information to Bob (or vice versa) in violation of relativity.
CorrelationIn statistics, the correlation coefficient of random variables X, Y is where σX is the square root of the variance of X. However, in this article, we will refer to the closely related, but unnormalized quantity as the correlation. To estimate a correlation, we take observations on independent repeated trials of the pair (X, Y). In this case, the law of large numbers says that under (relatively minor) technical assumptions almost surely. Equation (2) makes sense for any sequence of measured values Xn, Yn. We use (2) to define the correlation provided that the limit in (2) exists and is "robust", meaning that it exists for "enough" subsequences (and with the same value). We can now state the following "theorem", although we have not produced here a mathematical theory in which this theorem follows deductively. See for example (Bell, 1971). Bell's theorem. The CHSH inequality (1) holds under the local realist assumptions above. Consider an infinite sequence of Bell test trials. This consists of:
The values of the each one of the correlation expressions is estimated by extracting appropriate measurement subsequences from the entire run. However, the robustness assumption can be used to conclude that the correlation expressions are equal to those obtained by taking the limit of the averages on the entire run, including those values that were not selected for measurement. By the locality assumption for each trial, at least one of is zero regardless of which of the variables XA or YA is measured by Alice. Thus since each summand can be regrouped as Thus Remark 1. There remain a number of issues regarding the experimental estimation of the correlations. For instance, each trial n falls into exactly one of the following subsequences:
We need to insure that each expression has the same value when taken on each one of the above subsequences. In fact, there other possibilities that are ignored in the above list. One such possibility regards detection failures; see loopholes. Also see section 4.1 of (Redhead, 1987) for further discussion of these assumptions and caveats on the proof of Bell's theorem and in particular, what is not assumed about the correlation limits. Section 4.2 of this reference also discusses the relation between various properties such as local counterfactual definiteness, locality and determinism. See also section 4.3 of (van Frassen, 1991). A more recent treatment mostly formulated within a particular interpretative framework (consistent histories) is given in (Griffiths, 2002). Remark 2. The validity of the correlation inequality (1) still holds if the variables XA, YA, XB, YB are allowed to take on any real values between -1, +1 (in addition to the local realist assumptions, of course). Indeed, the relevant idea is that each summand in the above average is bounded above by 2. This is easily seen to be true in the more general case: To justify the upper bound 2 asserted in the last inequality, without loss of generality, we can assume that In that case Also see local hidden variables. Comparison to quantum mechanical predictionTo apply Bell's theorem we will show that quantum mechanics makes a prediction that violates a "Bell inequality" in the setup considered in the EPR thought experiment. In order to do this, we first need to show how to compute correlations of quantum mechanical observables. In the usual quantum mechanical formalism, observables X, Y are represented as self-adjoint operators on a Hilbert space. To compute the correlation, assume that X, Y are represented by matrices in a finite dimensional space and that X, Y commute; this special case suffices for our purposes below. We then use the von Neumann measurement postulate: a measurement of an observable X in system state φ produces a distribution of real values in which the probability of observing λ is (where EX(λ) is the eigenspace corresponding to λ) and the system state immediately after the measurement is From this, we can show that the correlation of X, Y in a pure state ψ is We apply this fact in the context of the EPR paradox. Let us consider the spin observables for an electron along the x and z axes. The observables are represented by the 2 × 2 self-adjoint matrices: These are the Pauli spin matrices normalized so that the corresponding eigenvalues are +1, −1. As is customary, we denote the eigenvectors of Sx by Let φ be the spin singlet state for a pair of electrons discussed in the EPR paradox. This is a specially constructed state described by the following vector in the tensor product Now let us apply the CHSH formalism to the observables: The operators XB, YB correspond to B's spin measurements along skew directions in the xz-plane. Note that the operators subscripted with A commute with those subscripted with B so we can apply our calculation for the correlation. In this case, we can show that the CHSH inequality fails. In fact, a straightforward calculation shows that and so that Thus, if the quantum mechanical formalism is correct, then the system consisting of a pair of entangled electrons cannot satisfy the principle of local realism. Note that The next sections consider experimental tests to see whether the Bell inequalities required by local realism hold up to the empirical evidence. Bell test experimentsMain article: Bell test experiments. Bell's inequalities are tested by "coincidence counts" from a Bell test experiment such as the optical one shown in the diagram. Pairs of particles are emitted as a result of a quantum process, analysed with respect to some key property such as polarisation direction, then detected. The setting (orientations) of the analysers are selected by the experimenter. Bell test experiments to date overwhelmingly suggest that Bell's inequality is violated. Indeed, a table of Bell test experiments performed prior to 1986 is given in 4.5 of (Redhead, 1987). Of the thirteen experiments listed, only two reached results contradictory to quantum mechanics; moreover, according to the same source, when the experiments were repeated, "the discrepancies with QM could not be reproduced". Nevertheless, the issue is not conclusively settled. According to Shimony's 2004 Stanford Encyclopedia overview article
These loopholes are discussed in the Bell test experiments article. See also
Further readingThe following are intended for general audiences.
References
External Links
The contents of this article are licensed from Wikipedia.org under the GNU Free Documentation License.
How to see transparent copy 01-04-2007 01:21:04 |
|






is indeed the upper bound for quantum mechanics, it's called