7 ms·
> Imagine Alice and Bob split a pair of entangled particles. They perform measurements on their respective particles and use the results to dictate whether to w
by taneq 7y ago
> Imagine Alice and Bob split a pair of entangled particles. They perform measurements on their respective particles and use the results to dictate whether to write 1 or 0 in each box.
Why not just imagine Alice tells Bob how she's going to choose what to write in the boxes? That works 100% of the time too.
I don't see a distinction between "Alice and Bob communicate" and "a pair of entangled particles gives Alice and Bob a piece of shared information that, by prior arrangement, they both interpret in the same way."
- cyphar 7y agoMost of Bell's thought-experiments result in fairly unintuitive answers, so it's quite understandable that the distinction would be unclear to someone who hadn't seen this problem before. The description of the game in the article is incredibly simplified. The original Bell game is that you take two particles and separate them spacially so that any local (slower-than-light) communicaton cannot interfere with the experiment. You then measure their spins in two orientations (the absolute orientation isn't important, only the angle between the two measurements is important) and repeat a large number of times. Then, sum how many times the two measurements had the same spin (+1) or opposite spins (-1) and divide it by the number of measurements to get the "correlation" (scare quotes because this is not the same as what statisticians mean when they say "correlation"). Repeat for a large number of different relative angles and plot "correlation" vs angle. Quantum mechanics predicts (and experimental data produces) an inverse cosine "correlation" curve. However, it is simply not possible to produce that "correlation" curve using a local, hidden variable theory of quantum mechanics. Why? With some slight hand-waving, it's because the two particles don't know along which (relative) angle the other particle will be measured ahead of time -- if you permit non-locality (faster-than-light communication or "spooky" action at a distance) then this problem goes away. Now, the proof that this is the case is far more involved than this (and to be honest I'm not sure I understand it well enough to explain it). But hopefully that gives you some idea why the "just use an RNG" method is not sufficient.
- axilmar 7y ago> it's because the two particles don't know along which (relative) angle the other particle will be measured ahead of time Since the two particles are created from the same source, why couldn't it be that the two particles are affected by the initial state of their source so as that to appear correlated?
- cyphar 7y agoThe nature of the source is the reason they are correlated in that particular way (that is effectively what entanglement is achieving, at least in this simple example). In particular, the source in the classic Bell inequalities produced particles that had opposite spins (guaranteed by conservation of angular momentum). But that's effectively just a description of the problem. It doesn't really help you come up with a local hidden-variable theory of QM could produce the same "correlation" vs angle curve. The problem (in computer science terms) is that you need to come up with an algorithm (which for a given particle (A or B) takes some state (called lA or lB), and an angle parameter (oA and oB)) that gives you an output which has the statistical distribution which agrees with QM if you randomly sample lA and lB values. In other words, write an algorithm such that the "correlation" of Measure(oA, lA) and Measure(oB, lB) is always equal to precisely -cos(|oA - oB|) without using global variables. It turns out this is (provably) impossible. NOTE: In the real experiment you're actually measuring in 3D, so the angles should actually be unit vectors and the angle difference is actually (a function of) the dot product.
- axilmar 7y agoI don't get it. If the source is responsible for the correlation, what other explanation do we need? why we need to explain it with a local hidden-variable theory of QM? Why isn't it enough that the source is responsible for the correlation? And since it's impossible to write that algorithm, why not simply suppose the values of iA and iB are such that the correlation is possible? Wouldn't global variables actually be non-local communication, instead of local? they are global variables, just like entanglement is 'global' for the universe.
- 7y ago
- mooman219 7y agoI agree, I conflate "sharing an entangled particle" with "same starting seed", in which case you can also get a 100% winrate.
- dfdz 7y agoYou have narrowed in on the exact point of the game: Alice and Bob can pre-share arbitrary amounts of classical information and still not win more than 89% of the time. What would your strategy be for sharing information before the game starts?
- bscphil 7y agoWell, that's sort of the point most of us seem to be making here. We don't understand, and more importantly, the excerpt doesn't explain, how sharing an entangled particle pair (from which you can generate two infinite streams of identical information on both sides) is interestingly different than sharing a seed to an RNG (from which you can generate two infinite streams of identical information on both sides). They're apparently the same phenomenon, so asking people to think about the game without explaining what the difference is means you haven't really explained what's going on.
- AstralStorm 7y agoThere are two random choices. One of the value, the other by the verifier. There are infinitely many columns and rows to check, which would require an infinite amount of shared RNG. (or is otherwise finite, a PRNG) Yet this can be done in MIP* because state in A and B is correlated for any state. The problem can be rephrased as "does there exist an ideal PRNG that is not discernible from a true quantum RNG". Discerning between real RNG and PRNG is akin to solving the halting problem and one of the lynchpins if the proof.
- titanomachy 7y agoThe comments here led me to realize that I didn't really understand, either. Thank you. To save you some searching, I found the answer here [1]. The crux is that Alice and Bob don't know which row/column the other is filling, and they are given symbol-selection rules which would contradict each other if used to fill the whole square, preventing a pre-ordained strategy (e.g. a pre-seeded RNG) with 100% success rate. So a 100% strategy would intuitively need some way of communicating _after_ they are given their row and column, and the math shows that the quasi-communication granted by entanglement is sufficient. I'm sure my explanation is also insufficient, but there should be enough information at the link to convince you if you're curious. [1] https://en.wikipedia.org/wiki/Quantum_pseudo-telepathy#The_Mermin%E2%80%93Peres_magic_square_game https://en.wikipedia.org/wiki/Quantum_pseudo-telepathy#The_M...
- bscphil 7y agoYep, I quite literally came here to post this. It seems like exactly the kind of "not giving enough information to really understand a topic" that the OP was complaining about. If communication really needs to be forbidden, just let them agree on an RNG beforehand and share a seed. This seems to eliminate any quantum magic involved, which suggests I don't really understand the problem, which suggests that they haven't really explained it.
- deleted 7y ago[deleted]
- dfdz 7y agoSuppose that Alice and Bob share a seed to a RNG before the game starts. Can you explain how this will allow them to always win the game?
- bscphil 7y agoNo, but as I said in my parallel comment, I don't understand how you can do any better than having an infinite amount of pre-shared information without actually communicating. If you can explain that, great (I really would be interested), but the important thing here is that without explaining it the article is kind of flawed.
- dooglius 7y agoI'll make an attempt, though I am by no means a domain expert. As I said in another comment, Alice doesn't know which column is Bob's column, and Bob doesn't know which row is Alice's row. Bell-like inequalities allow something interesting to happen: Alice and Bob can measure a qubit at different "basis angles" such that the phase difference in their basis angles is reflected in the correlation of what outputs they observe from the qubit. You can't do this classically; what Alice does with a pre-shared bit and her row and what Bob does with the pre-shared bit and his column, form independent random variables. It may help to point out that (someone correct me if I'm wrong here...) this only works if both Alice and Bob are able to use their hidden information to choose the bases they're using to measure the qubit; if they were stuck with measuring at pre-determined angles, this trick doesn't work.
- dooglius 7y ago> Why not just imagine Alice tells Bob how she's going to choose what to write in the boxes? That works 100% of the time too. Alice doesn't know which column is Bob's column, and Bob doesn't know which row is Alice's row.
- Ar-Curunir 7y agoThat’s the rule for MIP: Alice and Bob can’t communicate once the game starts, and their messages to the verifier depend on challenges from the verifier (which they can’t predict). Like imagine the 3x3 grid suddenly changes after Alice and Bob write down their first message.
- omazurov 7y ago> Why not just imagine Alice tells Bob how she's going to choose what to write in the boxes? That works 100% of the time too. No, it does not. Let’s suppose Alice’s pre-negotiated (or predetermined by a seeded PRNG) choices for rows 1..3 are: (A11 A12 A13) (A21 A22 A23) (A31 A32 A33) And Bob’s choices for columns 1..3 are: (B11) (B21) (B13) (B21) (B22) (B23) (B31) (B32) (B33) If they are given row 1 and column 1, the intersect should match, i.e. A11 == B11. The same goes for any row and column selection: Aij == Bij. That is not, however, consistent with the requirement that the sum of all numbers for Alice must be an odd number (each row must add up to an odd number and there are 3 rows), and the sum of all numbers for Bob must be an even number (each column must add up to an even number and the sum of three even numbers is even). So, that’s the real catch for the classical setup. And yes, quantum correlation can beat it.
- eklitzke 7y agoThis isn't right though. Let's say Alice tells Bob what she's going to write in the boxes, and Bob can fill out his however he wishes. Due to the constraints given in the problem (the way the rows and columns add up), Bob can only pick the "correct" value to put in 8 of his 9 squares. That is: the problem constraints were designed so that there's no 3x3 grid that wins in all 9 squares for Alice and Bob and that simultaneously satisfies the row constraints. This is why the best Alice and Bob can do is win 89% of the time -- the best grid layout (even when they preshare information) satisfying the problem constraints only wins in 8 of the 9 squares. The point of the analogy is that in the quantum version there is a way to work around this unavoidable constraint in the classical problem.
- californical 7y agoThis description greatly helped in making the problem "click" for me, thanks! The fact that they can't know which row/column they're going to be assigned makes it impossible to know with more than 8/9 certainty what the correct move would be. Even if they agree ahead of time what the values should be, the fact that they only know half of the information makes it impossible (classically) to win more often than 8/9 of the time. They have no control over and no way of knowing which row/column the other was given. If I'm understanding correctly, the "quantum version" lets you increase that precision arbitrarily depending on how many measurements you make, up to 99.9999999...% Really neat stuff