Related papers: Triacontagonal proofs of the Bell-Kochen-Specker t…
Kochen-Specker (KS) theorem denies the possibility for the noncontextual hidden variable theories to reproduce the predictions of quantum mechanics. A set of projection operators (projectors) and bases used to show the impossibility of…
Mermin's pentagram, a specific set of ten three-qubit observables arranged in quadruples of pairwise commuting ones into five edges of a pentagram and used to provide a very simple proof of the Kochen-Specker theorem, is shown to be…
A Kochen-Specker contradiction is produced with 36 vectors in a real 8-dimensional Hilbert space. These vectors can be combined into 30 distinct projection operators (14 of rank 2, and 16 of rank 1). A state-specific variant of this…
It is demonstrated that the set of 40 states of a spin-3/2 particle used by Zimba and Penrose to give proofs of the Kochen-Specker and Bell theorems is identical (i.e., unitarily equivalent) in CP(3) to the set of 40 rays derived from the…
We present a ``state-independent'' proof of the Bell-Kochen-Specker theorem using only 18 four-dimensional vectors, which is a record for this kind of proof. This set of vectors contains subsets which allow us to develop a…
A "magic rectangle" of eleven observables of four qubits, employed by Harvey and Chryssanthacopoulos (2008) to prove the Bell-Kochen-Specker theorem in a 16-dimensional Hilbert space, is given a neat finite-geometrical reinterpretation in…
We present a number of observables-based proofs of the Kochen-Specker (KS) theorem based on the N-qubit Pauli group for N >= 4, thus adding to the proofs that have been presented earlier for the two- and three-qubit groups. These proofs…
The Kochen-Specker (KS) theorem is a central result in quantum theory and has applications in quantum information. Its proof requires several yes-no tests that can be grouped in contexts or subsets of jointly measurable tests. Arguably, the…
We find a new highly symmetrical and very numerous class (millions of non-isomorphic sets) of 4-dim Kochen-Specker (KS) vector sets. Due to the nature of their geometrical symmetries, they cannot be obtained from previously known ones. We…
Yu and Oh [1] have given a state independent proof of the Kochen-Specker theorem in three dimensions using only 13 rays. The proof consists of showing that a non-contextual hidden variable theory necessarily leads to an inequality that is…
We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call "trihexes". Trihexes are analogous to fullerenes, which are 3-regular planar…
A new example of a saturated Kochen-Specker (KS) type configuration of 64 rays in 8-dimensional space (the Hilbert space of a triple of qubits) is constructed. It is proven that this configuration has a tropical dimension 6 and that it…
Aravind and Lee-Elkin (1997) gave a proof of the Bell-Kochen-Specker theorem by showing that it is impossible to color the 60 directions from the center of a 600-cell to its vertices in a certain way. This paper refines that result by…
For the first time we construct an infinite family of Kochen-Specker sets in a space of fixed dimension, namely in R^4. While most of the previous constructions of Kochen-Specker sets have been based on computer search, our construction is…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
We give a constructive and exhaustive definition of Kochen-Specker (KS) vectors in a Hilbert space of any dimension as well as of all the remaining vectors of the space. KS vectors are elements of any set of orthonormal states, i.e.,…
We discuss two approaches to producing generalized parity proofs of the Kochen-Specker theorem. Such proofs use contexts of observables whose product is $I$ or $-I$; we call them constraints. In the first approach, one starts with a fixed…
We present a method to obtain sets of vectors proving the Bell-Kochen-Specker theorem in dimension $n$ from a similar set in dimension $d$ ($3\leq d<n\leq 2d$). As an application of the method we find the smallest proofs known in dimension…
The challenge of determining bounds for the minimal number of vectors in a three-dimensional Kochen-Specker (KS) set has captivated the quantum foundations community for decades. This paper establishes a weak lower bound of 10 vectors,…
We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its…