09 January 2025

The CHSH Game is best played on the Bloch Sphere

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 x{0,1}. He also gives Bob a random bit y{0,1}. Alice must return a bit a{0,1} and Bob must return a bit b{0,1}. They win if xy=ab, where denotes the XOR operation.

For example, if Alice gets x=1 and Bob gets y=0, then xy=10=0 and the winning combinations are a=0,b=0 and a=1,b=1, because in those cases ab=0.

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:
|m0=cosπ8|0+sinπ8|1|m1=sinπ8|0+cosπ8|1|n0=cosπ8|0sinπ8|1|n1=sinπ8|0+cosπ8|1
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 π8 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 xz axes, basically with ϕ=0. State vectors in this plane can then be expressed as follows:
|v=cosθ2|0+eiϕsinθ2|1(Bloch sphere equation)=cosθ2|0+sinθ2|1(ϕ=0)
According to the standard quantum solution to the CHSH game, we need 4 measuring bases that are rotated π8 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 π8 from each other, we need to rotate them π4 from each other on the Bloch Sphere. In the xz plane (with ϕ=0), this then looks as follows:
|0
|1
|+
|
|m0
|m1
|n0
|n1
0
14π
14π
12π
12π
34π
34π
π
x
z
θ
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 xz plane that is perfectly symmetrical! It has reflective symmetry in the x and z axes and rotational symmetry every 14π. 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:
|0=cos02|0+sin02|1=|0|1=cosπ2|0+sinπ2|1=|1|+=cos12π2|0+sin12π2|1=12|0+12|1|=cos12π2|0+sin12π2|1=12|012|1
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!
|m0=cos14π2|0+sin14π2|1=cosπ8|0+sinπ8|1|m1=cos34π2|0+sin34π2|1=sinπ8|0cosπ8|1|n0=cos14π2|0+sin14π2|1=cosπ8|0sinπ8|1|n1=cos34π2|0+sin34π2|1=sinπ8|0+cosπ8|1
That's interesting! The equations for |m0, |n0 and |n1are the same, but the one for |m1 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 [0,π]: if you remove the minuses from the θ=14π, θ=12π and θ=34π values and calculate those vectors with ϕ=π instead, you will see that it will lead to exactly the same outcomes, since cosθ=cosθ, sinθ=sinθ and eiπ=1. 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: |ψ=12|00+12|11. We have 4 bases for measuring a qubit: {|0,|1} and {|+,|} for Alice and {|m0,|m1} and {|n0,|n1} 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. x and y) 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. a and b). They will do this according to the following schema, where the colors illustrate what the value of their output bit will be:
x=0:Alice measures in{|0,|1}x=1:Alice measures in{|+,|}Alice returnsa= 01y=0:Bob measures in{|m0,|m1}y=1:Bob measures in{|n0,|n1}Bob returnsb= 01
There are four possible cases, because both x and y 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, x=0 and y=0, so xy=0. ab must then also be 0. This is true if a=b=0 or a=b=1.

Since x=0, Alice will measure in the {|0,|1} basis and since y=0, Bob will measure in the {|m0,|m1} basis. This means that we either want Alice to get |0 and Bob to get |m0, or Alice to get |1 and Bob to get |m1.

The probability of the first one, Alice getting |0 and Bob getting |m0, is calculated as follows:
(0|m0|)|ψ2=([10][cosπ8sinπ8])[120012]2=[cosπ8sinπ800][120012]2=12cosπ82=12cos2π8
The probability of the second one, Alice getting |1 and Bob getting |m1, is calculated as follows:
(1|m1|)|ψ2=([01][sinπ8cosπ8])[120012]2=[00sinπ8cosπ8][120012]2=12cosπ82=12cos2π8
They win if either will happen, which, by summing the two separate values, has probability:
12cos2π8 + 12cos2π8 = cos2π8  0.85 = 85%
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 x=1 and y=1, so xy=1. ab must then also be 1. This is true if a=0 and b=1 or if a=1 and b=0.

Since x=1, Alice will measure in the {|+,|} basis and since y=1, Bob will measure in the {|n0,|n1} basis. This means that we either want Alice to get |+ and Bob to get |n1, or Alice to get | and Bob to get |n0.

The probability of the first one, Alice getting |+ and Bob getting |n1, is calculated as follows:
(+|n1|)|ψ2=([1212][sinπ8cosπ8])[120012]2=[12sinπ812cosπ812sinπ812cosπ8][120012]2=12sinπ8+12cosπ82=14sin2π8 + 12sinπ8cosπ8 + 14cos2π8
The probability of the second one, Alice getting | and Bob getting |n0, is calculated as follows:
(|n0|)|ψ2=([1212][cosπ8sinπ8])[120012]2=[12cosπ812sinπ812cosπ812sinπ8][120012]2=12cosπ8+12sinπ82=14cos2π8 + 12cosπ8sinπ8 + 14sin2π8
They win if either will happen, which, by summing the two separate values, has the following probability (again, keep this one at hand!):
12cos2π8 + cosπ8sinπ8 + 12sin2π8= 12(cos2π8+sin2π8) + cosπ8sinπ8= 12 + cosπ8sinπ8= 12 + 12sin(π8+π8)  12sin(π8π8)= 12 + 12sinπ4  12sin0= 12 + 12cosπ4= 1+cos(2π8)2= cos2π8  0.85 = 85%
Success again! It turns out that the other two cases also resolve to a win rate of cos2π8, meaning that cos2π8 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:
For x=0,y=0,we want outcome{|0,|m0} or{|1,|m1}For x=0,y=1,we want outcome{|0,|n0} or{|1,|n1}For x=1,y=0,we want outcome{|+,|m0} or{|,|m1}For x=1,y=1,we want outcome{|+,|n1} or{|,|n0}
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 cos2π8 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!