Maximal Non-Kochen-Specker Sets and a Lower Bound on the Size of Kochen-Specker Sets
arXiv:2403.05230 · doi:10.1103/PhysRevA.111.012223
Abstract
The challenge of determining bounds for the minimal number of vectors in a three-dimensional Kochen-Specker (KS) set has captivated the quantum foundations community for decades. This paper establishes a weak lower bound of 10 vectors, which does not surpass the current best-known bound of 24 vectors. By exploring the complementary concept of large non-KS sets and employing a probability argument independent of the graph structure of KS sets, we introduce a novel technique that could be applied in the future to derive tighter bounds. Additionally, we highlight an intriguing connection to a generalisation of the moving sofa problem in navigating a right-angled hallway on the surface of a two-dimensional sphere.
arXiv comment8 pages, 7 figures; v2: published version
References in corpus (19)
- Contextuality for preparations, transformations, and unsharp measurements
- Contextuality supplies the magic for quantum computation
- The Sheaf-Theoretic Structure Of Non-Locality and Contextuality
- The Free Will Theorem
- Bell-Kochen-Specker theorem: A proof with 18 vectors
- Graph-Theoretic Approach to Quantum Correlations
- Contextuality in Measurement-based Quantum Computation
- State-independent proof of Kochen-Specker theorem with 13 rays
- A Combinatorial Approach to Nonlocality and Contextuality
- Finite precision measurement nullifies the Kochen-Specker theorem
- The contextual fraction as a measure of contextuality
- Improving zero-error classical communication with entanglement
- Kochen-Specker Vectors
- A Kochen-Specker inequality from a SIC
- Proof of the Peres conjecture for contextuality
- Gadget structures in proofs of the Kochen-Specker theorem
- Equivalence between face nonsignaling correlations, full nonlocality, all-versus-nothing proofs, and pseudotelepathy
- Simplest bipartite perfect quantum strategies
- Improved upper bounds in the moving sofa problem