Abstract

A general algorithm is given for determining whether or not a given set of pair distributions allows for the construction of all the members of a specified set of higher-order distributions which return the given pair distributions as marginals. This mathematical question underlies studies of quantum correlation experiments such as those of Bell or of Clauser and Horne, or their higher-spin generalizations. The algorithm permits the analysis of rather intricate versions of such problems, in a form readily adaptable to the computer. The general procedure is illustrated by simple derivations of the results of Mermin and Schwarz for the symmetric spin-1 and spin-3/2 Einstein-Podolsky-Rosen problems. It is also used to extend those results to the spin-2 and spin-5/2 cases, providing further evidence that the range of strange quantum theoretic correlations does not diminish with increasing s. The algorithm is also illustrated by giving an alternative derivation of some recent results on the necessity and sufficiency of the Clauser-Horne conditions. The mathematical formulation of the algorithm is given in general terms without specific reference to the quantum theoretic applications