Complexity of contextuality

Generalized contextuality is a hallmark of nonclassical theories like quantum mechanics. Yet, three fundamental computational problems concerning its decidability and complexity remain open: first, determining the complexity of deciding if a theory admits a noncontextual ontological model; second, determining the complexity of deciding if such a model is possible for a specific dimension <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"> <a:mi>k</a:mi> </a:math> ; and, third, efficiently computing the smallest such model when it exists, given that finding the smallest ontological model is NP-hard. We address the second problem by presenting an algorithm derived from a geometric formulation and its reduction to the intermediate simplex problem in computational geometry. We find that the complexity of deciding the existence of a noncontextual ontological model of dimension <b:math xmlns:b="http://www.w3.org/1998/Math/MathML"> <b:mi>k</b:mi> </b:math> is at least exponential in the dimension of the theory and at most exponential in <c:math xmlns:c="http://www.w3.org/1998/Math/MathML"> <c:mi>k</c:mi> </c:math> . This, in turn, implies that computing the smallest noncontextual ontological model is inefficient in general. Finally, we demonstrate the fundamental difference between finding the smallest noncontextual ontological model and the smallest ontological model using an explicit example wherein the respective minimum ontic sizes are five and four.