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

UNBOUNDED PROJECTOR-RANK THRESHOLDS FOR STATE-INDEPENDENT CONTEXTUALITY

Gregory Westberg

Published Nov 9, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.24074024

Related papers

Exact projector-rank thresholds for state-independent contextuality

Sunay Venkat

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.

•Nov 11, 2026•0 citations

Large violations in Kochen Specker contextuality and their applications

Ravishankar Ramanathan, Yuan Liu, Paweł Horodecki

Abstract It is of interest to study how contextual quantum mechanics is, in terms of the violation of Kochen Specker state-independent and state-dependent non-contextuality inequalities. We present state-independent non-contextuality inequalities with large violations, in particular, we exploit a connection between Kochen–Specker proofs and pseudo-telepathy games to show KS proofs in Hilbert spaces of dimension d ⩾ 217 with the ratio of quantum value to classical bias being O ( d / log d ) . We study the properties of this KS set and show applications of the large violation. It has been recently shown that Kochen–Specker proofs always consist of substructures of state-dependent contextuality proofs called 01-gadgets. We show a one-to-one connection between 01-gadgets in C d and Hardy paradoxes for the maximally entangled state in C d ⊗ C d . We use this connection to construct large violation 01-gadgets between arbitrary vectors in C d , as well as novel Hardy paradoxes for the maximally entangled state in C d ⊗ C d , and give applications of these constructions. As a technical result, we show that the minimum dimension of the faithful orthogonal representation of a graph in R d is not a graph monotone, a result that may be of independent interest.

arXiv:2106.15954•New Journal of Physics•Nov 17, 2021•3 citations

Chromatic Constraints on Quantum Observables: Gaps, Contextuality, and Separability

Karl Svozil

Intertwined complete projective experiments share outcomes, motivating the search for a common spectral labeling across contexts. Strong coloring tests whether complete contexts admit one context-independent nondegenerate spectrum; when that labeling exists, chromatic separability tests which event distinctions it preserves. We distinguish these questions from ordinary Kochen--Specker statelessness, geometric realizability, event-order representation, and Born-probability models. A state extends to a strong d-coloring exactly when deletion of its support leaves a (d-1)-colorable graph. Faithful real 17- and 21-ray restrictions of completed Yu--Oh have separating ordinary states but forced color identities; one quantum preparation requires exactly 1/9 nonextendable weight despite admitting an ordinary-state model. Independent Hermitian projection arguments correct earlier inferences from a chromatic gap to statelessness or nonrealizability. Hesse's complex 37-ray example separates real and complex geometry and has exact state-family minima 6/7/18 for three representation requirements. A rational two-plane construction gives a linear real 65-ray example with 393,216 states and explicit event-order and probability failures. General and specified ancestry results distinguish geometric KS extensions from abstract chromatic-to-stateless constructions. Detailed enumerations, regenerated state certificates, and extended proofs are supplementary.

quant-pharXiv:2607.04289•Jul 7, 2026•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

Chromatic Quantum Contextuality

Karl Svozil

Chromatic quantum contextuality is a criterion of quantum nonclassicality based on (hyper)graph coloring constraints. If a quantum hypergraph requires more colors than the number of outcomes per maximal observable (context), it lacks a classical realization with n-uniform outcomes per context. Consequently, it cannot represent a “completable” noncontextual set of coexisting n-ary outcomes per maximal observable. This result serves as a chromatic analogue of the Kochen-Specker theorem. We present an explicit example of a four-colorable quantum logic in dimension three. Furthermore, chromatic contextuality suggests a novel restriction on classical truth values, thereby excluding two-valued measures that cannot be extended to n-ary colorings. Using this framework, we establish new bounds for the house, pentagon, and pentagram hypergraphs, refining previous constraints.

arXiv:2501.15261•Entropy•Apr 5, 2025•5 citations

Dimension-dependent noncontextuality inequalities with large contexts

Xiang Zhan, Linxi Hu

Quantum theory shows a striking nonclassical feature of contextuality, which is also a crucial resource for quantum information processing. In this paper, we study the dependence of violating noncontextuality inequalities against the dimension of quantum systems. To this end, we consider the restrictions imposed on relations among measurements by limitation of dimensions. Based on the graph-theoretic approach to quantum contextuality, we construct noncontextuality inequalities using multiple mutually orthogonal projectors which are unique to high-dimensional quantum systems. We report two typical classes of dimension-dependent noncontextuality inequalities for one of which a violation implies the dimension of the quantum system is higher than a threshold, and for the other, different amounts of violations correspond to different thresholds of dimension. Our paper is expected to inspire more dimension-dependent noncontextuality inequalities.

Physical Review A•Sep 10, 2021•5 citations
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.
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.
Abstract It is of interest to study how contextual quantum mechanics is, in terms of the violation of Kochen Specker state-independent and state-dependent non-contextuality inequalities. We present state-independent non-contextuality inequalities with large violations, in particular, we exploit a connection between Kochen–Specker proofs and pseudo-telepathy games to show KS proofs in Hilbert spaces of dimension d ⩾ 217 with the ratio of quantum value to classical bias being O ( d / log d ) . We study the properties of this KS set and show applications of the large violation. It has been recently shown that Kochen–Specker proofs always consist of substructures of state-dependent contextuality proofs called 01-gadgets. We show a one-to-one connection between 01-gadgets in C d and Hardy paradoxes for the maximally entangled state in C d ⊗ C d . We use this connection to construct large violation 01-gadgets between arbitrary vectors in C d , as well as novel Hardy paradoxes for the maximally entangled state in C d ⊗ C d , and give applications of these constructions. As a technical result, we show that the minimum dimension of the faithful orthogonal representation of a graph in R d is not a graph monotone, a result that may be of independent interest.
Intertwined complete projective experiments share outcomes, motivating the search for a common spectral labeling across contexts. Strong coloring tests whether complete contexts admit one context-independent nondegenerate spectrum; when that labeling exists, chromatic separability tests which event distinctions it preserves. We distinguish these questions from ordinary Kochen--Specker statelessness, geometric realizability, event-order representation, and Born-probability models. A state extends to a strong d-coloring exactly when deletion of its support leaves a (d-1)-colorable graph. Faithful real 17- and 21-ray restrictions of completed Yu--Oh have separating ordinary states but forced color identities; one quantum preparation requires exactly 1/9 nonextendable weight despite admitting an ordinary-state model. Independent Hermitian projection arguments correct earlier inferences from a chromatic gap to statelessness or nonrealizability. Hesse's complex 37-ray example separates real and complex geometry and has exact state-family minima 6/7/18 for three representation requirements. A rational two-plane construction gives a linear real 65-ray example with 393,216 states and explicit event-order and probability failures. General and specified ancestry results distinguish geometric KS extensions from abstract chromatic-to-stateless constructions. Detailed enumerations, regenerated state certificates, and extended proofs are supplementary.
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.
Chromatic quantum contextuality is a criterion of quantum nonclassicality based on (hyper)graph coloring constraints. If a quantum hypergraph requires more colors than the number of outcomes per maximal observable (context), it lacks a classical realization with n-uniform outcomes per context. Consequently, it cannot represent a “completable” noncontextual set of coexisting n-ary outcomes per maximal observable. This result serves as a chromatic analogue of the Kochen-Specker theorem. We present an explicit example of a four-colorable quantum logic in dimension three. Furthermore, chromatic contextuality suggests a novel restriction on classical truth values, thereby excluding two-valued measures that cannot be extended to n-ary colorings. Using this framework, we establish new bounds for the house, pentagon, and pentagram hypergraphs, refining previous constraints.
Quantum theory shows a striking nonclassical feature of contextuality, which is also a crucial resource for quantum information processing. In this paper, we study the dependence of violating noncontextuality inequalities against the dimension of quantum systems. To this end, we consider the restrictions imposed on relations among measurements by limitation of dimensions. Based on the graph-theoretic approach to quantum contextuality, we construct noncontextuality inequalities using multiple mutually orthogonal projectors which are unique to high-dimensional quantum systems. We report two typical classes of dimension-dependent noncontextuality inequalities for one of which a violation implies the dimension of the quantum system is higher than a threshold, and for the other, different amounts of violations correspond to different thresholds of dimension. Our paper is expected to inspire more dimension-dependent noncontextuality inequalities.