CHSH game
The last example to be discussed in this lesson is not a protocol, but a game known as the CHSH game.
When we speak of a game in this context, we're not talking about something that's meant to be played for fun or sport, but rather a mathematical abstraction in the sense of game theory. Mathematical abstractions of games are studied in economics and computer science, for instance, and they are both fascinating and useful.
The letters CHSH refer to the authors — John Clauser, Michael Horne, Abner Shimony, and Richard Holt — of a 1969 paper where the example was first described. They did not describe the example as a game, but rather as an experiment. Its description as a game, however, is both natural and intuitive.
The CHSH game falls within a class of games known as nonlocal games. Nonlocal games are incredibly interesting and have deep connections to physics, computer science, and mathematics — holding mysteries that still remain unsolved. We'll begin the section by explaining what nonlocal games are, and then we'll focus in on the CHSH game and what makes it interesting.
Nonlocal games
A nonlocal game is a cooperative game where two players, Alice and Bob, work together to achieve a particular outcome. The game is run by a referee, who behaves according to strict guidelines that are known to Alice and Bob.
Alice and Bob can prepare for the game however they choose, but once the game starts they are forbidden from communicating. We might imagine the game taking place in a secure facility of some sort — as if the referee is playing the role of a detective and Alice and Bob are suspects being interrogated in different rooms. But another way to think about the set-up is that Alice and Bob are separated by a vast distance, and communication is prohibited because the speed of light doesn't allow for it within the running time of the game. That is to say, if Alice tries to send a message to Bob, the game will be over by the time he receives it, and vice versa.
The way a nonlocal game works is that the referee first asks each of Alice and Bob a question. We'll use the letter to refer to Alice's question and to refer to Bob's question. Here we're thinking of and as being classical states, and in the CHSH game and are bits.
The referee uses randomness to select these questions. To be precise, there is some probability associated with each possible pair of questions, and the referee has vowed to choose the questions randomly, at the time of the game, in this way. Everyone, including Alice and Bob, knows these probabilities — but nobody knows specifically which pair will be chosen until the game begins.
After Alice and Bob receive their questions, they must then provide answers: Alice's answer is and Bob's answer is Again, these are classical states in general, and bits in the CHSH game.
At this point the referee makes a decision: Alice and Bob either win or lose depending on whether or not the pair of answers is deemed correct for the pair of questions according to some fixed set of rules. Different rules mean different games, and the rules for the CHSH game specifically are described in the section following this one. As was already suggested, the rules are known to everyone.
The following diagram provides a graphic representation of the interactions.
It is the uncertainty about which questions will be asked, and specifically the fact that each player doesn't know the other player's question, that makes nonlocal games challenging for Alice and Bob — just like colluding suspects in different rooms trying to keep their story straight.
A precise description of the referee defines an instance of a nonlocal game. This includes a specification of the probabilities for each question pair along with the rules that determine whether each pair of answers wins or loses for each possible question pair
We'll take a look at the CHSH game momentarily, but before that let us briefly acknowledge that it's also interesting to consider other nonlocal games. It's extremely interesting, in fact, and there are some nonlocal games for which it's currently not known how well Alice and Bob can play using entanglement. The set-up is simple, but there's complexity at work — and for some games it can be impossibly difficult to compute best or near-best strategies for Alice and Bob. This is the mind-blowing nature of the non-local games model.
CHSH game description
Here is the precise description of the CHSH game, where (as above) is Alice's question, is Bob's question, is Alice's answer, and is Bob's answer:
-
The questions and answers are all bits:
-
The referee chooses the questions uniformly at random. That is, each of the four possibilities, and is selected with probability
-
The answers win for the questions if and lose otherwise. The following table expresses this rule by listing the winning and losing conditions on the answers for each pair of questions
Limitation of classical strategies
Now let's consider strategies for Alice and Bob in the CHSH game, beginning with classical strategies.
Deterministic strategies
We'll start with deterministic strategies, where Alice's answer is a function of the question that she receives, and likewise Bob's answer is a function of the question he receives. So, for instance, we may write to represent Alice's answer when her question is and to represent Alice's answer when her question is
No deterministic strategy can possibly win the CHSH game every time. One way to reason this is simply to go one-by-one through all of the possible deterministic strategies and check that every one of them loses for at least one of the four possible question pairs. Alice and Bob can each choose from four possible functions from one bit to one bit — which we encountered back in the first lesson of the course — so there are different deterministic strategies in total to check.
We can also reason this analytically. If Alice and Bob's strategy wins when then it must be that if their strategy wins when then and similarly, if the strategy wins for then So, if their strategy wins for all three possibilities, then
This implies that the strategy loses in the final case for here winning requires that Thus, there can be no deterministic strategy that wins every time.
On the other hand, it is easy to find deterministic strategies that win in three of the four cases, such as From this we conclude that the maximum probability for Alice and Bob to win using a deterministic strategy is
Probabilistic strategies
As we just concluded, Alice and Bob cannot do better than winning the CHSH game 75% of the time using a deterministic strategy. But what about a probabilistic strategy? Could it help Alice and Bob to use randomness — including the possibility of shared randomness, where their random choices are correlated?
It turns out that probabilistic strategies don't help at all to increase the probability that Alice and Bob win. This is because every probabilistic strategy can alternatively be viewed as a random selection of a deterministic strategy, just like probabilistic operations can be viewed as random selections of deterministic operations. The average is never larger than the maximum, and so it follows that probabilistic strategies don't offer any advantage in terms of their overall winning probability.
Thus, winning with probability is the best that Alice and Bob can do using any classical strategy, whether deterministic or probabilistic.
CHSH game strategy
A natural question to ask at this point is whether Alice and Bob can do any better using a quantum strategy. In particular, if they share an entangled quantum state as the following figure suggests, which they could have prepared prior to playing the game, can they increase their winning probability?
The answer is yes, and this is the main point of the example and why it's so interesting. So let's see exactly how Alice and Bob can do better in this game using entanglement.
Required vectors and matrices
The first thing we need to do is to define a qubit state vector for each real number (which we'll think of as an angle measured in radians) as follows.
Here are some simple examples:
We also have the following examples, which arise in the analysis below:
Looking at the general form, we see that the inner product between any two of these vectors has this formula:
In detail, there are only real number entries in these vectors, so there are no complex conjugates to worry about: the inner product is the product of the cosines plus the product of the sines. Using one of the angle addition formulas from trigonometry leads to the simplification above. This formula reveals the geometric interpretation of the inner product between real unit vectors as the cosine of the angle between them.
If we compute the inner product of the tensor product of any two of these vectors with the state, we obtain a similar expression, except that it has a in the denominator:
Our interest in this particular inner product will become clear shortly, but for now we're simply observing this as a formula.
Next, define a unitary matrix for each angle as follows.
Intuitively speaking, this matrix transforms into and into To check that this is a unitary matrix, a key observation is that the vectors and are orthogonal for every angle :
Thus, we find that
We may alternatively write this matrix explicitly as
This is an example of a rotation matrix, and specifically it rotates two-dimensional vectors with real number entries by an angle of about the origin. If we follow a standard convention for naming and parameterizing rotations of various forms, we have where
Strategy description
Now we can describe the quantum strategy.
-
Set-up: Alice and Bob start the game sharing an e-bit: Alice holds a qubit Bob holds a qubit and together the two qubits are in the state.
-
Alice's actions:
- If Alice receives the question she applies to her qubit
- If Alice receives the question she applies to her qubit
The operation Alice performs on may alternatively be described like this:
After Alice applies this operation, she measures with a standard basis measurement and sets her answer to be the measurement outcome.
-
Bob's actions:
- If Bob receives the question he applies to his qubit
- If Bob receives the question he applies to his qubit
Like we did for Alice, we can express Bob's operation on like this:
After Bob applies this operation, he measures with a standard basis measurement and sets his answer to be the measurement outcome.
Here is a quantum circuit diagram that describes this strategy:
In this diagram we see two ordinary controlled gates, one for on the top and one for on the bottom. We also have two gates that look like controlled gates, one for on the top and one for on the bottom, except that the circle representing the control is not filled in. This denotes a different type of controlled gate where the gate is performed if the control is set to (rather than like an ordinary controlled gate). So, effectively, Bob performs on his qubit if and if and Alice performs on her qubit if and if which is consistent with the description of the protocol in words above.
It remains to figure out how well this strategy for Alice and Bob works. We'll do this by going through the four possible question pairs individually.
Case-by-case analysis
-
Case 1:
In this case Alice performs on her qubit and Bob performs on his, so the state of the two qubits after they perform their operations is
The probabilities for the four possible answer pairs are therefore as follows.
We can then obtain the probabilities that and by summing.
For the question pair Alice and Bob win if and therefore they win in this case with probability
-
Case 2:
In this case Alice performs on her qubit and Bob performs on his, so the state of the two qubits after they perform their operations is
The probabilities for the four possible answer pairs are therefore as follows.
Again, we can obtain the probabilities that and by summing.
For the question pair Alice and Bob win if and therefore they win in this case with probability
-
Case 3:
In this case Alice performs on her qubit and Bob performs on his, so the state of the two qubits after they perform their operations is
The probabilities for the four possible answer pairs are therefore as follows.
We find, once again, that probabilities that and are as follows.
For the question pair Alice and Bob win if so they win in this case with probability
-
Case 4:
The last case is a little bit different, as we might expect because the winning condition is different in this case. When and are both Alice and Bob win when and are different. In this case Alice performs on her qubit and Bob performs on his, so the state of the two qubits after they perform their operations is
The probabilities for the four possible answer pairs are therefore as follows.
The probabilities have effectively swapped places from in the three other cases. We obtain the probabilities that and by summing.
For the question pair Alice and Bob win if and therefore they win in this case with probability
They win in every case with the same probability:
This is therefore the probability that they win overall. That's significantly better than any classical strategy can do for this game; classical strategies have winning probability bounded by And that makes this a very interesting example.
This happens to be the optimal winning probability for quantum strategies. That is, we can't do any better than this, no matter what entangled state or measurements we choose. This fact is known as Tsirelson's inequality, named for Boris Tsirelson who first proved it — and who first described the CHSH experiment as a game.
Geometric picture
It is possible to think about the strategy described above geometrically, which may be helpful for understanding the relationships among the various angles chosen for Alice and Bob's operations.
What Alice effectively does is to choose an angle depending on her question and then to apply to her qubit and measure. Similarly, Bob chooses an angle depending on and then he applies to his qubit and measures. We've chosen and like so.
For the moment, though, let's take and to be arbitrary. By choosing Alice effectively defines an orthonormal basis of vectors that looks like this:
Bob does likewise, except that his angle is :
The colors of the vectors correspond to Alice and Bob's answers: blue for and red for
Now, if we combine together and we get the formula
which works for all real numbers and
Following the same sort of analysis that we went through above, but with and being variables, we find this:
We conclude these two formulas:
These equations can be connected to the figures above by imagining that we superimpose the bases chosen by Alice and Bob. In particular, when Alice and Bob choose and and by superimposing their bases we obtain this figure:
The angle between the red vectors is which is the same as the angle between the two blue vectors. The probability that Alice and Bob's outcomes agree is the cosine-squared of this angle,
while the probability they disagree is the sine-squared of this angle,
When Alice and Bob choose and and by superimposing their bases we obtain this figure:
The angle between the red vectors is again as is the angle between the blue vectors. The probability that Alice and Bob's outcomes agree is again the cosine-squared of this angle,
while the probability they disagree is the sine-squared of this angle,
When Alice and Bob choose and and by superimposing their bases we obtain this figure:
The bases have changed but the angles haven't — once again the angle between vectors of the same color is The probability that Alice and Bob's outcomes agree is
and the probability they disagree is
When Alice and Bob choose and When we superimpose their bases, we see that something different has happened:
By the way the angles were chosen, this time the angle between vectors having the same color is rather than The probability that Alice and Bob's outcomes agree is still the cosine-squared of this angle, but this time the value is
The probability the outcomes disagree is the sine-squared of this angle, which in this case is this:
Remarks
The basic idea of an experiment like the CHSH game, where entanglement leads to statistical results that are inconsistent with purely classical reasoning, is due to John Bell, the namesake of the Bell states. For this reason, people often refer to experiments of this sort as Bell tests. Sometimes people also refer to Bell's theorem, which can be formulated in different ways — but the essence of it is that quantum mechanics is not compatible with so-called local hidden variable theories. The CHSH game is a particularly clean and simple example of a Bell test, and can be viewed as a proof, or demonstration, of Bell's theorem.
The CHSH game offers a way to experimentally test the theory of quantum information. Experiments can be performed that implement the CHSH game, and test the sorts of strategies based on entanglement described above. This provides us with a high degree of confidence that entanglement is real — and unlike the sometimes vague or poetic ways that we come up with to explain entanglement, the CHSH game gives us a concrete and testable way to observe entanglement. The 2022 Nobel Prize in Physics acknowledges the importance of this line of work: the prize was awarded to Alain Aspect, John Clauser (the C in CHSH) and Anton Zeilinger for observing entanglement through Bell tests on entangled photons.