At the heart of the Conway-Kochen Free Will theorem and Kochen and Specker's argument against non-contextual hidden variable theories is the existence of a Kochen-Specker (KS) system: a set of points on the sphere that has no 0,1-coloring such that at most one of two orthogonal points are colored 1 and of three pairwise orthogonal points exactly one is colored 1. In public lectures, Conway encouraged the search for small KS systems. At the time of writing, the smallest known KS system has 31 vectors. Arends, Ouaknine and Wampler have shown that a KS system has at least 18 vectors, by reducing the problem to the existence of graphs with a topological embeddability and non-colorability property. The bottleneck in their search proved to be the sheer number of graphs on more than 17 vertices and deciding embeddability. Continuing their effort, we prove a restriction on the class of graphs we need to consider and develop a more practical decision procedure for embeddability to improve the lower bound to 22.
The Kochen–Specker (KS) theorem reveals the nonclassicality of single quantum systems. In contrast, Bell's theorem and entanglement concern the nonclassicality of composite quantum systems. Accordingly, unlike incompatibility, entanglement and Bell non-locality are not necessary to demonstrate KS-contextuality. However, here we find that for multiqubit systems, entanglement and non-locality are both essential to proofs of the Kochen–Specker theorem. Firstly, we show that unentangled measurements (a strict superset of local measurements) can never yield a logical (state-independent) proof of the KS theorem for multiqubit systems. In particular, unentangled but nonlocal measurements—whose eigenstates exhibit ''nonlocality without entanglement"—are insufficient for such proofs. This also implies that proving Gleason's theorem on a multiqubit system necessarily requires entangled projections, as shown by Wallach [Contemp Math, 305: 291-298 (2002)]. Secondly, we show that a multiqubit state admits a statistical (state-dependent) proof of the KS theorem if and only if it can violate a Bell inequality with projective measurements. We also establish the relationship between entanglement and the theorems of Kochen–Specker and Gleason more generally in multiqudit systems by constructing new examples of KS sets. Finally, we discuss how our results shed new light on the role of multiqubit contextuality as a resource within the paradigm of quantum computation with state injection.
Several types of nonclassical structures within the
N-qubit Pauli group that can be seen as fundamental resources for quantum information processing are presented and discussed. Identity products (IDs), structures fundamentally related to entanglement, are defined and explored. The Kochen-Specker (KS) theorem is proved by particular sets of IDs that we call KS sets. We also present a theorem that we call the
N-qubit Kochen-Specker (NKS) theorem, which is proved by particular sets of IDs that we call NKS sets, and whose utility is that it leads to efficient constructions for KS sets. We define the criticality, or irreducibility, of these structures, and its connection to entanglement. All representative critical IDs for up to
N=4 qubits are presented, and numerous families of critical IDs for arbitrarily large values of
N are discussed. The critical IDs for a given
N are a finite set of geometric objects that appear to fully characterize the nonclassicality of the
N-qubit Pauli group. Methods for constructing critical KS sets and NKS sets from IDs are given, and experimental tests of entanglement, contextuality, and nonlocality are discussed. Possible applications and connections to other work are also discussed.