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:2611.05656

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

Olivia Aubone, José Iovino

Published Nov 3, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2611.05656

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

Noncontextual Hidden Variables and Physical Measurements

Adrian Kent

Meyer [Phys. Rev. Lett. 83, 3751 (1999)] recently showed that the Kochen-Specker theorem, which demonstrates the impossibility of a deterministic hidden variable description of ideal spin measurements on a spin 1 particle, can be effectively nullified if only finite precision measurements are considered. We generalize this result: one can ascribe consistent outcomes to a dense subset of the set of projection valued measurements, or to a dense subset of the set of positive operator valued measurements, on any finite dimensional system. Hence no Kochen-Specker-like contradiction can rule out hidden variable theories indistinguishable from quantum theory by finite precision measurements in either class.

arXiv:quant-ph/9906006•Physical Review Letters•Nov 8, 1999•106 citations

Complexity of Satisfiability in Kochen-Specker Partial Boolean Algebras

Anuj Dawar, Nihil Shah

The Kochen-Specker no-go theorem established that hidden-variable theories in quantum mechanics necessarily admit contextuality. This theorem is formally stated in terms of the partial Boolean algebra structure of projectors on a Hilbert space. Each partial Boolean algebra provides a semantics for interpreting propositional logic. In this paper, we examine the complexity of propositional satisfiablity for various classes of partial Boolean algebras. We first show that the satisfiability problem for the class of non-trivial partial Boolean algebras is NP-complete. Next, we consider the satisfiability problem for the class of partial Boolean algebras arising from projectors on finite dimensional Hilbert spaces. For real Hilbert spaces of dimension greater 2 and any complex Hilbert spaces of dimension greater than 3, we demonstrate that the satisfiablity problem is complete for the existential theory of the reals. Interestingly, the proofs of these results make use of Kochen-Specker sets as gadgets. As a corollary, we conclude that deciding quantum homomorphism in these fixed dimensions are also complete for the existential theory of the reals. Finally, we show that the satisfiability problems for the class of all Hilbert spaces and all finite-dimensional Hilbert spaces is undecidable.

quant-pharXiv:2602.24164•Leibniz international proceedings in informatics•Mar 2, 2026•2 citations

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

Ravishankar Ramanathan

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}).

arXiv:2402.09186•npj Quantum Information•Oct 10, 2024•2 citations

Generalized Gleason theorem and a finite amount of information about the measurement context

A. Montina, S. Wolf

Quantum processes cannot be reduced, in a nontrivial way, to classical processes without specifying the context in the description of a measurement procedure. This requirement is implied by the Kochen--Specker theorem in the outcome-deterministic case and, more generally, by the Gleason theorem. The latter establishes that there is only one noncontextual classical model compatible with quantum theory, the one that trivially identifies the quantum state with the classical state. However, this model requires a breaking of the unitary evolution to account for macroscopic realism. Thus, a causal classical model compatible with the unitary evolution of the quantum state is necessarily contextual to some extent. Inspired by well-known results in quantum communication complexity, we consider a particular class of hidden variable theories by assuming that the amount of information about the measurement context is finite. Aiming at establishing some general features of these theories, we first present a generalized version of the Gleason theorem and provide a simple proof of it. Assuming that Gleason's hypotheses hold only locally for small changes of the measurement procedure, we obtain almost the same conclusion of the original theorem about the functional form of the probability measure. An additional constant and a relaxed property of the density operator are the only two differences from the original result. By this generalization of the Gleason theorem and the assumption of finite information for the context, we prove that the probabilities over three or more outcomes of a projective measurement must be linear functions of the projectors associated with the outcomes, given the information on the context.

arXiv:2206.11830•Physical Review A•Jan 27, 2023•1 citation
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.
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.
Meyer [Phys. Rev. Lett. 83, 3751 (1999)] recently showed that the Kochen-Specker theorem, which demonstrates the impossibility of a deterministic hidden variable description of ideal spin measurements on a spin 1 particle, can be effectively nullified if only finite precision measurements are considered. We generalize this result: one can ascribe consistent outcomes to a dense subset of the set of projection valued measurements, or to a dense subset of the set of positive operator valued measurements, on any finite dimensional system. Hence no Kochen-Specker-like contradiction can rule out hidden variable theories indistinguishable from quantum theory by finite precision measurements in either class.
The Kochen-Specker no-go theorem established that hidden-variable theories in quantum mechanics necessarily admit contextuality. This theorem is formally stated in terms of the partial Boolean algebra structure of projectors on a Hilbert space. Each partial Boolean algebra provides a semantics for interpreting propositional logic. In this paper, we examine the complexity of propositional satisfiablity for various classes of partial Boolean algebras. We first show that the satisfiability problem for the class of non-trivial partial Boolean algebras is NP-complete. Next, we consider the satisfiability problem for the class of partial Boolean algebras arising from projectors on finite dimensional Hilbert spaces. For real Hilbert spaces of dimension greater 2 and any complex Hilbert spaces of dimension greater than 3, we demonstrate that the satisfiablity problem is complete for the existential theory of the reals. Interestingly, the proofs of these results make use of Kochen-Specker sets as gadgets. As a corollary, we conclude that deciding quantum homomorphism in these fixed dimensions are also complete for the existential theory of the reals. Finally, we show that the satisfiability problems for the class of all Hilbert spaces and all finite-dimensional Hilbert spaces is undecidable.
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}).
Quantum processes cannot be reduced, in a nontrivial way, to classical processes without specifying the context in the description of a measurement procedure. This requirement is implied by the Kochen--Specker theorem in the outcome-deterministic case and, more generally, by the Gleason theorem. The latter establishes that there is only one noncontextual classical model compatible with quantum theory, the one that trivially identifies the quantum state with the classical state. However, this model requires a breaking of the unitary evolution to account for macroscopic realism. Thus, a causal classical model compatible with the unitary evolution of the quantum state is necessarily contextual to some extent. Inspired by well-known results in quantum communication complexity, we consider a particular class of hidden variable theories by assuming that the amount of information about the measurement context is finite. Aiming at establishing some general features of these theories, we first present a generalized version of the Gleason theorem and provide a simple proof of it. Assuming that Gleason's hypotheses hold only locally for small changes of the measurement procedure, we obtain almost the same conclusion of the original theorem about the functional form of the probability measure. An additional constant and a relaxed property of the density operator are the only two differences from the original result. By this generalization of the Gleason theorem and the assumption of finite information for the context, we prove that the probabilities over three or more outcomes of a projective measurement must be linear functions of the projectors associated with the outcomes, given the information on the context.