On Simplest Kochen-Specker Sets

• URL: http://arxiv.org/abs/2512.10483v1
• Date: Thu, 11 Dec 2025 10:01:34 GMT
• Title: On Simplest Kochen-Specker Sets
• Abstract summary: We analyze the meaning, origin, and significance of the simplest contextual sets in any dimension.<n>We show that automatic generation of contextual sets from basic vector components automatically yields all known minimal contextual sets of any kind in any dimension.<n>In the end, we discuss varieties of contextual sets, in particular Kochen-Specker (KS), extended KS, and non-KS sets as well as ambiguities in their definitions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In Phys. Rev. Lett. 135, 190203 (2025) a discovery of the simplest 3D contextual set with 33 vertices, 50 bases, and 14 complete bases is claimed. In this paper, we show that it was previously generated in Quantum 7, 953 (2023) and analyze the meaning, origin, and significance of the simplest contextual sets in any dimension. In particular, we prove that there is no ground to consider the aforementioned set as fundamental since there are many 3D contextual sets with a smaller number of complete bases. We also show that automatic generation of contextual sets from basic vector components automatically yields all known minimal contextual sets of any kind in any dimension and therefore also the aforementioned set in no CPU-time. In the end, we discuss varieties of contextual sets, in particular Kochen-Specker (KS), extended KS, and non-KS sets as well as ambiguities in their definitions.

Related papers

• SAT + NAUTY: Orderly Generation of Small Kochen-Specker Sets Containing the Smallest State-independent Contextuality Set [9.824030987991497]
  We present a search for small Kochen-Specker (KS) sets in dimension 3.<n>We target extensions of the 13-ray Yu-Oh set, which has been proven to be the minimal witness to state-independent contextuality.
  arXiv  Detail & Related papers  (2026-04-21T19:50:20Z)
• Uniform Laws of Large Numbers in Product Spaces [60.22626971185653]
  We study uniform convergence phenomena in cartesian product spaces.<n>We show that a uniform law of large numbers holds for a family of events if and only if the linear VC dimension of the family is finite.
  arXiv  Detail & Related papers  (2026-03-25T16:36:09Z)
• Construction of Kochen-Specker Sets from Mutually Unbiased Bases [0.0]
  We show that contexts are crucial carriers of Kochen-Specker type logic and are indispensable for a rigorous assessment of quantum contextuality.<n>We generate a complete inventory of 165 rays and 130 bases from mutually unbiased bases.<n>Our findings establish that contexts are the crucial carriers of Kochen-Specker type logic and are indispensable for a rigorous assessment of quantum contextuality.
  arXiv  Detail & Related papers  (2025-09-10T14:32:24Z)
• The simplest Kochen-Specker set [0.0]
  We present a new KS set that is much more symmetrical and easier to prove than any previous example.<n>It sets a new record for minimum number of bases, 14, and enables us to refute Conjecture 2 in Phys. Rev. Lett. 134, 010201 (2025), setting a new record for qutrit-qutrit perfect strategies with a minimum number of inputs: 5-9.
  arXiv  Detail & Related papers  (2025-08-10T13:27:02Z)
• SeqAffordSplat: Scene-level Sequential Affordance Reasoning on 3D Gaussian Splatting [85.87902260102652]
  We introduce the novel task of Sequential 3D Gaussian Affordance Reasoning.<n>We then propose SeqSplatNet, an end-to-end framework that directly maps an instruction to a sequence of 3D affordance masks.<n>Our method sets a new state-of-the-art on our challenging benchmark, effectively advancing affordance reasoning from single-step interactions to complex, sequential tasks at the scene level.
  arXiv  Detail & Related papers  (2025-07-31T17:56:55Z)
• Two fundamental solutions to the rigid Kochen-Specker set problem and the solution to the minimal Kochen-Specker set problem under one assumption [0.0]
  We show that two fundamental structures of quantum theory define two rigid KS sets.<n>The second construction provides a clue to solve the minimal KS problem.<n>We conjecture that 31 is the solution to the minimal KS set problem.
  arXiv  Detail & Related papers  (2025-01-20T18:13:28Z)
• Non-Kochen-Specker Contextuality [0.0]
  We show how to generate non-Kochen-Specker hypergraphs in any dimension. Our automated generation is probabilistic and random, but the statistics of accumulated data enable one to filter out sets with the required size and structure.
  arXiv  Detail & Related papers  (2023-07-30T23:16:36Z)
• PropSegmEnt: A Large-Scale Corpus for Proposition-Level Segmentation and Entailment Recognition [63.51569687229681]
  We argue for the need to recognize the textual entailment relation of each proposition in a sentence individually. We propose PropSegmEnt, a corpus of over 45K propositions annotated by expert human raters. Our dataset structure resembles the tasks of (1) segmenting sentences within a document to the set of propositions, and (2) classifying the entailment relation of each proposition with respect to a different yet topically-aligned document.
  arXiv  Detail & Related papers  (2022-12-21T04:03:33Z)
• Automated Generation of Arbitrarily Many Kochen-Specker and Other Contextual Sets in Odd Dimensional Hilbert Spaces [0.0]
  We give three methods for automated generation of arbitrarily many contextual KS and non-KS sets in any dimension. No explicit vectors for the original Kochen-Specker set were known so far, while we now generate them from 24 vector components.
  arXiv  Detail & Related papers  (2022-02-16T17:15:45Z)
• Principal Components of the Meaning [58.720142291102135]
  We argue that (lexical) meaning in science can be represented in a 13 dimension Meaning Space. This space is constructed using principal component analysis (singular decomposition) on the matrix of word category relative information gains.
  arXiv  Detail & Related papers  (2020-09-18T14:28:32Z)
• 3D Sketch-aware Semantic Scene Completion via Semi-supervised Structure Prior [50.73148041205675]
  The goal of the Semantic Scene Completion (SSC) task is to simultaneously predict a completed 3D voxel representation of volumetric occupancy and semantic labels of objects in the scene from a single-view observation. We propose to devise a new geometry-based strategy to embed depth information with low-resolution voxel representation. Our proposed geometric embedding works better than the depth feature learning from habitual SSC frameworks.
  arXiv  Detail & Related papers  (2020-03-31T09:33:46Z)
• On Learning Sets of Symmetric Elements [63.12061960528641]
  This paper presents a principled approach to learning sets of general symmetric elements. We first characterize the space of linear layers that are equivariant both to element reordering and to the inherent symmetries of elements. We further show that networks that are composed of these layers, called Deep Sets for Symmetric Elements (DSS) layers, are universal approximators of both invariant and equivariant functions.
  arXiv  Detail & Related papers  (2020-02-20T07:29:20Z)
• Learn to Predict Sets Using Feed-Forward Neural Networks [63.91494644881925]
  This paper addresses the task of set prediction using deep feed-forward neural networks. We present a novel approach for learning to predict sets with unknown permutation and cardinality. We demonstrate the validity of our set formulations on relevant vision problems.
  arXiv  Detail & Related papers  (2020-01-30T01:52:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.