Automated search for highly contextual Kochen-Specker proofs

arXiv:2609.19862 · quant-ph · Submitted 2026-09-17 · Read on arXiv

quant-ph

Submitted: 2026-09-17

Updated: 2026-09-17

Terminology

• Hypergraph — 22× in this paper · explained in 2 episodes
• Robustness — 2× in this paper · explained in 5 episodes
• Generative AI — 1× in this paper · explained in 2 episodes
• Hamming Distance — 1× in this paper · explained in 2 episodes
• Pruning — 1× in this paper · explained in 4 episodes
• Verifier — 1× in this paper · explained in 2 episodes

Sources

• Full classification of Pauli Lie algebras
• Extending and Characterizing Quantum Magic Games
• Empirical Demonstration of Quantum Contextuality on NISQ Computers
• Irreducible magic sets for $n$-qubit systems

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity