The CHSH game is a fun game, that shows the power of entangled qubits. In this article, I will take an alternative approach to this game, using the Bloch Sphere as the playing field.

Prerequisite knowledge:
Let's start with a quick recap of how the CHSH game is played: There are 2 players, Alice and Bob, and a referee, Charlie. Alice and Bob are in separate rooms, they cannot communicate. Charlie gives Alice a random bit . He also gives Bob a random bit . Alice must return a bit and Bob must return a bit . They win if , where denotes the XOR operation.
For example, if Alice gets and Bob gets , then and the winning combinations are and , because in those cases .
In the classical solution, Alice and Bob can simply always both return 0. Then, they will win all cases, except when they both get a 1 from Charlie. This is a win rate of 75%. As it turns out, they cannot actually do better than that. However, if they share an entangled pair of qubits, they can significantly improve those odds.
We will go through a detailed, step-by-step explanation of the quantum solution in a bit, but first, let me explain why I wrote this article in the first place. After all, there are already quite a few explanations of this on the Internet. The traditional explanations of how this quantum solution works, often use these "rotated hooks" as measuring bases for Alice and Bob:
The equations for Bob's measuring bases (the green arrows) are then as follows:
When I was studying this, the approach wasn't immediately clear to me. Why do we need those rotated hooks? They are supposed to be rotated from each other, but why do they have to be rotated about those specific angles? Can't they be rotated about any other angle? And those equations... what's the pattern there? They don't seem to have any kind of symmetry?
A few weeks before this, I had studied the Bloch Sphere extensively. I thought, you know what? Let's use the Bloch Sphere instead and see what happens! Since we didn't seem to need complex numbers here, I took the projection of the Bloch Sphere along the axes, basically with . State vectors in this plane can then be expressed as follows:
According to the standard quantum solution to the CHSH game, we need 4 measuring bases that are rotated from each other. We will look at how to use these to solve the game later, but first, let's draw them. As you can see above, the Bloch Sphere equation divides the z-angle by 2. So in order to express 4 measuring bases that are rotated from each other, we need to rotate them from each other on the Bloch Sphere. In the plane (with ), this then looks as follows:
Now this looks a whole lot better! In fact, it's the
only way you can draw 4 bases (with 2 vectors each) in the plane that is perfectly symmetrical! It has reflective symmetry in the and axes and rotational symmetry every . Later, we'll see why this is important, but first, let's see what the equations for all 8 basis vectors look like. Let's start with Alice's. These should be straightforward, but for completeness sake, let's verify them anyway:
Now for Bob's. Let's see if they will be any different than the ones from the "rotated hooks" approach. By the way, if you're working with the Bloch Sphere a lot,
this page is your friend!
That's interesting! The equations for , and are the same, but the one for is now multiplied by a factor of -1! This is a global phase, so it won't affect any measurement, but it does mean that the equations now look perfectly symmetrical!
(For the astute reader, who notices that should ideally always be in the range : if you remove the minuses from the , and values and calculate those vectors with instead, you will see that it will lead to exactly the same outcomes, since , and . I thought I'd keep it simple by leaving the complex numbers out of this article.)
By moving all bases to the Bloch Sphere, we have obtained a perfectly even and symmetrical distribution of basis vectors, with perfectly symmetrical equations. This is going to help a lot in understanding
why the quantum solution to the CHSH game works. But before we get there, let's have a look at the actual quantum strategy.
The Quantum Strategy for the CHSH Game
In the Quantum Strategy, Alice and Bob share an entangled pair of qubits. More precisely, they share a Bell Pair: . We have 4 bases for measuring a qubit: and for Alice and and for Bob. These bases are orthogonal, which is illustrated by the fact that their vectors lie on opposite ends of the Bloch Sphere.
The trick is, that Alice and Bob use their input bit (resp. and ) to determine which basis they will use for measuring their half of the entangled pair. They will then use the result of their measurement to determine their output bit (resp. and ). They will do this according to the following schema, where the colors illustrate what the value of their output bit will be:
There are four possible cases, because both and can be 0 or 1. We will explore two of these cases in detail, the other two will be left as an exercise for the reader. After exploring the two cases, we will have a look at
why this strategy actually works.
Case 1
Let's test the first case! In this case, and , so . must then also be 0. This is true if or .
Since , Alice will measure in the basis and since , Bob will measure in the basis. This means that we either want Alice to get and Bob to get , or Alice to get and Bob to get .
The probability of the first one, Alice getting and Bob getting , is calculated as follows:
The probability of the second one, Alice getting and Bob getting , is calculated as follows:
They win if either will happen, which, by summing the two separate values, has probability:
This is significantly better than the win rate of 75% for the classical solution, although that 75% was for all cases combined, not just one case, so let's move on!
Case 2
For the second case, we take and , so . must then also be 1. This is true if and or if and .
Since , Alice will measure in the basis and since , Bob will measure in the basis. This means that we either want Alice to get and Bob to get , or Alice to get and Bob to get .
The probability of the first one, Alice getting and Bob getting , is calculated as follows:
The probability of the second one, Alice getting and Bob getting , is calculated as follows:
They win if either will happen, which, by summing the two separate values, has the following probability (again, keep
this one at hand!):
Success again! It turns out that the other two cases also resolve to a win rate of , meaning that is actually the overall win rate for all cases combined. So, why is this?
Why does this work?
To see why the Quantum Strategy always gives the same probability for each of the cases, let's have a look at the outcomes that we want for each case:
Now have a look at all of these desired outcomes on the Bloch Sphere. Their vectors are always right next to each other! Because Alice's and Bob's qubits are entangled, the closer the measuring bases are to each other, the higher the probability that the outcomes are close to each other as well. This maximizes the probability that Alice and Bob will indeed measure a result that will win them the game. The Bloch Sphere makes this much more obvious than the "rotated hooks".
Moreover, it is also clear that a win rate of is indeed the maximum win rate that is achievable when Alice and Bob share an entangled pair (as is proven by
Tsirelson's bound). This is because there is no other way to distribute 4 bases on the Bloch Sphere that is more optimal than this one. Move two vectors of a desired outcome closer to each other, and two other ones will move away from each other. You can't do better than the perfectly symmetrical distribution.
Conclusion
Playing the CHSH game on the Bloch Sphere gives us a symmetrical distribution of measuring bases, along with symmetrical equations for those bases. It provides an intuitive insight into why the Quantum Strategy works and why it is indeed the most optimal strategy possible.
This approach has helped me understand the CHSH game a lot better. I hope it will be useful to others as well!