Automated search for highly contextual Kochen-Specker proofs
Abstract
Observable-based Kochen-Specker proofs are configurations of multi-qubit Pauli observables grouped into contexts whose products are plus or minus the indentity. Their robustness as state-independent contextuality tests can be measured by the tolerated error per context ε = 2d/|H|, where d is the contextuality degree and |H| the number of contexts. Since the degree depends only on an underlying abstract structure called the hypergram i.e. the pair formed by the context hypergraph and the anticommutation graph, the search for highly contextual proofs can be carried out on them instead, with no reference to qubits or to any particular Pauli labeling. We further exploit this by enumerating anticommutation graphs first, and then by associating to each graph G the single hypergram carrying its entire hypergraph support HS(G), so that exactly one candidate is examined per graph. Applied to the House of Graphs database and to censuses of vertex-transitive graphs on at most 24 vertices, this pipeline recovers the Peres-Mermin square, the doily and the Mermin pentagram, and yields configurations reaching ε = 0.707, against 0.424 for the previous published record. The best configurations are predominantly those stemming from line graphs and unions of graphs; we explain the former by showing that every perfect matching of a graph is a context of its line graph, which exhibits the Peres-Mermin square and the doily as the first members of two infinite families. We close with finite geometric descriptions of the most striking configurations inside symplectic polar spaces, in terms of ovoids, hyperbolic quadrics and Fano planes.
Related
- Frame dependence of Kochen-Specker contextuality for relativistic spin systems
- Automated Physics-Informed Neural-Networks-Based Calibration of Highly Segmented Silicon Telescopes
- Contextual Cellular Growth (ConCeG) of neural cells for realistic grey matter tissue generation for diffusion MRI simulations
- Complete Detector Records and Contextual Source Laws in a Retrocausal Spin Model
- Sparse Contextual Coupling Reshapes Diffusion Geometry in Multilayer Hypergraphs
BibTeX
@misc{muller2026automated,
title = {{Automated search for highly contextual Kochen-Specker proofs}},
author = {Axel Muller and Metod Saniga},
howpublished = {HAL},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.19862},
eprint = {2609.19862},
archivePrefix = {arXiv},
url = {https://hal.science/hal-05769255v1},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Automated search for highly contextual Kochen-Specker proofs
AU - Axel Muller
AU - Metod Saniga
PY - 2026
DA - 2026/09/17
PB - HAL
DO - 10.48550/arxiv.2609.19862
UR - https://hal.science/hal-05769255v1
AB - Observable-based Kochen-Specker proofs are configurations of multi-qubit Pauli observables grouped into contexts whose products are plus or minus the indentity. Their robustness as state-independent contextuality tests can be measured by the tolerated error per context ε = 2d/|H|, where d is the contextuality degree and |H| the number of contexts. Since the degree depends only on an underlying abstract structure called the hypergram i.e. the pair formed by the context hypergraph and the anticommutation graph, the search for highly contextual proofs can be carried out on them instead, with no reference to qubits or to any particular Pauli labeling. We further exploit this by enumerating anticommutation graphs first, and then by associating to each graph G the single hypergram carrying its entire hypergraph support HS(G), so that exactly one candidate is examined per graph. Applied to the House of Graphs database and to censuses of vertex-transitive graphs on at most 24 vertices, this pipeline recovers the Peres-Mermin square, the doily and the Mermin pentagram, and yields configurations reaching ε = 0.707, against 0.424 for the previous published record. The best configurations are predominantly those stemming from line graphs and unions of graphs; we explain the former by showing that every perfect matching of a graph is a context of its line graph, which exhibits the Peres-Mermin square and the doily as the first members of two infinite families. We close with finite geometric descriptions of the most striking configurations inside symplectic polar spaces, in terms of ovoids, hyperbolic quadrics and Fano planes.
ER -