Emergence and Recovery of (logical) Kochen-Specker Contextuality via Hamilton Extension

Technical Summary: Emergence and Recovery of (Logical) Kochen–Specker Contextuality via Hamilton Extension

Problem Statement
The Kochen–Specker (KS) theorem demonstrates that quantum systems of dimension $d \geq 3$ cannot be described by deterministic noncontextual hidden-variable models. Traditionally, KS proofs rely on pre-constructed sets of vectors (KS sets) where orthogonality relations inherently encode a logical contradiction (i.e., the set is "KS-uncolorable"). A fundamental open question addressed in this work is whether logical KS contextuality can be engineered rather than merely revealed. Specifically, can one start with a KS-colorable (non-contextual) configuration and, through systematic modifications of its measurement compatibility structure, generate a logical KS contradiction? Furthermore, can contextuality lost through specific graph-theoretic operations, such as "apex-vertex augmentation" (which renders a KS graph colorable), be recovered?

Methodology: The Hamilton Extension
The authors introduce a constructive framework termed the Hamilton extension, defined for vector sets in four-dimensional real space ($\mathbb{R}^4$). This method is inspired by Hamilton's quaternion algebra.

1. Definition: For a real vector $\vec{v} = (a, b, c, d) \in \mathbb{R}^4$, the Hamilton extension $H[\vec{v}]$ is defined as a set of four mutually orthogonal rays (a measurement context):
   $$H[\vec{v}] = \{ \vec{v}_0, \vec{v}_1, \vec{v}_2, \vec{v}_3 \}$$
   where $\vec{v}_0 = (a, b, c, d)$ and the subsequent vectors are generated via specific linear transformations corresponding to multiplication by quaternion units $e_1, e_2, e_3$.
2. Set Extension: For a finite parent set $V = \{\vec{v}_i\}_{i=1}^n \subset \mathbb{R}^4$, the extension is the union of the extensions of its elements: $H[V] = \bigcup_{i=1}^n H[\vec{v}_i]$.
3. Emergent Contexts: Crucially, the extension induces new measurement contexts beyond the "Hamilton contexts" (the sets $H[\vec{v}_i]$ themselves). These emergent contexts arise from orthogonality relations between vectors belonging to different parent extensions. They are classified into two types:
   • Type (2-2): Two vectors from one parent extension and two from another.
   • Type (1-1-1-1): One vector from each of four distinct parent extensions.

The authors analyze the resulting orthogonality graphs to determine if a valid KS coloring (an assignment of 0s and 1s satisfying exclusivity and completeness constraints) exists.

Key Contributions and Results

1. Emergence of Logical Contextuality:
   The paper demonstrates that the Hamilton extension can transform a KS-colorable parent set into a logically KS-uncolorable configuration.

   • Theorem 1: The Hamilton extension of the graph $YO_{14}$ (derived from the Yu-Oh 13-ray set plus an apex vertex) exhibits logical KS contextuality. While $YO_{14}$ is KS-colorable, its extension $H[YO_{14}]$ is not. This results in a new 32-vector logical KS set in $\mathbb{R}^4$.
   • Generalization: This result extends to complex vector sets in $\mathbb{C}^4$ containing specific real subsets, establishing a hereditary property of non-colorability.

2. Recovery of Lost Contextuality:
   The authors show that the Hamilton extension recovers logical contextuality destroyed by apex-vertex augmentation.

   • Corollary 2: If a KS graph $G$ is augmented with an apex vertex (making it $G+1$, which is always KS-colorable), the Hamilton extension of the embedded vector set $E(G+1)$ restores the logical KS contradiction. This is proven for well-known constructions such as Peres-24 ($P_{33}$), Conway-Kochen ($CK_{31}$), and Bub ($B_{33}$).

3. Sharp Threshold for Parent Set Cardinality:
   The paper establishes a precise lower bound on the size of the parent set required to generate logical KS contextuality via this mechanism.

   • Theorem 3: The Hamilton extension of every five-vector parent set in $\mathbb{R}^4$ remains KS-colorable.
   • Theorem 2: There exist six-vector parent sets whose Hamilton extensions generate logical KS contextuality. Specifically, a suitably chosen six-vector set yields the Peres-24 construction (a known 24-vector KS set).
   • New Construction: The authors present a new 24-vector KS set (H[V'_6}) derived from a different six-vector parent set, which is structurally distinct from the Peres-24 set.

4. Structural Properties:

   • The Hamilton extension is idempotent ($H[H[V]] = H[V]$).
   • The Peres-24 set is a fixed point under this extension ($H[P_{24}] = P_{24}$).
   • The six-vector parent sets identified are irreducible; removing any vector results in a five-vector set whose extension is colorable.

Significance and Claims
The paper claims to identify a new structural mechanism for the emergence and recovery of logical KS contextuality. By shifting the focus from the final configuration to the generative transformation, the authors propose that contextuality can be an emergent property of systematically modified compatibility structures.

The work provides a systematic framework for constructing compact KS sets, identifying six as the minimum parent-set cardinality capable of generating logical KS contradictions through this specific mechanism. This offers a new organizing principle for classifying KS sets based on the complexity of the underlying parent configuration and the transformation applied, rather than solely on the size of the final set. The results have implications for graph-theoretic approaches to nonclassicality and may offer new building blocks for contextuality-based quantum information protocols, such as self-testing and randomness certification, by providing systematically generated, structurally controlled contextual configurations.