Abstract
Kochen-Specker (KS) vector systems are sets of vectors in ℝ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.
This work is based on the first author’s Master’s thesis[1]; an extended version of this paper is also available as[2].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arends, F.: A lower bound on the size of the smallest Kochen-Specker vector system. Master’s thesis. Oxford University (2009), www.cs.ox.ac.uk/people/joel.ouaknine/download/arends09.pdf
Arends, F., Ouaknine, J., Wampler, C.W.: On searching for small Kochen-Specker vector systems (extended version). Technical report (2011), www.cs.ox.ac.uk/people/joel.ouaknine/publications/ks11abs.html
Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proc. STOC. ACM (1983)
Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Heidelberg (2006)
Beineke, L.W., Wilson, R.J. (eds.): Topics in Topological Graph Theory. Encyclopedia of Mathematics and its Applications. Cambridge University Press (2009)
Bub, J.: Schütte’s tautology and the Kochen-Specker theorem. Found. Phys. 26, 787–806 (1996)
Canny, J.: Some algebraic and geometric computations in PSPACE. In: Proc. STOC. ACM (1988)
Colbourn, C.J., Read, R.C.: Orderly algorithms for graph generation. Int. J. Comput. Math. 7, 167–172 (1979)
Conway, J.H., Kochen, S.: The free will theorem. Found. Phys. 36(10), 1441–1473 (2006)
Conway, J.H., Kochen, S.: The strong free will theorem. Notices of the AMS 56(2) (2009)
Huang, Y.-F., Li, C.-F., Zhang, Y.-S., Pan, J.-W., Guo, G.-C.: Experimental test of the Kochen-Specker theorem with single photons. Phys. Rev. Lett. 90(250401) (2003)
Kochen, S., Specker, E.P.: The problem of hidden variables in quantum mechanics. J. Math. Mech. 17, 235–263 (1967)
Larsson, J.-Å.: A Kochen-Specker inequality. Europhys. Lett. 58, 799–805 (2002)
McKay, B.D.: Isomorph-free exhaustive generation. J. Alg. 26, 306–324 (1998)
Pavičić, M., Merlet, J.-P., McKay, B., Megill, N.D.: Kochen-Specker vectors. J. Phys. A: Math. Gen. 38(7), 1577–1592 (2005)
Pavičić, M., Merlet, J.-P., Megill, N.D.: Exhaustive enumeration of Kochen-Specker vector systems. Research report RR-5388, INRIA (2004)
Peres, A.: Two simple proofs of the Kochen-Specker theorem. J. Phys. A: Math. Gen. 24, L175–L178 (1991)
Peres, A.: Quantum Theory: Concepts and Methods. Kluwer (1993)
Read, R.C.: Every one a winner, or: How to avoid isomorphism search when cataloguing combinatorial configurations. Annals Discrete Math. 2, 107–120 (1978)
Read, R.C.: A survey of graph generation techniques. Lecture Notes in Mathematics, vol. 884. Springer, Heidelberg (1981)
Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. Parts I-III. J. Symb. Comput. 13(3), 255–352 (1992)
Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences (2010), http://www.research.att.com/~njas/sequences/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arends, F., Ouaknine, J., Wampler, C.W. (2011). On Searching for Small Kochen-Specker Vector Systems. In: Kolman, P., Kratochvíl, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 2011. Lecture Notes in Computer Science, vol 6986. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25870-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-25870-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25869-5
Online ISBN: 978-3-642-25870-1
eBook Packages: Computer ScienceComputer Science (R0)