Metraipolis › archive › dc_f4f8ebb5136c
Automated search for highly contextual Kochen-Specker proofs — arXiv:2609.19862
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19862
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T05:50:39.393Z
- SHA-256 of the archived text
d92f48026406206fefdf0ba89685c3089b01c733c4d7339e2f4fcfa99c3b574b- Stable URL of this page
https://metraipolis.com/documento/dc_f4f8ebb5136c
How to cite
Automated search for highly contextual Kochen-Specker proofs — arXiv:2609.19862 — arXiv (en), https://arxiv.org/abs/2609.19862 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f4f8ebb5136c (Metraipolis archive dc_f4f8ebb5136c, sha256 d92f48026406206fefdf0ba89685c3089b01c733c4d7339e2f4fcfa99c3b574b)
BibTeX
@misc{dcf4f8ebb5136c,
title = {Automated search for highly contextual Kochen-Specker proofs — arXiv:2609.19862},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19862},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f4f8ebb5136c; sha256 d92f48026406206fefdf0ba89685c3089b01c733c4d7339e2f4fcfa99c3b574b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19862. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 $\varepsilon = 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 $\varepsilon = 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. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-18 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.19862 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-10T05:18:18.900Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).