A Kochen-Specker system has at least 22 vectors
From MaRDI portal
Publication:1670503
DOI10.1007/S00354-016-0202-5zbMATH Open1396.81015arXiv1412.8544OpenAlexW2314918822MaRDI QIDQ1670503FDOQ1670503
Authors: Sander Uijlen, Bas Westerbaan 
Publication date: 5 September 2018
Published in: New Generation Computing (Search for Journal in Brave)
Abstract: At the heart of the Conway-Kochen Free Will theorem and Kochen and Specker's argument against non-contextual hidden variable theories is the existence of a Kochen-Specker (KS) system: a set of points on the sphere that has no 0,1-coloring such that at most one of two orthogonal points are colored 1 and of three pairwise orthogonal points exactly one is colored 1. In public lectures, Conway encouraged the search for small KS systems. At the time of writing, the smallest known KS system has 31 vectors. Arends, Ouaknine and Wampler have shown that a KS system has at least 18 vectors, by reducing the problem to the existence of graphs with a topological embeddability and non-colorability property. The bottleneck in their search proved to be the sheer number of graphs on more than 17 vertices and deciding embeddability. Continuing their effort, we prove a restriction on the class of graphs we need to consider and develop a more practical decision procedure for embeddability to improve the lower bound to 22.
Full work available at URL: https://arxiv.org/abs/1412.8544
Recommendations
- A Kochen-Specker system has at least 22 vectors (extended abstract)
- Kochen–Specker vectors
- On searching for small Kochen-Specker vector systems
- Bell-Kochen-Specker theorem: a proof with \(18\) vectors.
- Parity proofs of the Kochen-Specker theorem based on the 24 rays of Peres
- scientific article; zbMATH DE number 5589487
- Kochen-Specker sets and Hadamard matrices
- Kochen-Specker theorem for a three-qubit system: a state-dependent proof with seventeen rays
- Kochen-Specker theorem in Krein space
- Two simple proofs of the Kochen-Specker theorem
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum theory: concepts and methods
- Two simple proofs of the Kochen-Specker theorem
- Isomorph-Free Exhaustive Generation
- KOCHEN–SPECKER THEOREM AND EXPERIMENTAL TEST ON HIDDEN VARIABLES
- Kochen–Specker vectors
- Title not available (Why is that?)
- A Kochen-Specker system has at least 22 vectors
- On searching for small Kochen-Specker vector systems
Cited In (6)
- A Kochen-Specker theorem for integer matrices and noncommutative spectrum functors
- On maps which preserve semipositivity and quantifier elimination theory for real numbers
- HOW MANY QUESTIONS DO YOU NEED TO PROVE THAT UNASKED QUESTIONS HAVE NO ANSWERS?
- A Kochen-Specker system has at least 22 vectors
- On searching for small Kochen-Specker vector systems
- A Kochen-Specker system has at least 22 vectors (extended abstract)
Uses Software
This page was built for publication: A Kochen-Specker system has at least 22 vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1670503)
