Related papers: New Kochen-Specker Sets in Four Dimensions
The Kochen-Specker theorem states that exclusive and complete deterministic outcome assignments are impossible for certain sets of measurements, called Kochen-Specker (KS) sets. A straightforward consequence is that KS sets do not have…
According to Pavi\v{c}i{\'c}, Kochen and Specker's 117-observable set is not a ``Kochen-Specker set''. By the same reason, in arXiv:2502.13787, Pavi\v{c}i{\'c} claims that 10 statements in our paper ``Optimal conversion of Kochen-Specker…
The 240 root vectors of the Lie algebra E8 lead to a system of 120 rays in a real 8-dimensional Hilbert space that contains a large number of parity proofs of the Kochen-Specker theorem. After introducing the rays in a triacontagonal…
A proof of the generalized Kochen-Specker theorem in two dimensions due to Cabello and Nakamura is extended to all higher dimensions. A set of 18 states in four dimensions is used to give closely related proofs of the generalized…
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 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…
Coxeter pointed out that a number of polytopes can be projected orthogonally into two dimensions in such a way that their vertices lie on a number of concentric regular triacontagons (or 30-gons). Among them are the 600-cell and 120-cell in…
The Kochen-Specker theorem states that a 3-dimensional complex Euclidean space admits a finite configuration of projective lines such that the corresponding quantum observables (the orthogonal projectors) cannot be assigned with 0 and 1…
Bipartite perfect quantum strategies (BPQSs) allow two players isolated from each other to win every trial of a nonlocal game. BPQSs have crucial roles in recent developments in quantum information and quantum computation. However, only few…
The Kochen-Specker theorem states that noncontextual hidden variable theories are incompatible with quantum mechanics. We provide a state independent proof of the Kochen-Specker theorem using the smallest number of projectors, i.e., thirty…
We introduce two generalizations of Kochen-Specker (KS) sets: projective KS sets and generalized KS sets. We then use projective KS sets to characterize all graphs for which the chromatic number is strictly larger than the quantum chromatic…
The Kochen-Specker theorem states that noncontextual hidden variable models are inconsistent with the quantum predictions for every yes-no question on a qutrit, corresponding to every projector in three dimensions. It has been suggested [D.…
Quantum contextuality supports quantum computation and communication. One of its main vehicles is hypergraphs. The most elaborated are the Kochen-Specker ones, but there is also another class of contextual sets that are not of this kind.…
The Bell-Kochen-Specker theorem (BKS) theorem rules out realistic {\it non-contextual} theories by resorting to impossible assignments of rays among a selected set of maximal orthogonal bases. We investigate the geometrical structure of…
A number of new proofs of the Kochen-Specker theorem are given based on the observables of the three-qubit Pauli group. Each proof is presented in the form of a diagram from which it is obvious by inspection. Each of our observable-based…
It is shown that the 33 complex rays in three dimensions used by Penrose to prove the Bell-Kochen-Specker theorem have the same orthogonality relations as the 33 real rays of Peres, and therefore provide an isomorphic proof of the theorem.…
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…
The Subset Feedback Vertex Set problem generalizes the classical Feedback Vertex Set problem and asks, for a given undirected graph $G=(V,E)$, a set $S \subseteq V$, and an integer $k$, whether there exists a set $X$ of at most $k$ vertices…
The classical Feedback Vertex Set problem asks, for a given undirected graph G and an integer k, to find a set of at most k vertices that hits all the cycles in the graph G. Feedback Vertex Set has attracted a large amount of research in…
The Kochen-Specker theorem has been discussed intensely ever since its original proof in 1967. It is one of the central no-go theorems of quantum theory, showing the non-existence of a certain kind of hidden states models. In this paper, we…