Kochen-Specker sets and Hadamard matrices
Petr Lisonek
TL;DR
This paper introduces a novel class of complex Hadamard matrices and demonstrates their application in constructing an infinite family of parity proofs for the Kochen-Specker theorem, linking recent simple proofs to this new framework.
Contribution
The paper presents a new class of complex Hadamard matrices and uses them to generate an infinite family of Kochen-Specker parity proofs, unifying recent simple proofs within this framework.
Findings
New class of complex Hadamard matrices introduced
Infinite family of Kochen-Specker parity proofs constructed
Recent simple proof identified as initial member of the family
Abstract
We introduce a new class of complex Hadamard matrices which have not been studied previously. We use these matrices to construct a new infinite family of parity proofs of the Kochen-Specker theorem. We show that the recently discovered simple parity proof of the Kochen-Specker theorem is the initial member of this infinite family.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.