Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2402.09186 · npj Quantum Information

Generalised Kochen–Specker theorem for finite non-deterministic outcome assignments

Ravishankar Ramanathan

Published Oct 10, 2024• 2 citations
arXivHTMLPDF

Abstract

The Kochen–Specker (KS) theorem is a cornerstone result in quantum foundations, establishing that quantum correlations in Hilbert spaces of dimension d ≥ 3 cannot be explained by (consistent) hidden variable theories that assign a single deterministic outcome to each measurement. Specifically, there exist finite sets of vectors in these dimensions such that no non-contextual deterministic ({0, 1}) outcome assignment is possible obeying the rules of exclusivity and completeness—that the sum of assignments to every set of mutually orthogonal vectors be ≤1 and the sum of value assignments to any d mutually orthogonal vectors be equal to 1. Another central result in quantum foundations is Gleason’s theorem that justifies the Born rule as a mathematical consequence of the quantum formalism. The KS theorem can be seen as a consequence of Gleason’s theorem and the logical compactness theorem. In a similar vein, Gleason’s theorem also indicates the existence of KS-type finite vector constructions to rule out other finite-alphabet outcome assignments beyond the {0, 1} case. Here, we propose a generalisation of the KS theorem that rules out hidden variable theories with outcome assignments in the set {0, p, 1 − p, 1} for p ∈ [0, 1/d) ∪ (1/d, 1/2]. The case p = 1/2 is especially physically significant. We show that in this case the result rules out (consistent) hidden variable theories that are fundamentally binary, i.e., theories where each measurement has fundamentally at most two outcomes (in contrast to the single deterministic outcome per measurement ruled out by KS). We present a device-independent application of this generalised KS theorem by constructing a two-player non-local game for which a perfect quantum winning strategy exists (a Pseudo-telepathy game) while no perfect classical strategy exists even if the players are provided with additional no-signaling resources of PR-box type (with marginals in {0, 1/2, 1}).

DOI
10.1038/s41534-024-00895-w

Related papers

Strong Kochen-Specker contextuality to rule out discrete nondeterministic alternatives to quantum theory

Ravishankar Ramanathan

Abstract Gleason’s theorem identifies the Born rule via non-contextuality over an infinite continuous lattice of projectors, while its corollary the Kochen-Specker (KS) theorem rules out the specific class of deterministic ({0, 1}-valued) noncontextual models using finite sets of projectors. Gleason’s theorem also indicates the existence of KS-type finite vector constructions to rule out other discrete nondeterministic alternatives to quantum theory beyond the {0, 1} case. Here, we construct finite measurement configurations to rule out noncontextual empirical models with outcome probabilities drawn from an arbitrary finite subset O ⊂ [0, 1]. We do this by two means: (i) constructing a family of experimentally feasible state-dependent Hardy-type tests, and (ii) proving a generalized KS theorem for a broad class of O that includes prior results as special cases. In the sheaf-theoretic framework of Abramsky and Brandenburger, a hierarchy of probabilistic-possibilistic-strong contex-tuality has been established quantifying contextuality as a resource. We extend this framework by introducing strong O-valued contextuality, showing that quantum theory evades global sections of all finite-valued presheaves. We also discuss the implications of the result on finite many-valued logics as viable ontological models for quantum theory and for contextuality-based (semi)-device-independent protocols.

•Sep 21, 2026•0 citations

Strong $O$-valued contextuality: ruling out discrete nondeterministic alternatives to quantum theory

Ravishankar Ramanathan

Gleason's theorem identifies the Born rule via non-contextuality over an infinite continuous lattice of projectors, while its corollary the Kochen-Specker (KS) theorem rules out the specific class of deterministic ($\{0,1\}$-valued) noncontextual models using finite sets of projectors. Gleason's theorem also indicates the existence of KS-type finite vector constructions to rule out other discrete nondeterministic alternatives to quantum theory beyond the $\{0, 1\}$ case. Here, we construct finite measurement configurations to rule out noncontextual empirical models with outcome probabilities drawn from an arbitrary finite subset $O \subset [0,1]$. We do this by two means: (i) constructing a family of experimentally feasible state-dependent Hardy-type tests, and (ii) proving a generalized KS theorem for a broad class of $O$ that includes prior results as special cases. In the sheaf-theoretic framework of Abramsky and Brandenburger, a hierarchy of probabilistic-possibilistic-strong contextuality has been established quantifying contextuality as a resource. We extend this framework by introducing strong $O$-valued contextuality, showing that quantum theory evades global sections of all finite-valued presheaves. We also discuss the implications of the result on finite many-valued logics as viable ontological models for quantum theory and for contextuality-based (semi)-device-independent protocols.

quant-pharXiv:2607.14931•Jul 17, 2026•0 citations

Proving Kochen-Specker Theorem Using Projection Measurement and Positive Operator-Valued Measure

S. P. Toh

One of the main theorems on the impossibility of hidden variables in quantum mechanics is Kochen-Specker theorem (KS). This theorem says that any hidden variable theory that satisfies quantum mechanics must be contextual. More specifically, it asserts that, in Hilbert space of dimension ≥ 3, it is impossible to associate definite numerical values, 1 or 0, with every projection operator Pm, in such a way that, if a set of commuting Pm satisfies 1=ΣmP, the corresponding values will also satisfy . Since the first proof of Kochen and Specker using 117 vectors in R3, there were many attempts to reduce the number of vector either via conceiving ingenious models or extending the system being considered to higher dimension. By considering eight dimensional three qubits system, we found a state dependent proof that requires only five vectors. The state that we assign value of 1 is the ray that arises from intersection of two planes. The recent advancements show that the KS theorem proof can be extended to two dimensional quantum system through generalized measurement represented by positive operator-valued measured (POVM). In POVMs the number of available outcomes of a measurement may be higher than the dimensionality of the Hilbert space and N-outcome generalized measurement is represented by N-element POVM which consists of N positive semidefinite operators {}dE that sum to identity. Each pair of elements is not mutually orthogonal if the number of outcome of measurements is bigger than the dimensionality. In terms of POVM, Kochen-Specker theorem asserts that and could not be satisfied for . We developed a general model that enables us to generate different sizes of the POVM for the proof of the Kochen-Specker theorem. We show that the current simplest Nakamura model is in fact a special case of our model. W also provide another model which is as simple as the Nakamura’s but consists of different sets of POVM.

•Jan 1, 2008•0 citations

Reexamination of the Kochen-Specker theorem: Relaxation of the completeness assumption

Kelvin Onggadinata, Dagomir Kaszlikowski, Paweł Kurzyński

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 joint probability distributions because no set of joint outcomes over such a distribution can be constructed. However, we show it is possible to construct a joint quasiprobability distribution over any KS set by relaxing the completeness assumption. Interestingly, completeness is still observable at the level of measurable marginal probability distributions. This suggests the observable completeness might not be a fundamental feature, but a secondary property.

arXiv:2210.06822•Physical Review A•Feb 22, 2023•1 citation

Kochen-Specker Sets with a Mixture of 16 Rank-1 and 14 Rank-2 Projectors for a Three-Qubit System

S. P. Toh

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 noncontextual definite values assignment is named as the KS set. Since one KS set with a mixture of 16 rank-1 projectors and 14 rank-2 projectors was proposed in 1995 [Kernaghan M and Peres A Phys. Lett. A 198 (1995) 1 ] for a three-qubit system, there have been plenty of the same type KS sets and we propose a systematic way to produce them. We also propose a probabilistic state-dependent proof of the KS theorem that mainly focuses on the values assignment for all the rank-2 projectors.

arXiv:1310.0179•Chinese Physics Letters•Oct 1, 2013•6 citations

Infinitary real-valued logic and a refinement of the Kochen-Specker theorem

Olivia Aubone, José Iovino

We prove that every obstruction to noncontextual hidden variables in quantum mechanics is finite, including the obstructions that rest on Gleason's hypothesis of countable additivity. Since Kochen and Specker, such obstructions have been certified by finite configurations of rays, at the level of propositional logic: once a configuration is fixed, the obstruction is the inconsistency of finitely many Boolean constraints. Compactness, the source of these configurations, cannot reach the obstructions that rest on countable additivity: in infinite dimension the finite-dimensional events admit a finitely additive noncontextual valuation, and countable additivity constrains infinitely many events at once. The tool is a theorem of infinitary real-valued logic that takes the place of compactness: every countable theory of closed conditions without models is refuted by a well-founded tree of finite contradictions, given by the winning strategies of a model existence game. Quantum probability is axiomatized by such a theory, whose standard models are exactly those of Gleason's theorem. In the strategy we construct, a hypothetical noncontextual measure is not refuted by a configuration fixed in advance: through countable additivity, the measure itself selects the four-dimensional subspace in which the measure fails. The same logic defines, in the standard models, exactly the $σ$-projective sets of probabilities. Statements about $σ$-projective sets often go beyond ZFC, as the measurability of all these sets does; our theorems are nevertheless proved in ZFC, since the only determinacy they use is that of open games.

arXiv:2611.05656•Nov 3, 2026•1 citation
The Kochen–Specker (KS) theorem is a cornerstone result in quantum foundations, establishing that quantum correlations in Hilbert spaces of dimension d ≥ 3 cannot be explained by (consistent) hidden variable theories that assign a single deterministic outcome to each measurement. Specifically, there exist finite sets of vectors in these dimensions such that no non-contextual deterministic ({0, 1}) outcome assignment is possible obeying the rules of exclusivity and completeness—that the sum of assignments to every set of mutually orthogonal vectors be ≤1 and the sum of value assignments to any d mutually orthogonal vectors be equal to 1. Another central result in quantum foundations is Gleason’s theorem that justifies the Born rule as a mathematical consequence of the quantum formalism. The KS theorem can be seen as a consequence of Gleason’s theorem and the logical compactness theorem. In a similar vein, Gleason’s theorem also indicates the existence of KS-type finite vector constructions to rule out other finite-alphabet outcome assignments beyond the {0, 1} case. Here, we propose a generalisation of the KS theorem that rules out hidden variable theories with outcome assignments in the set {0, p, 1 − p, 1} for p ∈ [0, 1/d) ∪ (1/d, 1/2]. The case p = 1/2 is especially physically significant. We show that in this case the result rules out (consistent) hidden variable theories that are fundamentally binary, i.e., theories where each measurement has fundamentally at most two outcomes (in contrast to the single deterministic outcome per measurement ruled out by KS). We present a device-independent application of this generalised KS theorem by constructing a two-player non-local game for which a perfect quantum winning strategy exists (a Pseudo-telepathy game) while no perfect classical strategy exists even if the players are provided with additional no-signaling resources of PR-box type (with marginals in {0, 1/2, 1}).
Abstract Gleason’s theorem identifies the Born rule via non-contextuality over an infinite continuous lattice of projectors, while its corollary the Kochen-Specker (KS) theorem rules out the specific class of deterministic ({0, 1}-valued) noncontextual models using finite sets of projectors. Gleason’s theorem also indicates the existence of KS-type finite vector constructions to rule out other discrete nondeterministic alternatives to quantum theory beyond the {0, 1} case. Here, we construct finite measurement configurations to rule out noncontextual empirical models with outcome probabilities drawn from an arbitrary finite subset O ⊂ [0, 1]. We do this by two means: (i) constructing a family of experimentally feasible state-dependent Hardy-type tests, and (ii) proving a generalized KS theorem for a broad class of O that includes prior results as special cases. In the sheaf-theoretic framework of Abramsky and Brandenburger, a hierarchy of probabilistic-possibilistic-strong contex-tuality has been established quantifying contextuality as a resource. We extend this framework by introducing strong O-valued contextuality, showing that quantum theory evades global sections of all finite-valued presheaves. We also discuss the implications of the result on finite many-valued logics as viable ontological models for quantum theory and for contextuality-based (semi)-device-independent protocols.
Strong OOO-valued contextuality: ruling out discrete nondeterministic alternatives to quantum theory
Gleason's theorem identifies the Born rule via non-contextuality over an infinite continuous lattice of projectors, while its corollary the Kochen-Specker (KS) theorem rules out the specific class of deterministic ({0,1}\{0,1\}{0,1}-valued) noncontextual models using finite sets of projectors. Gleason's theorem also indicates the existence of KS-type finite vector constructions to rule out other discrete nondeterministic alternatives to quantum theory beyond the {0,1}\{0, 1\}{0,1} case. Here, we construct finite measurement configurations to rule out noncontextual empirical models with outcome probabilities drawn from an arbitrary finite subset O⊂[0,1]O \subset [0,1]O⊂[0,1]. We do this by two means: (i) constructing a family of experimentally feasible state-dependent Hardy-type tests, and (ii) proving a generalized KS theorem for a broad class of OOO that includes prior results as special cases. In the sheaf-theoretic framework of Abramsky and Brandenburger, a hierarchy of probabilistic-possibilistic-strong contextuality has been established quantifying contextuality as a resource. We extend this framework by introducing strong OOO-valued contextuality, showing that quantum theory evades global sections of all finite-valued presheaves. We also discuss the implications of the result on finite many-valued logics as viable ontological models for quantum theory and for contextuality-based (semi)-device-independent protocols.
One of the main theorems on the impossibility of hidden variables in quantum mechanics is Kochen-Specker theorem (KS). This theorem says that any hidden variable theory that satisfies quantum mechanics must be contextual. More specifically, it asserts that, in Hilbert space of dimension ≥ 3, it is impossible to associate definite numerical values, 1 or 0, with every projection operator Pm, in such a way that, if a set of commuting Pm satisfies 1=ΣmP, the corresponding values will also satisfy . Since the first proof of Kochen and Specker using 117 vectors in R3, there were many attempts to reduce the number of vector either via conceiving ingenious models or extending the system being considered to higher dimension. By considering eight dimensional three qubits system, we found a state dependent proof that requires only five vectors. The state that we assign value of 1 is the ray that arises from intersection of two planes. The recent advancements show that the KS theorem proof can be extended to two dimensional quantum system through generalized measurement represented by positive operator-valued measured (POVM). In POVMs the number of available outcomes of a measurement may be higher than the dimensionality of the Hilbert space and N-outcome generalized measurement is represented by N-element POVM which consists of N positive semidefinite operators {}dE that sum to identity. Each pair of elements is not mutually orthogonal if the number of outcome of measurements is bigger than the dimensionality. In terms of POVM, Kochen-Specker theorem asserts that and could not be satisfied for . We developed a general model that enables us to generate different sizes of the POVM for the proof of the Kochen-Specker theorem. We show that the current simplest Nakamura model is in fact a special case of our model. W also provide another model which is as simple as the Nakamura’s but consists of different sets of POVM.
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 joint probability distributions because no set of joint outcomes over such a distribution can be constructed. However, we show it is possible to construct a joint quasiprobability distribution over any KS set by relaxing the completeness assumption. Interestingly, completeness is still observable at the level of measurable marginal probability distributions. This suggests the observable completeness might not be a fundamental feature, but a secondary property.
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 noncontextual definite values assignment is named as the KS set. Since one KS set with a mixture of 16 rank-1 projectors and 14 rank-2 projectors was proposed in 1995 [Kernaghan M and Peres A Phys. Lett. A 198 (1995) 1 ] for a three-qubit system, there have been plenty of the same type KS sets and we propose a systematic way to produce them. We also propose a probabilistic state-dependent proof of the KS theorem that mainly focuses on the values assignment for all the rank-2 projectors.
We prove that every obstruction to noncontextual hidden variables in quantum mechanics is finite, including the obstructions that rest on Gleason's hypothesis of countable additivity. Since Kochen and Specker, such obstructions have been certified by finite configurations of rays, at the level of propositional logic: once a configuration is fixed, the obstruction is the inconsistency of finitely many Boolean constraints. Compactness, the source of these configurations, cannot reach the obstructions that rest on countable additivity: in infinite dimension the finite-dimensional events admit a finitely additive noncontextual valuation, and countable additivity constrains infinitely many events at once. The tool is a theorem of infinitary real-valued logic that takes the place of compactness: every countable theory of closed conditions without models is refuted by a well-founded tree of finite contradictions, given by the winning strategies of a model existence game. Quantum probability is axiomatized by such a theory, whose standard models are exactly those of Gleason's theorem. In the strategy we construct, a hypothetical noncontextual measure is not refuted by a configuration fixed in advance: through countable additivity, the measure itself selects the four-dimensional subspace in which the measure fails. The same logic defines, in the standard models, exactly the σσσ-projective sets of probabilities. Statements about σσσ-projective sets often go beyond ZFC, as the measurability of all these sets does; our theorems are nevertheless proved in ZFC, since the only determinacy they use is that of open games.