Core Concepts
The authors explore the concept of maximal non-Kochen-Specker sets and derive a lower bound for the size of any Kochen-Specker set, contributing to the understanding of contextuality in quantum protocols.
Abstract
In this paper, Williams and Constantin delve into the intricate realm of quantum mechanics by investigating Kochen-Specker (KS) sets. These finite collections of vectors on a two-sphere play a crucial role in challenging non-contextual hidden variable theories. By identifying small KS sets, the authors aim to simplify complex arguments against these theories. The study focuses on deriving a weak lower bound for the size of any KS set by examining large non-KS sets. This approach is independent of the graph structure typically associated with KS sets. Additionally, an intriguing connection is made with a generalization of the moving sofa problem within S2.
The introduction emphasizes contextuality as a fundamental property in quantum models, where measurement outcomes are influenced by contextual factors rather than solely determined by system properties. Various mathematical frameworks have been developed to study contextuality, including operational approaches and sheaf theory.
The content delves into Hidden Variables in Quantum Mechanics, emphasizing that quantum mechanics is inherently non-deterministic compared to classical mechanics. The impossibility of predicting explicit outcomes but only probabilities is discussed alongside additional conditions required for progress beyond postulated valuation maps.
The paper explores Clifton graphs as examples of 01-gadgets that illustrate contextual elements within KS sets. Propositions regarding orthogonal directions and colorings highlight key concepts essential for understanding contextuality.
Furthermore, the study introduces Non-KS Sets as measurable subsets that avoid specific valuation map criteria typical in KS sets. Definitions and problems related to finding maximal non-KS sets are outlined along with propositions supporting antipodal symmetry requirements.
A detailed construction process for large non-KS sets is presented, showcasing how these sets can cover significant portions of the two-sphere area while avoiding contextual elements present in KS sets.
Lastly, connections between maximal non-KS sets and minimal KS sets are explored through propositions establishing lower bounds based on set avoidance principles.
Stats
A weak lower bound of 10 vectors for any KS set.
Peres found a set with 33 directions.
Conway discovered the smallest set consisting of 31 directions.
Uijlen and Westerbaan established a lower bound of 22 directions.
Maximal measure for Nmax: approximately 0.8978.
Lower bound for sofa constant: approximately 0.8978.
Minimal number of points avoided by subset U: n ≥ 1/(1 - |U|).
Lower bound for minimal number of directions in KS set: at least 10 directions.
Quotes
"The existence of Kochen-Specker (KS) sets lies at the heart of challenging non-contextual hidden variable theories."
"Identifying small KS sets can simplify complex arguments against these theories."
"A weak lower bound has been derived for the size of any Kochen-Specker (KS) set."