Communication games are collaborative information processing tasks involving a number of players with limited communication. Such games are useful tools for studying physical theories. A physical theory exhibits preparation contextuality whenever observed behaviour cannot be explained by a preparation noncontextual model. Here we show that there is a fundamental connection between the performance in communication games and the degree of preparation (non)contextuality. For this purpose, we present a general framework that allows us to construct communication games such that the game performance corresponds to a measure of preparation (non)contextuality. We illustrate the power of this framework by, 1) deriving many examples of tests of preparation contextuality, 2) showing that quantum violations of Bell inequalities can be derived from quantum violations of preparation noncontextuality, 3) qualitatively and quantitatively explaining related previous results on preparation contextuality in quantum communication games, and 4) solving the open problem of revealing the preparation contextuality of the maximally mixed quantum state in any dimension.
An ontological model of an operational theory is considered to be universally noncontextual if both preparation and measurement noncontextuality assumptions are satisfied in that model. In this report, we first generalize the logical proofs of quantum preparation and measurement contextuality for qubit system for any odd number of preparations and measurements. Based on the logical proof, we derive testable universally non-contextual inequalities violated by quantum theory. We then propose a class of two-party communication games and show that the average success probability of winning such games is solely linked to suitable Bell expression whose local bound is greater than universal non-contextual bound. Thus, for a given state, even if quantum theory does not exhibit non-locality, it may still reveal non-classicality by violating the universal non-contextual bound. Further, we consider a different communication game to demonstrate that for a given choices of observables in quantum theory, even if there is no logical proof of preparation and measurement contextuality exist, the universal quantum contextuality can be revealed through that communication game. Such a game thus test a weaker form of universal non-contextuality with minimal assumption.
We introduce a hierarchy of semidefinite relaxations of the set of quantum correlations in generalized contextuality scenarios.This constitutes a simple and versatile tool for bounding the magnitude of quantum contextuality.To illustrate its utility, we use it to determine the maximal quantum violation of several noncontextuality inequalities whose maximum violations were previously unknown.We then go further and use it to prove that certain preparation-contextual correlations cannot be explained with pure states, thereby showing that mixed states are an indispensable resource for contextuality.In the second part of the paper, we turn our attention to the simulation of preparation-contextual correlations in general operational theories.We introduce the information cost of simulating preparation contextuality, which quantifies the additional, otherwise forbidden, information required to simulate contextual correlations in either classical or quantum models.In both cases, we show that the simulation cost can be efficiently bounded using a variant of our hierarchy of semidefinite relaxations, and we calculate it exactly in the simplest contextuality scenario of parity-oblivious multiplexing.
Abstract The parity-oblivious random-access-code (PORAC) is a class of communication games involving a sender (Alice) and a receiver (Bob). In such games, Alice’s amount of communication to Bob is constraint by the parity-oblivious (PO) conditions, so that the parity information of her inputs remains oblivious to Bob. The PO condition in an operational theory is equivalently represented in an ontological model that satisfies the preparation noncontextuality. In this paper, we provide a nontrivial generalization of the existing two-level PORAC and derive the winning probability of the game in the preparation noncontextual ontological model. We demonstrate that the quantum theory outperforms the preparation noncontextual model by predicting higher winning probability in our generalized PORAC.
The quantum ontological feature of contextuality apart from being central to foundations of quantum theory forms the basis of quantum advantage in a multitude of information processing tasks. In particular, the contextuality of preparation procedures was shown to power a particular two-party information processing task “parity oblivious multiplexing” (Spekkens et al. Phys Rev Lett 102:010401 (2009). Specifically, it was shown that there exists a limit to how well any preparation noncontextual theory can perform in this task. This limit constitutes a noncontextuality inequality. Moreover, the authors demonstrated quantum violation of this inequality along with preparation contextuality associated with the ontic description underlying two-level completely mixed quantum state. In this work, we extend these arguments to apply to arbitrary dimensions by introducing a class of two-party information processing tasks, namely d-level parity oblivious random access codes. We analytically obtain classical (or equivalently preparation noncontextual) bounds on the success probability for these tasks for arbitrary d. For each value of d, this bound constitutes a unique noncontextuality inequality. Remarkably, these bounds are independent of the amount of communication. Furthermore, we find a classical protocol utilizing a
dc=d -dimensional classical message which saturates this bound. In order to establish nontriviality of these inequalities, we provide evidence of significant quantum violations. Specifically, by numerical techniques, we show that for
d=3,…,10 , the noncontextuality bound is violated by quantum theory. (1) We provide explicit quantum protocols which violate the associated noncontextuality inequality for
d=3,4,5 employing
dq=d -leveled quantum systems. (2) Using see-saw semi-definite programming (SDP) technique, we find evidence (lower bounds) of significant quantum violation of these inequalities for
d=3,…,10 . (3) With the help of state-of-the-art (NPA-hierarchy like) SDP technique, we provide upper bounds (independent of the dimension of the involved quantum systems) on quantum violation for
d=3,…,10 . The introduced class of information tasks, thus, provides for operational depiction of preparation contextuality of the ontic description underlying mixed higher dimensional quantum systems.
We investigate discriminability from an operational and contextuality-oriented perspective using a two-copy comparison game based on SWAP-type measurements. The resulting score
Dop provides an experimentally accessible notion of distinguishability that does not rely on a minimum-error discrimination task. We first examine whether this discriminability game can directly witness preparation contextuality. Within a preparation-noncontextual ontological model, we derive a direct upper bound on the game score under a SWAP-like comparison rule and a sharp single-copy test, and show that this bound is saturated in the natural qubit realization. Thus, the direct game alone does not provide a contextuality witness in that regime. We then consider a Bell-coupled scenario in which two-copy comparison measurements are applied to Bob's conditional preparations. This yields a state-dependent upper bound on the CHSH value in terms of operational separation parameters, and hence in terms of the distinguishability of the conditional states. Our results establish a quantitative link between operational discriminability and the strength of nonclassical correlations, showing that discriminability can act as an operational resource constraining Bell-type nonclassical correlations.