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

Exact projector-rank thresholds for state-independent contextuality

Sunay Venkat

Published Nov 11, 2026• 0 citations
Publisher

Abstract

For every integer r ≥ 1 we construct a finite exclusivity graph Fr with the following two properties. First, Fr has a projective representation by pairwise distinct projectors of rank r that exhibits state-independent contextuality. Second, no projective representation of Fr by projectors of any common rank s < r, in any finite dimension, exhibits state-independent contextuality; in every such representation the maximally mixed state is noncontextual. This establishes, for every r, the “rank efficient” scenarios sought by Hohn, Xu and Kleinmann, for which only numerical evidence at r = 2, 3 was available. The graph is the disjunctive product of an odd cycle C2r+1 with the orthogonality structure of a rank-one contextuality set whose fractional chromatic number exceeds its dimension by an arbitrarily small amount. Such sets are obtained from the infinite family of Kochen–Specker parity proofs in R^4 of Elford and Lisonek, together with a coning construction that raises the dimension by one.

DOI
10.5281/zenodo.24147408

Related papers

UNBOUNDED PROJECTOR-RANK THRESHOLDS FOR STATE-INDEPENDENT CONTEXTUALITY

Gregory Westberg

For every positive integer R, this preprint constructs a finite graph that exhibits state-independent quantum contextuality using distinct projectors of one common rank. The construction gives a contextuality violation ratio of at least 81/80 for every quantum state. Yet every projective representation of the same graph with ranks between 1 and R has a noncontextual maximally mixed state, regardless of the finite dimension. The proof uses the arc graphs from Jensen Kohlmeyer and Liam Kruer’s solution to Erdős Problem 108. Their construction supplies graphs with arbitrarily large ordinary chromatic number and bounded fractional chromatic number. This combination is what makes it possible to rule out every representation below the chosen rank threshold. The result answers the arbitrary rank threshold existence question posed by Höhn, Xu, and Kleinmann in Section 8 of their paper. arXiv:2207.11183 This record includes the preprint, a standalone Lean 4 proof of the complete theorem, and supporting source files, build instructions, verification logs, and license notices.

•Nov 9, 2026•0 citations

Systematic construction of quantum contextuality scenarios with rank advantage

Pascal Höhn, Zhen‐Peng Xu, Matthias Kleinmann

A set of quantum measurements exhibits quantum contextuality when any consistent value assignment to the measurement outcomes leads to a contradiction with quantum theory. In the original Kochen-Specker-type of argument the measurement projectors are assumed to be rays, that is, of unit rank. Only recently a contextuality scenario has been identified where state-independent contextuality requires measurements with projectors of rank two. Using the disjunctive graph product, we provide a systematic method to construct contextuality scenarios which require non-unit rank. We construct explicit examples requiring ranks greater than rank one up to rank five.

arXiv:2207.11183•Jul 22, 2022•0 citations

Necessary and Sufficient Condition for State-Independent Contextual Measurement Scenarios

Ravishankar Ramanathan, Paweł Horodecki

The problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension d and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes of contextual behavior, and that (ii) state-independent contextuality is equivalent to the contextuality of the maximally mixed state up to a global unitary transformation. We then derive a necessary and sufficient condition for a measurement scenario represented by an orthogonality graph to reveal state-independent contextuality. This condition is given in terms of the fractional chromatic number of the graph χf(G) and is shown to identify all state-independent contextual measurement scenarios including those that go beyond the original Kochen-Specker paradigm.

arXiv:1212.5933•Physical Review Letters•Jan 29, 2014•37 citations

Event-based quantum contextuality theory

Songyi Liu, Yongjun Wang, Baoshan Wang +1 more

Fully revealing the mathmatical structure of quantum contextuality is a significant task, while some known contextuality theories are only applicable for rank-1 projectors. That is because they adopt the observable-based definitions. This paper overcomes the challenges faced by some known contextuality theories by establishing an event-based contextuality theory with exclusive partial Boolean algebra, which is used to describe the contextual systems with local consistency and exclusivity principle. Our theory provides a precise mathematical framework for quantum contextuality, which can handle the scenarios composed of general projectors, and introduces a more complete contextuality hierarchy. We conclude that the Kochen-Specker contextuality is equivalent to the state-independent strong contextuality for finite dimensional quantum systems. Therefore, when considering both the strength and proportion of contextual quantum states, Kochen-Specker contextuality is the strongest.

arXiv:2410.15790•Oct 21, 2024•0 citations

Construction of state-independent proofs for quantum contextuality

Weidong Tang, Sixia Yu

Since the enlightening proofs of quantum contextuality first established by Kochen and Specker, and also by Bell, various simplified proofs have been constructed to exclude the noncontextual hidden variable theory of our nature at the microscopic scale. The conflict between the noncontextual hidden variable theory and quantum mechanics is commonly revealed by Kochen-Specker sets of yes-no tests, represented by projectors (or rays), via either logical contradictions or noncontextuality inequalities in a state-(in)dependent manner. Here we propose a systematic and programmable construction of a state-independent proof from a given set of nonspecific rays in ${\mathbb{C}}^{3}$ according to their Gram matrix. This approach brings us a greater convenience in the experimental arrangements. Besides, our proofs in ${\mathbb{C}}^{3}$ can also be generalized to any higher-dimensional systems by a recursive method.

arXiv:1707.05626•Physical Review A•Dec 21, 2017•5 citations

Automated search for highly contextual Kochen-Specker proofs

Axel Muller, Metod Saniga

Observable-based Kochen-Specker proofs are configurations of multi-qubit Pauli observables grouped into contexts whose products are plus or minus the indentity. Their robustness as state-independent contextuality tests can be measured by the tolerated error per context $\varepsilon = 2d/|H|$, where $d$ is the contextuality degree and $|H|$ the number of contexts. Since the degree depends only on an underlying abstract structure called the hypergram i.e. the pair formed by the context hypergraph and the anticommutation graph, the search for highly contextual proofs can be carried out on them instead, with no reference to qubits or to any particular Pauli labeling. We further exploit this by enumerating anticommutation graphs first, and then by associating to each graph $G$ the single hypergram carrying its entire hypergraph support $HS(G)$, so that exactly one candidate is examined per graph. Applied to the House of Graphs database and to censuses of vertex-transitive graphs on at most 24 vertices, this pipeline recovers the Peres-Mermin square, the doily and the Mermin pentagram, and yields configurations reaching $\varepsilon = 0.707$, against $0.424$ for the previous published record. The best configurations are predominantly those stemming from line graphs and unions of graphs; we explain the former by showing that every perfect matching of a graph is a context of its line graph, which exhibits the Peres-Mermin square and the doily as the first members of two infinite families. We close with finite geometric descriptions of the most striking configurations inside symplectic polar spaces, in terms of ovoids, hyperbolic quadrics and Fano planes.

quant-pharXiv:2609.19862•Sep 18, 2026•1 citation
For every integer r ≥ 1 we construct a finite exclusivity graph Fr with the following two properties. First, Fr has a projective representation by pairwise distinct projectors of rank r that exhibits state-independent contextuality. Second, no projective representation of Fr by projectors of any common rank s < r, in any finite dimension, exhibits state-independent contextuality; in every such representation the maximally mixed state is noncontextual. This establishes, for every r, the “rank efficient” scenarios sought by Hohn, Xu and Kleinmann, for which only numerical evidence at r = 2, 3 was available. The graph is the disjunctive product of an odd cycle C2r+1 with the orthogonality structure of a rank-one contextuality set whose fractional chromatic number exceeds its dimension by an arbitrarily small amount. Such sets are obtained from the infinite family of Kochen–Specker parity proofs in R^4 of Elford and Lisonek, together with a coning construction that raises the dimension by one.
For every positive integer R, this preprint constructs a finite graph that exhibits state-independent quantum contextuality using distinct projectors of one common rank. The construction gives a contextuality violation ratio of at least 81/80 for every quantum state. Yet every projective representation of the same graph with ranks between 1 and R has a noncontextual maximally mixed state, regardless of the finite dimension. The proof uses the arc graphs from Jensen Kohlmeyer and Liam Kruer’s solution to Erdős Problem 108. Their construction supplies graphs with arbitrarily large ordinary chromatic number and bounded fractional chromatic number. This combination is what makes it possible to rule out every representation below the chosen rank threshold. The result answers the arbitrary rank threshold existence question posed by Höhn, Xu, and Kleinmann in Section 8 of their paper. arXiv:2207.11183 This record includes the preprint, a standalone Lean 4 proof of the complete theorem, and supporting source files, build instructions, verification logs, and license notices.
A set of quantum measurements exhibits quantum contextuality when any consistent value assignment to the measurement outcomes leads to a contradiction with quantum theory. In the original Kochen-Specker-type of argument the measurement projectors are assumed to be rays, that is, of unit rank. Only recently a contextuality scenario has been identified where state-independent contextuality requires measurements with projectors of rank two. Using the disjunctive graph product, we provide a systematic method to construct contextuality scenarios which require non-unit rank. We construct explicit examples requiring ranks greater than rank one up to rank five.
The problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension d and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes of contextual behavior, and that (ii) state-independent contextuality is equivalent to the contextuality of the maximally mixed state up to a global unitary transformation. We then derive a necessary and sufficient condition for a measurement scenario represented by an orthogonality graph to reveal state-independent contextuality. This condition is given in terms of the fractional chromatic number of the graph χf(G) and is shown to identify all state-independent contextual measurement scenarios including those that go beyond the original Kochen-Specker paradigm.
Fully revealing the mathmatical structure of quantum contextuality is a significant task, while some known contextuality theories are only applicable for rank-1 projectors. That is because they adopt the observable-based definitions. This paper overcomes the challenges faced by some known contextuality theories by establishing an event-based contextuality theory with exclusive partial Boolean algebra, which is used to describe the contextual systems with local consistency and exclusivity principle. Our theory provides a precise mathematical framework for quantum contextuality, which can handle the scenarios composed of general projectors, and introduces a more complete contextuality hierarchy. We conclude that the Kochen-Specker contextuality is equivalent to the state-independent strong contextuality for finite dimensional quantum systems. Therefore, when considering both the strength and proportion of contextual quantum states, Kochen-Specker contextuality is the strongest.
Since the enlightening proofs of quantum contextuality first established by Kochen and Specker, and also by Bell, various simplified proofs have been constructed to exclude the noncontextual hidden variable theory of our nature at the microscopic scale. The conflict between the noncontextual hidden variable theory and quantum mechanics is commonly revealed by Kochen-Specker sets of yes-no tests, represented by projectors (or rays), via either logical contradictions or noncontextuality inequalities in a state-(in)dependent manner. Here we propose a systematic and programmable construction of a state-independent proof from a given set of nonspecific rays in C3{\mathbb{C}}^{3}C3 according to their Gram matrix. This approach brings us a greater convenience in the experimental arrangements. Besides, our proofs in C3{\mathbb{C}}^{3}C3 can also be generalized to any higher-dimensional systems by a recursive method.
Observable-based Kochen-Specker proofs are configurations of multi-qubit Pauli observables grouped into contexts whose products are plus or minus the indentity. Their robustness as state-independent contextuality tests can be measured by the tolerated error per context ε=2d/∣H∣\varepsilon = 2d/|H|ε=2d/∣H∣, where ddd is the contextuality degree and ∣H∣|H|∣H∣ the number of contexts. Since the degree depends only on an underlying abstract structure called the hypergram i.e. the pair formed by the context hypergraph and the anticommutation graph, the search for highly contextual proofs can be carried out on them instead, with no reference to qubits or to any particular Pauli labeling. We further exploit this by enumerating anticommutation graphs first, and then by associating to each graph GGG the single hypergram carrying its entire hypergraph support HS(G)HS(G)HS(G), so that exactly one candidate is examined per graph. Applied to the House of Graphs database and to censuses of vertex-transitive graphs on at most 24 vertices, this pipeline recovers the Peres-Mermin square, the doily and the Mermin pentagram, and yields configurations reaching ε=0.707\varepsilon = 0.707ε=0.707, against 0.4240.4240.424 for the previous published record. The best configurations are predominantly those stemming from line graphs and unions of graphs; we explain the former by showing that every perfect matching of a graph is a context of its line graph, which exhibits the Peres-Mermin square and the doily as the first members of two infinite families. We close with finite geometric descriptions of the most striking configurations inside symplectic polar spaces, in terms of ovoids, hyperbolic quadrics and Fano planes.