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:0906.2696 · Journal of Physics A Mathematical and Theoretical

Exceptional and non-crystallographic root systems and the Kochen–Specker theorem

Artur E Ruuge

Published Feb 28, 2007• 7 citations
arXivHTMLPDF

Abstract

The Kochen-Specker theorem states that a 3-dimensional complex Euclidean space admits a finite configuration of projective lines such that the corresponding quantum observables (the orthogonal projectors) cannot be assigned with 0 and 1 values in a classically consistent way. This paper shows that the irreducible root systems of exceptional and of non-crystallographic types are useful in constructing such configurations in other dimensions. The cases $E_6$ and $E_7$ lead to new examples, while $F_4$, $E_8$, and $H_4$, yield a new interpretation of the known ones. The described configurations have an additional property: they are saturated, i.e. the tuples of mutually orthogonal lines, being partially ordered by inclusion, yield a poset with all maximal elements having the same cardinality (the dimension of space).

DOI
10.1088/1751-8113/40/11/019

Related papers

EXCEPTIONAL AND NON-CRYSTALLOGRAPHIC ROOT SYSTEMS AND THE KOCHEN-SPECKER THEOREM

Artur E. Ruuge

Abstract. The Kochen-Specker theorem states that a 3-dimensional complex Euclidean space admits a finite configuration of projective lines such that the corresponding quantum observables (the orthogonal projectors) cannot be assigned with 0 and 1 values in a classically consistent way. This paper shows that the irreducible root systems of exceptional and of non-crystallographic types are useful in constructing such configurations in other dimensions. The cases E6 and E7 lead to new examples, while F4, E8, and H4, yield a new interpretation of the known ones. The described configurations have an additional property: they are saturated, i.e. the tuples of mutually orthogonal lines, being partially ordered by inclusion, yield a poset with all maximal elements having the same cardinality (the dimension of space). 1.

•Nov 27, 2012•5 citations

Kochen-Specker Configurations from Grids on Dual Quadrics

Giuseppe Favacchio

We develop a geometric framework for constructing and organizing Kochen--Specker configurations in real four-dimensional space. The construction uses finite grids on pairs of smooth quadrics related by Euclidean polarity. Their incidence geometry directly produces orthogonal measurement contexts and parity proofs of quantum contextuality, yielding infinite families of configurations and a geometric interpretation and extension of a previously known cyclic construction. For a distinguished subfamily, the same geometry admits a canonical completion determined by secant lines. The first two instances of this completion recover the exceptional root configurations of types $F_4$ and $H_4$, while the smallest case also recovers the Cabello configuration and its embedding in the Peres configuration. Thus several prominent four-dimensional contextual configurations, previously obtained from different constructions, arise from a single projective-geometric mechanism.

math.AGCross-listedarXiv:2608.25008•Aug 27, 2026•0 citations

Saturated Kochen–Specker-type configuration of 120 projective lines in eight-dimensional space and its group of symmetry

Artur E. Ruuge, Freddy Van Oystaeyen

There exists an example of a set of 40 projective lines in eight-dimensional Hilbert space producing a Kochen–Specker-type contradiction. This set corresponds to a known no-hidden variables argument due to Mermin. In the present paper it is proved that this set admits a finite saturation, i.e., an extension up to a finite set with the following property: every subset of pairwise orthogonal projective lines has a completion, i.e., is contained in at least one subset of eight pairwise orthogonal projective lines. An explicit description of such an extension consisting of 120 projective lines is given. The idea to saturate the set of projective lines related to Mermin’s example together with the possibility to have a finite saturation allow to find the corresponding group of symmetry. This group is described explicitely and is shown to be generated by reflections. The natural action of the mentioned group on the set of all subsets of pairwise orthogonal projective lines of the mentioned extension is investigated. In particular, the restriction of this action to complete subsets is shown to have only four orbits, which have a natural characterization in terms of the construction of the saturation.

Journal of Mathematical Physics•Apr 27, 2005•14 citations

How orthogonalities set Kochen-Specker sets

Kate Blanchfield

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 orthog-onality conditions and thus admit no free parameters. The Kochen-Specker (KS) theorem [1] is a statement about the fundamen-tal nature of quantum mechanics: no non-contextual hidden variable theory can reliably reproduce quantum mechanical predictions. The KS theorem states that in a Hilbert space with dimension n ≥ 3 it is impossible to assign definite values v ∈ {0, 1} to m projection operators Pm so that for every commuting set of projection operators satisfying Pm = I, the correspond-ing definite values obey v (Pm) = 1. The KS theorem is often visualised by means of a set of "uncolourable" vectors, where projection operators are represented by their constituent rays in Hilbert space and rays can be simplified to vectors as only directions are relevant here. The vectors are coloured according to their pre-assigned val-ues and the summation conditions above translate into colouring rules. This allows us to construct orthogonality graphs that, when uncolourable, pro-vide a contradiction within non-contextual hidden variable models and thus a proof of the KS theorem. Sets of vectors exemplifying the KS theorem have been discovered by nu-merous authors, with an aim to reduce the number of vectors required to reach a contradiction. Most notably, in a 3-dimensional Hilbert space, the original KS proof of 117 vectors has been replicated with sets using between 31 and 33 vectors [2, 3, 4, 5] and in a 4-dimensional Hilbert space, sets of between 24 and the lower limit of 18 vectors have been realised [2, 6, 7]. Additionally, an extensive computer search has recently revealed over one thousand of such KS sets in R4 [8]. In a publication by E. Gould and P. K. Aravind [10], two of these sets in 3 dimensions have been shown to share the same orthogonality graph. Specifically, the sets of 33 vectors found by Penrose [3] and Peres [2] have

•Aug 14, 2016•1 citation

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•75 citations

Kochen-Specker vectors

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

Abstract. 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 n-dim Hilbert space, H n, n ≥ 3 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 R n, 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 4-dim KS vector systems containing up to 24 vectors were generated and described, all 3-dim vector systems containing up to 30 vectors were scanned, and several general properties of KS vectors were found.

•Jan 1, 2005•51 citations
The Kochen-Specker theorem states that a 3-dimensional complex Euclidean space admits a finite configuration of projective lines such that the corresponding quantum observables (the orthogonal projectors) cannot be assigned with 0 and 1 values in a classically consistent way. This paper shows that the irreducible root systems of exceptional and of non-crystallographic types are useful in constructing such configurations in other dimensions. The cases E6E_6E6​ and E7E_7E7​ lead to new examples, while F4F_4F4​, E8E_8E8​, and H4H_4H4​, yield a new interpretation of the known ones. The described configurations have an additional property: they are saturated, i.e. the tuples of mutually orthogonal lines, being partially ordered by inclusion, yield a poset with all maximal elements having the same cardinality (the dimension of space).
Abstract. The Kochen-Specker theorem states that a 3-dimensional complex Euclidean space admits a finite configuration of projective lines such that the corresponding quantum observables (the orthogonal projectors) cannot be assigned with 0 and 1 values in a classically consistent way. This paper shows that the irreducible root systems of exceptional and of non-crystallographic types are useful in constructing such configurations in other dimensions. The cases E6 and E7 lead to new examples, while F4, E8, and H4, yield a new interpretation of the known ones. The described configurations have an additional property: they are saturated, i.e. the tuples of mutually orthogonal lines, being partially ordered by inclusion, yield a poset with all maximal elements having the same cardinality (the dimension of space). 1.
We develop a geometric framework for constructing and organizing Kochen--Specker configurations in real four-dimensional space. The construction uses finite grids on pairs of smooth quadrics related by Euclidean polarity. Their incidence geometry directly produces orthogonal measurement contexts and parity proofs of quantum contextuality, yielding infinite families of configurations and a geometric interpretation and extension of a previously known cyclic construction. For a distinguished subfamily, the same geometry admits a canonical completion determined by secant lines. The first two instances of this completion recover the exceptional root configurations of types F4F_4F4​ and H4H_4H4​, while the smallest case also recovers the Cabello configuration and its embedding in the Peres configuration. Thus several prominent four-dimensional contextual configurations, previously obtained from different constructions, arise from a single projective-geometric mechanism.
There exists an example of a set of 40 projective lines in eight-dimensional Hilbert space producing a Kochen–Specker-type contradiction. This set corresponds to a known no-hidden variables argument due to Mermin. In the present paper it is proved that this set admits a finite saturation, i.e., an extension up to a finite set with the following property: every subset of pairwise orthogonal projective lines has a completion, i.e., is contained in at least one subset of eight pairwise orthogonal projective lines. An explicit description of such an extension consisting of 120 projective lines is given. The idea to saturate the set of projective lines related to Mermin’s example together with the possibility to have a finite saturation allow to find the corresponding group of symmetry. This group is described explicitely and is shown to be generated by reflections. The natural action of the mentioned group on the set of all subsets of pairwise orthogonal projective lines of the mentioned extension is investigated. In particular, the restriction of this action to complete subsets is shown to have only four orbits, which have a natural characterization in terms of the construction of the saturation.
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 orthog-onality conditions and thus admit no free parameters. The Kochen-Specker (KS) theorem [1] is a statement about the fundamen-tal nature of quantum mechanics: no non-contextual hidden variable theory can reliably reproduce quantum mechanical predictions. The KS theorem states that in a Hilbert space with dimension n ≥ 3 it is impossible to assign definite values v ∈ {0, 1} to m projection operators Pm so that for every commuting set of projection operators satisfying Pm = I, the correspond-ing definite values obey v (Pm) = 1. The KS theorem is often visualised by means of a set of "uncolourable" vectors, where projection operators are represented by their constituent rays in Hilbert space and rays can be simplified to vectors as only directions are relevant here. The vectors are coloured according to their pre-assigned val-ues and the summation conditions above translate into colouring rules. This allows us to construct orthogonality graphs that, when uncolourable, pro-vide a contradiction within non-contextual hidden variable models and thus a proof of the KS theorem. Sets of vectors exemplifying the KS theorem have been discovered by nu-merous authors, with an aim to reduce the number of vectors required to reach a contradiction. Most notably, in a 3-dimensional Hilbert space, the original KS proof of 117 vectors has been replicated with sets using between 31 and 33 vectors [2, 3, 4, 5] and in a 4-dimensional Hilbert space, sets of between 24 and the lower limit of 18 vectors have been realised [2, 6, 7]. Additionally, an extensive computer search has recently revealed over one thousand of such KS sets in R4 [8]. In a publication by E. Gould and P. K. Aravind [10], two of these sets in 3 dimensions have been shown to share the same orthogonality graph. Specifically, the sets of 33 vectors found by Penrose [3] and Peres [2] have
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 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 n-dim Hilbert space, H n, n ≥ 3 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 R n, 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 4-dim KS vector systems containing up to 24 vectors were generated and described, all 3-dim vector systems containing up to 30 vectors were scanned, and several general properties of KS vectors were found.