摘要

Let random vectors represent joint measurements of certain subsets of properties in different contexts . Such a system is traditionally called noncontextual if there exists a jointly distributed set of random variables such that has the same distribution as for all A trivial necessary condition for noncontextuality and a precondition for many measures of contextuality is that the system is consistently connected, i.e., all measuring the same property have the same distribution. The contextuality-by-default (CbD) approach allows defining more general measures of contextuality that apply to inconsistently connected systems as well, but at the price of a higher computational cost. In this paper we propose a novel measure of contextuality that shares the generality of the CbD approach and the computational benefits of the previously proposed negative probability (NP) approach. The present approach differs from CbD in that instead of considering all possible joints of the double-indexed random variables , it considers all possible approximating single-indexed systems . The degree of contextuality is defined based on the minimum possible probabilistic distance of the actual measurements from . We show that this measure, called the optimal approximation (OA) measure, agrees with a certain measure of contextuality of the CbD approach for all systems where each property enters in exactly two contexts. The OA measure can be calculated far more efficiently than the CbD measure and even more efficiently than the NP measure for sufficiently large systems. We also define a variant, the OA-NP measure of contextuality that agrees with the NP measure for consistently connected (non-signaling) systems while extending it to inconsistently connected systems.

  • 出版日期2017-7

全文