Kochen-Specker sets and Hadamard matrices

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.

7 pages

References in corpus (4)

• Contextuality supplies the magic for quantum computation
• Applying the simplest Kochen-Specker set for quantum information processing
• Parity proofs of the Kochen-Specker theorem based on the Lie algebra E8
• The Minimum Complexity of Kochen-Specker Sets Does Not Scale with Dimension

Cited by in corpus (4)

• The Golay codes and Quantum Contextuality
• Quantum Contextual Hypergraphs, Operators, Inequalities, and Applications in Higher Dimensions
• Generation of Kochen-Specker contextual sets in higher dimensions by dimensional upscaling whose complexity does not scale with dimension and their applications
• Kochen-Specker sets in four-dimensional spaces