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

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

2011-11-14

arxiv.org/abs/1111.3301v1

Physics

Quantum Physics

16 pages. Extended version of "On Searching for Small Kochen-Specker Vector Systems" published in WG 2011

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Searching for Small Kochen-Specker Vector Systems (extended version) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Searching for Small Kochen-Specker Vector Systems (extended version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Searching for Small Kochen-Specker Vector Systems (extended version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-219053