Generalized parity proofs of the Kochen-Specker theorem

2014/01/13 by Petr Lisoněk, Petr Lisonek, Robert Raussendorf +4 · 1 citation
Chemistry · Physics and Astronomy · #FOS: Physical sciences #History and advancements in chemistry #Molecular spectroscopy and chirality #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.1401.3035

21 pages

arxiv created 2014/01/13 · openalex publication_date 2014/01/13 · arxiv updated 2014/01/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We discuss two approaches to producing generalized parity proofs of the Kochen-Specker theorem. Such proofs use contexts of observables whose product is I or -I; we call them constraints. In the first approach, one starts with a fixed set of constraints and methods of linear algebra are used to produce subsets that are generalized parity proofs. Coding theory methods are used for enumeration of the proofs by size. In the second approach, one starts with the combinatorial structure of the set of constraints and one looks for ways to suitably populate this structure with observables. As well, we are able to show that many combinatorial structures can not produce parity proofs.

Citations

• Modern Quantum Mechanics
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• On the Problem of Hidden Variables in Quantum Mechanics
• Hidden variables and the two theorems of John Bell

Cited by

• Triacontagonal proofs of the Bell-Kochen-Specker theorem

Related

• Generating the Kochen-Specker Sets with 36, 38 and 40 Rays in Three-qubit System: Three Simple Algorithms
• Parity Polytopes and Binarization
• The simplest Kochen-Specker set
• Kochen-Specker theorem revisited
• Triacontagonal proofs of the Bell-Kochen-Specker theorem