Bell nonlocality is the experimentally testable incompatibility between quantum correlations and explanations based on local hidden variables. Its significance now extends beyond the foundations of quantum mechanics: a Bell-inequality violation can certify entanglement, randomness, measurement incompatibility, and cryptographic security without requiring a detailed model of the devices producing the observed data. This article develops the mathematical structure of Bell experiments and explains its role in device-independent quantum information. Conditional probability distributions are classified into local, quantum, and no-signalling sets; the Clauser-Horne-Shimony-Holt inequality is derived, and its classical, quantum, and algebraic limits are distinguished. Tsirelson’s bound is obtained from the CHSH operator, while Popescu-Rohrlich correlations demonstrate that no-signalling alone does not identify the quantum set. The relation between entanglement and nonlocality is examined through local entangled states, hidden nonlocality, and activation. Nonlocal games, semidefinite relaxations, self-testing, certified randomness, and device-independent quantum key distribution are treated as operational consequences of Bell violation. Particular attention is given to entropy accumulation, finite-data security, loophole-free experiments, and the limitations of device independence. Bell nonlocality emerges as both a foundational separation between classical and quantum causal models and a quantitative resource for cryptographic and informational tasks.
Bell nonlocality is the experimentally testable incompatibility between quantum correlations and explanations based on local hidden variables. Its significance now extends beyond the foundations of quantum mechanics: a Bell-inequality violation can certify entanglement, randomness, measurement incompatibility, and cryptographic security without requiring a detailed model of the devices producing the observed data. This article develops the mathematical structure of Bell experiments and explains its role in device-independent quantum information. Conditional probability distributions are classified into local, quantum, and no-signalling sets; the Clauser-Horne-Shimony-Holt inequality is derived, and its classical, quantum, and algebraic limits are distinguished. Tsirelson’s bound is obtained from the CHSH operator, while Popescu-Rohrlich correlations demonstrate that no-signalling alone does not identify the quantum set. The relation between entanglement and nonlocality is examined through local entangled states, hidden nonlocality, and activation. Nonlocal games, semidefinite relaxations, self-testing, certified randomness, and device-independent quantum key distribution are treated as operational consequences of Bell violation. Particular attention is given to entropy accumulation, finite-data security, loophole-free experiments, and the limitations of device independence. Bell nonlocality emerges as both a foundational separation between classical and quantum causal models and a quantitative resource for cryptographic and informational tasks.
Given a pair of isolated devices that accept random binary inputs and return binary outputs, a user can deduce from the observed data alone if the underlying mechanism can be explained classically. Bell's theorem further states that a classical explanation can be ruled out if the devices perform certain measurements on an entangled quantum state, underpinning the security of cryptographic protocols that are device-independent (DI). For certain protocols, such as those performed in a tight space, it might be difficult to perfectly enforce the non-signaling assumption required in Bell's theorem. This prompts the question: is quantum nonlocality robust to such imperfections? We show that if a binary channel sends a noisy copy of one party's input to the other before any measurements take place, the answer is yes. We completely characterize the vertices and facets of the local polytope in this scenario, and identify Bell inequalities that certify non-signaling quantum correlations. This is possible even when a near perfect copy of the input is sent. We go on to show that the identified inequalities are more robust to depolarizing noise than the Clauser-Horne-Shimony-Holt inequality when certifying DI randomness in this scenario. In addition, we characterize the local polytope when both parties receive a noisy copy of each other's input and make similar conclusions, leaving many new potential Bell inequalities to be explored.
Quantum entanglement is the defining feature of composite quantum systems, underpinning correlations beyond classical randomness and enabling quantum communication, cryptography, and error correction. Surveys treat entanglement, Bell nonlocality, contextuality, and decoherence in isolation or narrow subcommunities. This review advances a unified perspective analysing these phenomena as distinct but interrelated manifestations of nonclassical correlations with an operational structure. We organise bipartite entanglement through separability criteria, Schmidt decomposition, and partial-transpose techniques, and develop tools for nonlocal correlations based on Bell inequalities, Tsirelson’s bound, nonlocal games, and self-testing, emphasising device-independent protocols. We then examine contextuality and magic states as resources for quantum computational advantage beyond entanglement, clarifying their relationship to nonlocality. Finally, we characterise decoherence as environment-induced entanglement selecting classical records, and use this perspective to specify which aspects of the measurement problem it addresses and which require interpretational or dynamical extensions. Integrating these dimensions, the review clarifies how notions of nonclassicality relate, diverge, and underpin quantum technologies.
Nonlocal games provide a unified framework for studying the distinction between classical, quantum, and more general no-signaling correlations. In this work, we develop this perspective by connecting the Bell-locality framework to several complementary mathematical representations of nonlocal games and quantum strategies. We begin with local hidden-variable models, the CHSH inequality, and the role of Bell nonlocality as a device-independent witness of entanglement, and then introduce nonlocal games through the standard predicate/verifier formalism.
We next examine a set of representative examples, including XOR games, the GHZ game, graph-based coloring games, the Mermin-Peres magic square game, and Hardy's paradox as a related logical manifestation of nonlocality. Building on this foundation, we compare four closely related representation frameworks: conditional-probability and correlation descriptions, Bell-functional formulations, entangled-value optimization, and the quantum-operator approach together with the Navascues-Pironio-Acin (NPA) hierarchy. These viewpoints are then instantiated for the CHSH, magic square, and GHZ games, showing how each representation emphasizes a different aspect of the same underlying task.
Taken together, these examples show that nonlocal games can be studied simultaneously as geometric objects in correlation space, optimization problems over entangled resources, and operator-theoretic constructions. This multi-representation viewpoint clarifies the relation between Bell inequality violations, perfect quantum strategies, pseudo-telepathy, and semidefinite relaxations of quantum correlations.
Bell's theorem asserts that no local hidden variable theory can explain the predictions of quantum theory in an experiment where spacelike separated measurements are performed in distant laboratories. Loophole-free Bell tests performed in the last decade demonstrate Bell nonlocality as a property of Nature. However, the amount of nonlocality allowed in quantum theory is limited, compared to the sole restriction of no-signaling, meaning the impossibility of faster-than-light communication implied by special relativity. Information causality is a physical principle that generalizes no-signaling and is satisfied by quantum theory. It is based on the idea that shared quantum entanglement cannot enable a receiver to obtain more classical information than how much was sent by a distant sender. Remarkably, the principle was shown to imply the maximal quantum bound for the violation of the most well-known Bell inequality. The aim of this thesis is to widen our understanding of information causality and compare its predictions with other known outer approximations of the quantum set of correlations. We build upon the recent realization that most of the known consequences of information causality can be derived with a single copy of the shared systems, whereas before it was thought that many copies were necessary. We develop a novel optimization framework which bounds the possible violations of information causality by other sets of correlations, allowing us to certify when violations are not possible. We generalize the statement of information causality and reach a precise definition for the set of correlations satisfying this principle. We show that when searching for violations of information causality by physical theories, considering many copies is not necessary. Our aforementioned optimization framework approximates the information causality set from the outside. Conversely, we propose a different approach which allows us to approximate this set from the inside.
Nonlocal games provide a unified framework for studying the distinction between classical, quantum, and more general no-signaling correlations. This review connects the Bell-locality framework to several complementary mathematical representations of nonlocal games and quantum strategies. We begin with local hidden-variable models, the CHSH inequality, and the role of Bell nonlocality as a device-independent witness of entanglement. We then introduce nonlocal games through the standard predicate/verifier formalism and discuss representative examples, including XOR games, the GHZgame, graph-based colouring games, the Mermin–Peres magic square game, and Hardy’s paradox as a related logical manifestation of nonlocality. The central contribution of the article is a comparative organisation of four closely related representation frameworks: conditional-probability andcorrelation descriptions, Bell-functional formulations, entangled-value optimisation, and the quantum-operator approach together with the Navascu´es–Pironio–Ac´ın hierarchy. These viewpoints are instantiated for the CHSH, magic square, and GHZ games, showing how each representation emphasises a different aspect of the same underlying task. The resulting synthesis clarifies the relation between Bell inequality violations, perfect quantum strategies, pseudo-telepathy, and semidefinite relaxations of quantum correlations.
Device-independent quantum key distribution allows two users to set up shared cryptographic key without the need to trust the quantum devices used. Doing so requires nonlocal correlations between the users. However, in Farkas et al. [Phys. Rev. Lett. 127, 050503 (2021)PRLTAO0031-900710.1103/PhysRevLett.127.050503] it was shown that for known protocols nonlocality is not always sufficient, leading to the question of whether there is a fundamental lower bound on the minimum amount of nonlocality needed for any device-independent quantum key distribution implementation. Here, we show that no such bound exists, giving schemes that achieve key with correlations arbitrarily close to the local set. Furthermore, some of our constructions achieve the maximum of 1 bit of key per pair of entangled qubits. We achieve this by studying a family of Bell inequalities that constitute all self-tests of the maximally entangled state with a single linear Bell expression. Within this family there exist nonlocal correlations with the property that one pair of inputs yield outputs arbitrarily close to perfect key. Such correlations exist for a range of Clauser-Horne-Shimony-Holt values, including those arbitrarily close to the classical bound. Finally, we show the existence of quantum correlations that can generate both perfect key and perfect randomness simultaneously, while also displaying arbitrarily small Clauser-Horne-Shimony-Holt violation. This opens up the possibility of a new class of cryptographic protocol.