This note is part of [[quantum/Practical Quantum Information System]]. > [!info] Course code > Use the companion repository for this lecture's runnable lab, helper functions, and regression checks: > - [notebooks/by_concept/nonlocal_games.ipynb](https://github.com/montekkundan/quantum-code/blob/main/notebooks/by_concept/nonlocal_games.ipynb) > - [qcourse/protocols.py](https://github.com/montekkundan/quantum-code/blob/main/qcourse/protocols.py) > - [tests/test_protocols_algorithms_qec.py](https://github.com/montekkundan/quantum-code/blob/main/tests/test_protocols_algorithms_qec.py) [TODO: add video - Nonlocal Games] ## What This Concept Is Once you understand CHSH, the next step is not to memorize one more Bell inequality. It is to see the broader framework. [[quantum/Glossary#Nonlocal game|Nonlocal games]] describe tasks where separated players receive inputs, produce outputs, and try to satisfy a winning rule without communicating during the game. This framework is powerful because it turns questions about entanglement and hidden-variable limits into score-based tasks. Some games can be won only up to a classical limit without entanglement. Others admit stronger quantum strategies. That makes the distinction between classical and quantum correlation operational, not merely philosophical. ## Foundation Terms You Need First A [[quantum/Glossary#Nonlocal game|nonlocal game]] is defined by inputs, outputs, and a winning condition. A [[quantum/Glossary#Bell inequality|Bell inequality]] often appears as the score bound associated with such a game. [[quantum/Glossary#Entangled state|Entanglement]] can change the best achievable winning probability without allowing communication. The important habit is to ask what resource each strategy gets. Shared randomness, shared entanglement, and direct communication are different resources and should never be merged casually. ## How The Idea Actually Works The CHSH game is the smallest famous example, but the idea scales. A referee sends questions to spatially separated players. The players respond without talking to each other after the questions arrive. The winning condition is evaluated from the questions and answers together. Classical local-hidden-variable strategies can be modeled as shared randomness plus local response functions. Quantum strategies add shared entanglement. That extra resource can raise the winning probability in some games because the entangled measurements generate correlations beyond the classical local set. Why is this framework useful? Because it packages several deep ideas into one clean object. You can talk about optimal strategy, classical versus quantum value, Tsirelson-type bounds, and experimental realizations without constantly switching between incompatible formalisms. It is also a better language for generalization. Once you see CHSH as one instance of a nonlocal game rather than as a standalone miracle, you are in a better position to understand the rest of the literature. ## Why It Matters - It unifies Bell-style correlation tests under one operational framework. - It prepares you for Tsirelson bounds, device-independent reasoning, and randomness certification. - It helps you reason about quantum advantage without drifting into vague language. ## Related Questions > [!question] What are the ingredients of a nonlocal game? >> [!answer] A referee samples inputs, sends them to separated players, receives outputs, and checks a winning predicate. The resource model specifies whether the players share randomness, entanglement, or communication. > [!question] Why is shared entanglement not the same as communication? >> [!answer] Entanglement can change correlations between outputs, but each player's local output distribution cannot be used to transmit a chosen message during the game. Communication would let players adapt answers after seeing inputs, which is a different resource. > [!question] Why study games beyond CHSH? >> [!answer] CHSH is the entry point, but other games expose richer separations, stronger rigidity phenomena, and deeper links to proof systems and complexity theory. ## Additional Study Notes **Check yourself: no-communication with entanglement** The no-communication theorem still holds even when Alice and Bob share entanglement. Entanglement changes correlations revealed after comparison, not local message transmission. **Check yourself: measuring one half of a Bell pair** If Alice and Bob share $(|00\rangle+|11\rangle)/\sqrt{2}$ and Alice measures first, she learns her own outcome. She does not gain new information about Bob by sending a signal; the correlation is only useful once outcomes are compared. **Key fact: resource separation** Shared randomness, shared entanglement, and communication are different resources. Nonlocal games are useful partly because they make that distinction operational. **Question: Why is "entanglement lets them coordinate" an incomplete description?** It misses the no-communication constraint. Entanglement can make the joint distribution stronger than any shared-randomness strategy, but each player still produces an output using only local input, local measurement choice, and the pre-shared state. ## Study Checks Use these after the explanation, not before it. ### Quick Checks - What makes nonlocal games useful pedagogically? **Answer:** They convert correlation claims into operational input-output tasks with measurable winning probabilities. ## Practical Lab Extend beyond CHSH so nonlocal games feel like a framework rather than one isolated example. - Refactor your CHSH code into a reusable nonlocal-game notebook or module. - Add one more game, scoring rule, or constraint system beyond CHSH. - Summarize how entanglement changes the achievable success probability. ## Homework Use the homework to train careful reading of game definitions. - Define a nonlocal game in terms of inputs, outputs, and a winning condition. - Explain how shared entanglement differs from communication during the game. - Compare the role of nonlocal games with the role of Bell inequalities. ## References - Scott Aaronson, [Introduction to Quantum Information Science](https://www.scottaaronson.com/qclec.pdf), Lecture 14. - [[Resources]] - IBM Quantum Learning, [learning portal](https://quantum.cloud.ibm.com/learning/en). - MIT Open Learning Library, [quantum information sequence](https://openlearninglibrary.mit.edu/).