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

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•2 citations

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•5 citations

Optimal measurement structures for contextuality applications

Yuan Liu, Ravishankar Ramanathan, Karol Horodecki +2 more

Abstract The Kochen-Specker (KS) theorem is a corner-stone result in the foundations of quantum mechanics describing the fundamental difference between quantum theory and classical non-contextual theories. Recently specific substructures termed $01$-gadgets were shown to exist within KS proofs that capture the essential contradiction of the theorem. Here, we show these gadgets and their generalizations provide an optimal toolbox for contextuality applications including (i) constructing classical channels exhibiting entanglement-assisted advantage in zero-error communication, (ii) identifying large separations between quantum theory and binary generalised probabilistic theories, and (iii) finding optimal tests for contextuality-based semi-device-independent randomness generation. Furthermore, we introduce and study a generalisation to definite prediction sets for more general logical propositions, that we term higher-order gadgets. We pinpoint the role these higher-order gadgets play in KS proofs by identifying these as induced subgraphs within KS graphs and showing how to construct proofs of state-independent contextuality using higher-order gadgets as building blocks. The constructions developed here may help in solving some of the remaining open problems regarding minimal proofs of the Kochen-Specker theorem.

arXiv:2206.13139•npj Quantum Information•Jun 29, 2023•3 citations

A variant of the Kochen-Specker theorem localising value indefiniteness

Alastair A. Abbott, Cristian S. Calude, Karl Svozil

The Kochen-Specker theorem proves the inability to assign, simultaneously, noncontextual definite values to all (of a finite set of) quantum mechanical observables in a consistent manner. If one assumes that any definite values behave noncontextually, one can nonetheless only conclude that some observables (in this set) are value indefinite. In this paper, we prove a variant of the Kochen-Specker theorem showing that, under the same assumption of noncontextuality, if a single one-dimensional projection observable is assigned the definite value 1, then no one-dimensional projection observable that is incompatible (i.e., non-commuting) with this one can be assigned consistently a definite value. Unlike standard proofs of the Kochen-Specker theorem, in order to localise and show the extent of value indefiniteness, this result requires a constructive method of reduction between Kochen-Specker sets. If a system is prepared in a pure state ψ, then it is reasonable to assume that any value assignment (i.e., hidden variable model) for this system assigns the value 1 to the observable projecting onto the one-dimensional linear subspace spanned by ψ, and the value 0 to those projecting onto linear subspaces orthogonal to it. Our result can be interpreted, under this assumption, as showing that the outcome of a measurement of any other incompatible one-dimensional projection observable cannot be determined in advance, thus formalising a notion of quantum randomness.

arXiv:1503.01985•Journal of Mathematical Physics•Oct 1, 2015•60 citations
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.
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.
Abstract The Kochen-Specker (KS) theorem is a corner-stone result in the foundations of quantum mechanics describing the fundamental difference between quantum theory and classical non-contextual theories. Recently specific substructures termed 010101-gadgets were shown to exist within KS proofs that capture the essential contradiction of the theorem. Here, we show these gadgets and their generalizations provide an optimal toolbox for contextuality applications including (i) constructing classical channels exhibiting entanglement-assisted advantage in zero-error communication, (ii) identifying large separations between quantum theory and binary generalised probabilistic theories, and (iii) finding optimal tests for contextuality-based semi-device-independent randomness generation. Furthermore, we introduce and study a generalisation to definite prediction sets for more general logical propositions, that we term higher-order gadgets. We pinpoint the role these higher-order gadgets play in KS proofs by identifying these as induced subgraphs within KS graphs and showing how to construct proofs of state-independent contextuality using higher-order gadgets as building blocks. The constructions developed here may help in solving some of the remaining open problems regarding minimal proofs of the Kochen-Specker theorem.
The Kochen-Specker theorem proves the inability to assign, simultaneously, noncontextual definite values to all (of a finite set of) quantum mechanical observables in a consistent manner. If one assumes that any definite values behave noncontextually, one can nonetheless only conclude that some observables (in this set) are value indefinite. In this paper, we prove a variant of the Kochen-Specker theorem showing that, under the same assumption of noncontextuality, if a single one-dimensional projection observable is assigned the definite value 1, then no one-dimensional projection observable that is incompatible (i.e., non-commuting) with this one can be assigned consistently a definite value. Unlike standard proofs of the Kochen-Specker theorem, in order to localise and show the extent of value indefiniteness, this result requires a constructive method of reduction between Kochen-Specker sets. If a system is prepared in a pure state ψ, then it is reasonable to assume that any value assignment (i.e., hidden variable model) for this system assigns the value 1 to the observable projecting onto the one-dimensional linear subspace spanned by ψ, and the value 0 to those projecting onto linear subspaces orthogonal to it. Our result can be interpreted, under this assumption, as showing that the outcome of a measurement of any other incompatible one-dimensional projection observable cannot be determined in advance, thus formalising a notion of quantum randomness.