Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1008.4453 · AIP conference proceedings

How orthogonalities set Kochen-Specker sets

Kate Blanchfield

Published Jan 1, 2011• 1 citation
arXivHTMLPDF

Abstract

We look at generalisations of sets of vectors proving the Kochen-Specker theorem in 3 and 4 dimensions. It has been shown that two such sets, although unitarily inequivalent, are part of a larger 3-parameter family of vectors that share the same orthogonality graph. We find that these sets are unusual, in that the vectors in all other Kochen-Specker sets investigated here are fully determined by orthogonality conditions and thus admit no free parameters.

DOI
10.1063/1.3567454

Related papers

How orthogonalities set Kochen-Specker sets

Kate Blanchfield, Andrei Yu. Khrennikov, Gregg S. Jaeger +2 more

We look at generalisations of sets of vectors proving the Kochen‐Specker theorem in 3 and 4 dimensions. It has been shown that two such sets, although not unitarily equivalent, are part of a larger 3‐parameter family of vectors that share the same orthogonality graph. We find that these sets are unusual, in that the vectors in all other Kochen‐Specker sets investigated here are fully determined by orthogonality conditions and thus admit no free parameters.

AIP conference proceedings•Jan 1, 2011•2 citations

Proofs of the Kochen-Specker Theorem in 3 Dimensions

Elizabeth Gould

This project examines two sets of rays in three dimensions that prove the Bell-Kochen-Specker theorem, the 33 rays of Peres and the 33 rays of Penrose. It is shown that these rays possess identical orthogonality tables and thus lead to identical proofs of the theorem. It is also shown that these sets of rays are particular members of a three parameter family of 33 rays that prove the theorem.

•May 15, 2009•0 citations

Kochen–Specker vectors

Mladen Pavičić, Jean‐Pierre Merlet, Brendan McKay +1 more

We give a constructive and exhaustive definition of Kochen–Specker (KS) vectors in a Hilbert space of any dimension as well as of all the remaining vectors of the space. KS vectors are elements of any set of orthonormal states, i.e., vectors in an n -dimensional Hilbert space, , to which it is impossible to assign 1s and 0s in such a way that no two mutually orthogonal vectors from the set are both assigned 1 and that not all mutually orthogonal vectors are assigned 0. Our constructive definition of such KS vectors is based on algorithms that generate MMP diagrams corresponding to blocks of orthogonal vectors in , on algorithms that single out those diagrams on which algebraic 0 – 1 states cannot be defined, and on algorithms that solve nonlinear equations describing the orthogonalities of the vectors by means of statistically polynomially complex interval analysis and self-teaching programs. The algorithms are limited neither by the number of dimensions nor by the number of vectors. To demonstrate the power of the algorithms, all four-dimensional KS vector systems containing up to 24 vectors were generated and described, all three-dimensional vector systems containing up to 30 vectors were scanned, and several general properties of KS vectors were found.

arXiv:quant-ph/0409014•Journal of Physics A Mathematical and General•Feb 3, 2005•79 citations

Generalised Kochen–Specker Theorem in Three Dimensions

Václav Voràček, Mirko Navara

Abstract We show that there is no non-constant assignment of zeros and ones to points of a unit sphere in $$\mathbb{R}^3$$ R 3 such that for every three pairwisely orthogonal vectors, an odd number of them is assigned 1. This is a new strengthening of the Bell–Kochen–Specker theorem, which proves the non-existence of hidden variables in quantum theories.

Foundations of Physics•Jun 1, 2021•5 citations

On Searching for Small Kochen-Specker Vector Systems (extended version)

Felix Arends, Joël Ouaknine, Charles W. Wampler

Kochen-Specker (KS) vector systems are sets of vectors in R^3 with the property that it is impossible to assign 0s and 1s to the vectors in such a way that no two orthogonal vectors are assigned 0 and no three mutually orthogonal vectors are assigned 1. The existence of such sets forms the basis of the Kochen-Specker and Free Will theorems. Currently, the smallest known KS vector system contains 31 vectors. In this paper, we establish a lower bound of 18 on the size of any KS vector system. This requires us to consider a mix of graph-theoretic and topological embedding problems, which we investigate both from theoretical and practical angles. We propose several algorithms to tackle these problems and report on extensive experiments. At the time of writing, a large gap remains between the best lower and upper bounds for the minimum size of KS vector systems.

arXiv:1111.3301•Nov 14, 2011•2 citations

A Kochen-Specker system has at least 22 vectors (extended abstract)

Sander Uijlen, Bas Westerbaan

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.

arXiv:1412.8544•Electronic Proceedings in Theoretical Computer Science•Dec 27, 2014•3 citations
We look at generalisations of sets of vectors proving the Kochen-Specker theorem in 3 and 4 dimensions. It has been shown that two such sets, although unitarily inequivalent, are part of a larger 3-parameter family of vectors that share the same orthogonality graph. We find that these sets are unusual, in that the vectors in all other Kochen-Specker sets investigated here are fully determined by orthogonality conditions and thus admit no free parameters.
We give a constructive and exhaustive definition of Kochen–Specker (KS) vectors in a Hilbert space of any dimension as well as of all the remaining vectors of the space. KS vectors are elements of any set of orthonormal states, i.e., vectors in an n -dimensional Hilbert space, , to which it is impossible to assign 1s and 0s in such a way that no two mutually orthogonal vectors from the set are both assigned 1 and that not all mutually orthogonal vectors are assigned 0. Our constructive definition of such KS vectors is based on algorithms that generate MMP diagrams corresponding to blocks of orthogonal vectors in , on algorithms that single out those diagrams on which algebraic 0 – 1 states cannot be defined, and on algorithms that solve nonlinear equations describing the orthogonalities of the vectors by means of statistically polynomially complex interval analysis and self-teaching programs. The algorithms are limited neither by the number of dimensions nor by the number of vectors. To demonstrate the power of the algorithms, all four-dimensional KS vector systems containing up to 24 vectors were generated and described, all three-dimensional vector systems containing up to 30 vectors were scanned, and several general properties of KS vectors were found.
Abstract We show that there is no non-constant assignment of zeros and ones to points of a unit sphere in R3\mathbb{R}^3R3 R 3 such that for every three pairwisely orthogonal vectors, an odd number of them is assigned 1. This is a new strengthening of the Bell–Kochen–Specker theorem, which proves the non-existence of hidden variables in quantum theories.
Kochen-Specker (KS) vector systems are sets of vectors in R^3 with the property that it is impossible to assign 0s and 1s to the vectors in such a way that no two orthogonal vectors are assigned 0 and no three mutually orthogonal vectors are assigned 1. The existence of such sets forms the basis of the Kochen-Specker and Free Will theorems. Currently, the smallest known KS vector system contains 31 vectors. In this paper, we establish a lower bound of 18 on the size of any KS vector system. This requires us to consider a mix of graph-theoretic and topological embedding problems, which we investigate both from theoretical and practical angles. We propose several algorithms to tackle these problems and report on extensive experiments. At the time of writing, a large gap remains between the best lower and upper bounds for the minimum size of KS vector systems.
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.