Kochen-Specker sets in four-dimensional spaces
arXiv:1905.09443
Abstract
For the first time we construct an infinite family of Kochen-Specker sets in a space of fixed dimension, namely in R^4. While most of the previous constructions of Kochen-Specker sets have been based on computer search, our construction is analytical and it comes with a short, computer-free proof.
14 pages. This version significantly extends the paper by adding two new sections, which contain further information on the new KS set construction and links with previously found KS set examples, as well as a numerical example for our new construction
References in corpus (5)
- Contextuality supplies the magic for quantum computation
- Applying the simplest Kochen-Specker set for quantum information processing
- Arbitrarily exhaustive hypergraph generation of 4-, 6-, 8-, 16-, and 32-dimensional quantum contextual sets
- The Minimum Complexity of Kochen-Specker Sets Does Not Scale with Dimension
- Kochen-Specker sets and Hadamard matrices