Generalized parity proofs of the Kochen-Specker theorem
arXiv:1401.3035
Abstract
We discuss two approaches to producing generalized parity proofs of the Kochen-Specker theorem. Such proofs use contexts of observables whose product is or ; 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.
arXiv comment21 pages
References in corpus (7)
- Hidden Variables and the Two Theorems of John Bell
- Negative Quasi-Probability as a Resource for Quantum Computation
- Computational power of correlations
- Kochen-Specker theorem for von Neumann algebras
- Hybrid ququart-encoded quantum cryptography protected by Kochen-Specker contextuality
- Proofs of the Kochen-Specker theorem based on a system of three qubits
- Proofs of the Kochen-Specker theorem based on the N-qubit Pauli group