In [Phys. Rev. Lett. 102, 010401 (2009)], Spekkens et al. have shown that quantum preparation contextuality can power the parity-oblivious multiplexing (POM) task. The bound on the optimal success probability of an
n-bit POM task performed with the classical resources was shown to be the same as in a preparation noncontextual theory. This noncontextual bound is violated if the task is performed with quantum resources. While in the 2-bit POM task the optimal quantum success probability is achieved, in the 3-bit case optimality was left as an open question. In this paper, we show that the quantum success probability of an
n-bit POM task is solely dependent on a suitable Bell expression and the optimal value of it optimizes the success probability of the said POM task. Further, we discuss how the degree of quantum preparation contextuality restricts the amount of quantum violations of Bell's inequalities, and consequently, the success probability of a POM task.
Identifying when observed statistics cannot be explained by any reasonable classical model is a central problem in quantum foundations. A principled and universally applicable approach to defining and identifying nonclassicality is given by the notion of generalized noncontextuality. Here, we study the typicality of contextuality, namely, the likelihood that randomly chosen quantum preparations and measurements produce nonclassical statistics. Using numerical linear programs to test for the existence of a generalized-noncontextual model, we find that contextuality is fairly common: even in experiments with only a modest number of random preparations and measurements, contextuality arises with probability over 99 % . We also show that while typicality of contextuality decreases as the purity (sharpness) of the preparations (measurements) decreases, this dependence is not especially pronounced, so contextuality is fairly typical even in settings with realistic noise. Finally, we show that although nonzero contextuality is quite typical, quantitatively high degrees of contextuality are not as typical, and so large quantum advantages (like for parity-oblivious multiplexing, which we take as a case study) are not as typical. We provide an open-source toolbox that outputs the typicality of contextuality as a function of tunable parameters (such as lower and upper bounds on purity and other constraints on states and measurements). This toolbox can inform the design of experiments that achieve the desired typicality of contextuality for specified experimental constraints.
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.
In a noncontextual hidden variable model of quantum theory, hidden variables determine the outcomes of every measurement in a manner that is independent of how the measurement is implemented. Using a generalization of this notion to arbitrary operational theories and to preparation procedures, we demonstrate that a particular two-party information-processing task, "parity-oblivious multiplexing," is powered by contextuality in the sense that there is a limit to how well any theory described by a noncontextual hidden variable model can perform. This bound constitutes a "noncontextuality inequality" that is violated by quantum theory. We report an experimental violation of this inequality in good agreement with the quantum predictions. The experimental results also provide the first demonstration of 2-to-1 and 3-to-1 quantum random access codes.
A central question in quantum information is whether a given set of states can provide an advantage in some information-processing task. We establish a universal connection between two such questions: how well a set of states can be discriminated, and whether it can power tasks whose advantage stems from generalized contextuality. Working in the framework of generalized probabilistic theories (GPTs), which includes quantum and classical systems as special cases, we show that any set of states able to provide a nonclassical advantage in a contextuality-powered task must obey nontrivial upper bounds on the success probability of every state discrimination task using the full set. Contextual advantage therefore implies limited distinguishability, exposing a trade-off between two basic operational resources. Importantly, this is more than a statement about the idealized limit: perfect distinguishability is not needed to preclude contextuality. Our thresholds lie strictly below unity, so any set whose discrimination performance exceeds them while still imperfectly distinguishable is already guaranteed to admit a noncontextual explanation. The bounds follow from a simple geometric property, linear dependence of the state set, take a closed analytical form, and depend only on the prior of the task and the convex geometry of the states. As an illustration, we apply them to generalized parity-oblivious multiplexing, where sufficiently high success in the task implies that at least one sub-ensemble of the codebook cannot power any contextual advantage.
Generalized contextuality is a resource for a wide range of communication and information processing protocols. However, contextuality is not possible without coherence, and so can be destroyed by dephasing noise. Here, we explore the robustness of contextuality to partially dephasing noise in a scenario related to state discrimination (for which contextuality is a resource). We find that a vanishing amount of coherence is sufficient to demonstrate the failure of noncontextuality in this scenario, and we give a proof of contextuality that is robust to arbitrary amounts of partially dephasing noise. This is in stark contrast to partially depolarizing noise, which is always sufficient to destroy contextuality.