On Simplest Kochen-Specker Sets
By: Mladen Pavicic
Potential Business Impact:
Finds simpler math patterns for quantum computers.
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.
Similar Papers
Complexity of Contextuality
Quantum Physics
Shows how quantum computers are harder to understand.
Two bases suffice for QMA1-completeness
Quantum Physics
Makes quantum computers solve harder puzzles.
Quartic quantum speedups for community detection
Quantum Physics
Finds hidden groups in complex data faster.