vanhees71 said:
Of course you can write a computer Monte-Carlo program with precisely the probabilities given by QT, or did I understand something wrong?
The issue for local realism would be to have three computers connected in a network. Call them A, B, C. Computer C can send messages to A or B, but receives messages from neither. Computers A and B send no messages, but receive messages from C. The programs running on A and B have settings, where a setting amounts to a specification of a direction in space (we can specify this by a pair of real numbers [itex]\theta, \phi[/itex], with [itex]0 \leq \theta \leq \pi[/itex] and [itex]0 \leq \phi \lt 2\pi[/itex]).
We have a number of rounds, where each round consists of the following steps:
- C generates a pair of messages, [itex]m_a[/itex] and [itex]m_b[/itex], using whatever means (random or not). (These represent the states of the electron and positron, respectively)
- C sends [itex]m_a[/itex] to computer A, and sends [itex]m_b[/itex] to computer B.
- After the message [itex]m_a[/itex] is sent, but before it is processed by A, a user chooses a setting for that computer: [itex]\theta_a, \phi_a[/itex]. (These represent the Stern-Gerlach spin measurement orientation)
- Then, computer A runs an algorithm [itex]F_A(m_a, \theta_a, \phi_a)[/itex] to determine a result, [itex]R_a[/itex], either +1 or -1. (This represents the process whereby the particle interacts with the Stern-Gerlach device to produce an outcome of spin-up or spin-down)
- Similarly, a setting is chosen for computer B, and it computes a result [itex]F_B(m_b, \theta_b, \phi_b)[/itex] (The result, [itex]R_b[/itex] is again, either +1 or -1)
This simulation would count as a local realistic simulation of EPR if, regardless of how the settings are chosen at step 3 (except that there would need to be enough variety to get good sampling), for any fixed [itex]\theta_a, \theta_b, \phi_a, \phi_b[/itex], we would have:
[itex]\langle R_a R_b \rangle = -cos(\psi)[/itex]
where [itex]\psi[/itex] is the angle between the direction specified for computers A and B and where [itex]\langle \rangle[/itex] is the average value, over many runs.
Bell's theorem implies that no matter what algorithms are being used by computers A, B or C, you can't reproduce the predictions of QM. There are various loopholes or ways to cheat, though, including:
- If A and B are allowed to communicate.
- If the settings are chosen predictably (and the pattern is used in the design of the program running on C)
- If the settings are chosen before C sends its messages, and C is told the choices.