User:MRFS/Photons

From Wikipedia, the free encyclopedia

The poor man's Bell tests

Needless to say the conduct of a Bell test is a very costly business indeed. But the good news is that it's possible to run an accurate simulation in the comfort of one's own home at minimal expense. The only equipment required consists of two coins and an icosahedral die, commonly known as a D20 because it has 20 faces rather than the usual 6. The reason for using a D20 is that it can mimic the quantum probabilities to 2 decimal places, and thereby provide a reasonably faithful representation of the real Bell test.

So what are these probabilities and how is the test to be done? As described above the detector settings °, °, ½°, ½° are chosen because they give the greatest violation of Bell's inequality. According to quantum theory if the nominal angle between two settings is γ then the probability of agreement between two detectors at these settings is cos2γ. Thus the probabilities of mutual agreement are as follows :-
P( and agree) = cos2(22½°) = P( and agree) = P( and agree) = 0.85 which is an 85% chance of agreement (1-17)
P( and agree) = cos2(67½°) = 0.15 which is a 15% chance of agreement (18,19,20)
The D20 can exactly emulate these probabilities. 85% of the time it will roll a number from 1 to 17 inclusive. 15% of the time it will roll 18, 19 or 20.

As for the coins, instead of heads and tails one is marked and for Alice's detectors. The other bears and to show Bob's possible choices. A 'trial' will consist of tossing the coins and rolling the D20. First decide on the number of trials and create a blank table like the one below to accommodate the results. The results of 100 trials are displayed below.

Once the preliminaries are over the simulation can begin. Simply run a series of trials and for each trial record the value shown by the D20 in the appropriate cell.

D20 rolls for each detector pairing
and  414 5 2 419 8171712 9 718 42013 610 1 2171911 1
and 1417 3 219 9 5 7 312 31815 4 3 51711 4 41211181120
and 1215151916 8 6 314 91516 9 518 2 2 81316 820 314
and 11 7 2 7 312 6 118 1131417 719 72010 120 8121518 8116

The next stage is to replicate the table changing every entry to either an 'A' or a 'D' according to its value. In rows 1, 3 and 4 the probability of agreement is 85% so values from 1 to 17 inclusive qualify for an 'A'; values 18, 19, 20 are given a 'D'. But in row 2 the probability of agreement is only 15% so here 18, 19, 20 receive an 'A' and 1 - 17 get a 'D'.

Agreements and disagreements for each detector pairing
and AAAAADAAAAAADADAAAAAADAA
and DDDDADDDDDDADDDDDDDDDDADA
and AAADAAAAAAAAAADAAAAAADAA
and AAAAAAAADAAAAADADAADAAADAAA

The final column of each row shows the average (or expectation) of the row. It is given by (NA − ND)/(NA + ND) where NA and ND respectively are the number of 'A's and the number of 'D's in the row. In terms of what has gone before NA = N+++ N and ND = N+–+ N–+ . It only remains to calculate the Bell signal

  (  

which shows that the Bell/CHSH inequality has been well and truly violated. What a surprise!

However one rather puzzling aspect of this experiment remains. It has faithfully simulated the actual Bell test and has violated the Bell/CHSH inequality, yet it has somehow managed to avoid any mention of loopholes or hidden variables or nonlocality.

Interested readers are encouraged to run their own simulations and draw their own conclusions.

Related Articles

Wikiwand AI