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:2608.18273

Pseudocontexts forced by finite context hypergraphs

Mirko Navara, Karl Svozil

quant-phSubmitted Aug 18, 2026• Announced Aug 20, 2026• 0 citations
arXivHTMLPDF

Abstract

A context is a complete set of mutually exclusive outcomes whose probabilities sum to one. We define a pseudocontext as two disjoint groups, with no mutually exclusive pair within either group, whose total probabilities must nevertheless be equal solely because of how the contexts overlap. We give an exact finite test for this property and show that the equality is independent of the chosen coordinates and probability model. Applying the test in three dimensions, we obtain a 15-outcome real example with groups of three and a 20-outcome complex example with groups of two. Under this definition, the sharp minimum number of outcomes in each target group is two over the complex field and three over the real field.

Comments
8 pages, 1 fifure

Related papers

Form of contextuality predicting probabilistic equivalence between two sets of three mutually noncommuting observables

Mirko Navara, Karl Svozil

We introduce a contextual quantum system comprising mutually complementary observables organized into two or more collections of pseudocontexts with the same probability sums of outcomes. These pseudocontexts constitute nonorthogonal bases within the Hilbert space, featuring a state-independent sum of probabilities. In other words, regardless of the initial-state preparation, the total probability remains constant but may be distinct from unity. The measurement contextuality in this setup arises from the quantum realizations of the hypergraph, which adhere to a specific bound on the linear combination of probabilities. In contrast, classical realizations can surpass this bound. The violation of quantum bounds stems from the inability of classical ontological models, specifically the set-theoretic representation of the hypergraph corresponding to the quantum observables' collections, to adhere to and explain the observed statistics.

arXiv:2309.13091•Physical Review A•Feb 20, 2024•1 citation

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•1 citation

Complex coordinates forced by finite orthogonality hypergraphs in dimension three

Mirko Navara, Karl Svozil

We exhibit two finite orthogonality hypergraphs that admit faithful orthogonal representations by rays in complex three-dimensional space but admit none in real three-dimensional space. Thus, although each orthogonality diagram is unchanged, its coordinatizability in dimension three depends on whether the scalar field is complex or real. The first hypergraph has 20 vertices and 12 contexts. The second hypergraph adds one vertex and two contexts. Phase-adjusted realification also gives explicit faithful orthogonal representations of both hypergraphs in real six-dimensional space.

math.COCross-listedarXiv:2609.20205•Jul 28, 2026•0 citations

Probabilistic foundations of contextuality

Ehtibar N. Dzhafarov, Janne V. Kujala

Contextuality is usually defined as absence of a joint distribution for a set of measurements (random variables) with known joint distributions of some of its subsets. However, if these subsets of measurements are not disjoint, contextuality is mathematically impossible even if one generally allows (as one must) for random variables not to be jointly distributed. To avoid contradictions one has to adopt the Contextuality‐by‐Default approach: measurements made in different contexts are always distinct and stochastically unrelated to each other. Contextuality is reformulated then in terms of the (im)possibility of imposing on all the measurements in a system a joint distribution of a particular kind: such that any measurements of one and the same property made in different contexts satisfy a specified property, . In the traditional analysis of contextuality means “are equal to each other with probability 1”. However, if the system of measurements violates the “no‐disturbance principle”, due to signaling or experimental biases, then the meaning of has to be generalized, and the proposed generalization is “are equal to each other with maximal possible probability” (applied to any set of measurements of one and the same property). This approach is illustrated on arbitrary systems of binary measurements, including most of quantum systems of traditional interest in contextuality studies (irrespective of whether the “no‐disturbance” principle holds in them).

arXiv:1604.08412•Fortschritte der Physik•Sep 7, 2016•34 citations

Unitary-orbit classification and a refinement theorem for context-independent projective probabilities

Michael P. Rubin

Let $\mathcal H$ be a finite-dimensional complex Hilbert space, and let $w(P,\mathsf M)$ be a normalized probability weight assigned to an outcome projection $P$ as it occurs in a projective measurement $\mathsf M$. For fixed $P$, let $G_P\cong\mathcal U(P^\perp)$ be the group of unitaries acting identically on $\operatorname{ran}P$ and arbitrarily on $P^\perp$. We classify the $G_P$-orbits of projective measurements containing $P$: two measurements lie in the same orbit exactly when the multisets of ranks of their complementary outcomes agree. The orbit with profile $λ=(r_1,\ldots,r_k)$ is a compact homogeneous space of real dimension $(d-\operatorname{rank}P)^2-\sum_j r_j^2$. On maximal rank-one measurements there is one orbit, so context independence is equivalent to $G_P$-invariance, with equality of the corresponding uniform defects; invariance under two-level complementary unitaries already suffices. For arbitrary projective measurements, every context containing an outcome $P\neq I$ coarsens to the unique binary context $\{P,I-P\}$. Consequently, refinement consistency alone is equivalent to context independence. The finite orbit space carries a natural rank-profile refinement graph, whose diameter is $d-\operatorname{rank}P-1$ when $P\neq I$. We prove a stability theorem that compares the binary-coarsening path with a shortest path in this graph followed by one complementary unitary. In dimension at least three, Gleason's theorem converts the maximal-context invariance condition and the all-context refinement condition, on their respective domains, into the Born form $\operatorname{Tr}(ρP)$. The results are structural characterizations, not independent physical derivations of context independence.

quant-pharXiv:2608.16936•Aug 11, 2026•0 citations

Probabilistic models on contextuality scenarios

Tobias Fritz, Anthony Leverrier, Ana Belén Sainz

We introduce a framework to describe probabilistic models in Bell experiments, and more generally in contextuality scenarios. Such a scenario is a hypergraph whose vertices represent elementary events and hyperedges correspond to measurements. A probabilistic model on such a scenario associates to each event a probability, in such a way that events in a given measurement have a total probability equal to one. We discuss the advantages of this framework, like the unification of the notions of contexuality and nonlocality, and give a short overview of results obtained elsewhere.

arXiv:1307.0145•Electronic Proceedings in Theoretical Computer Science•Dec 26, 2014•9 citations
A context is a complete set of mutually exclusive outcomes whose probabilities sum to one. We define a pseudocontext as two disjoint groups, with no mutually exclusive pair within either group, whose total probabilities must nevertheless be equal solely because of how the contexts overlap. We give an exact finite test for this property and show that the equality is independent of the chosen coordinates and probability model. Applying the test in three dimensions, we obtain a 15-outcome real example with groups of three and a 20-outcome complex example with groups of two. Under this definition, the sharp minimum number of outcomes in each target group is two over the complex field and three over the real field.
We introduce a contextual quantum system comprising mutually complementary observables organized into two or more collections of pseudocontexts with the same probability sums of outcomes. These pseudocontexts constitute nonorthogonal bases within the Hilbert space, featuring a state-independent sum of probabilities. In other words, regardless of the initial-state preparation, the total probability remains constant but may be distinct from unity. The measurement contextuality in this setup arises from the quantum realizations of the hypergraph, which adhere to a specific bound on the linear combination of probabilities. In contrast, classical realizations can surpass this bound. The violation of quantum bounds stems from the inability of classical ontological models, specifically the set-theoretic representation of the hypergraph corresponding to the quantum observables' collections, to adhere to and explain the observed statistics.
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.
We exhibit two finite orthogonality hypergraphs that admit faithful orthogonal representations by rays in complex three-dimensional space but admit none in real three-dimensional space. Thus, although each orthogonality diagram is unchanged, its coordinatizability in dimension three depends on whether the scalar field is complex or real. The first hypergraph has 20 vertices and 12 contexts. The second hypergraph adds one vertex and two contexts. Phase-adjusted realification also gives explicit faithful orthogonal representations of both hypergraphs in real six-dimensional space.
Contextuality is usually defined as absence of a joint distribution for a set of measurements (random variables) with known joint distributions of some of its subsets. However, if these subsets of measurements are not disjoint, contextuality is mathematically impossible even if one generally allows (as one must) for random variables not to be jointly distributed. To avoid contradictions one has to adopt the Contextuality‐by‐Default approach: measurements made in different contexts are always distinct and stochastically unrelated to each other. Contextuality is reformulated then in terms of the (im)possibility of imposing on all the measurements in a system a joint distribution of a particular kind: such that any measurements of one and the same property made in different contexts satisfy a specified property, . In the traditional analysis of contextuality means “are equal to each other with probability 1”. However, if the system of measurements violates the “no‐disturbance principle”, due to signaling or experimental biases, then the meaning of has to be generalized, and the proposed generalization is “are equal to each other with maximal possible probability” (applied to any set of measurements of one and the same property). This approach is illustrated on arbitrary systems of binary measurements, including most of quantum systems of traditional interest in contextuality studies (irrespective of whether the “no‐disturbance” principle holds in them).
Let H\mathcal HH be a finite-dimensional complex Hilbert space, and let w(P,M)w(P,\mathsf M)w(P,M) be a normalized probability weight assigned to an outcome projection PPP as it occurs in a projective measurement M\mathsf MM. For fixed PPP, let GP≅U(P⊥)G_P\cong\mathcal U(P^\perp)GP​≅U(P⊥) be the group of unitaries acting identically on ran⁡P\operatorname{ran}PranP and arbitrarily on P⊥P^\perpP⊥. We classify the GPG_PGP​-orbits of projective measurements containing PPP: two measurements lie in the same orbit exactly when the multisets of ranks of their complementary outcomes agree. The orbit with profile λ=(r1,…,rk)λ=(r_1,\ldots,r_k)λ=(r1​,…,rk​) is a compact homogeneous space of real dimension (d−rank⁡P)2−∑jrj2(d-\operatorname{rank}P)^2-\sum_j r_j^2(d−rankP)2−∑j​rj2​. On maximal rank-one measurements there is one orbit, so context independence is equivalent to GPG_PGP​-invariance, with equality of the corresponding uniform defects; invariance under two-level complementary unitaries already suffices. For arbitrary projective measurements, every context containing an outcome P≠IP\neq IP=I coarsens to the unique binary context {P,I−P}\{P,I-P\}{P,I−P}. Consequently, refinement consistency alone is equivalent to context independence. The finite orbit space carries a natural rank-profile refinement graph, whose diameter is d−rank⁡P−1d-\operatorname{rank}P-1d−rankP−1 when P≠IP\neq IP=I. We prove a stability theorem that compares the binary-coarsening path with a shortest path in this graph followed by one complementary unitary. In dimension at least three, Gleason's theorem converts the maximal-context invariance condition and the all-context refinement condition, on their respective domains, into the Born form Tr⁡(ρP)\operatorname{Tr}(ρP)Tr(ρP). The results are structural characterizations, not independent physical derivations of context independence.
We introduce a framework to describe probabilistic models in Bell experiments, and more generally in contextuality scenarios. Such a scenario is a hypergraph whose vertices represent elementary events and hyperedges correspond to measurements. A probabilistic model on such a scenario associates to each event a probability, in such a way that events in a given measurement have a total probability equal to one. We discuss the advantages of this framework, like the unification of the notions of contexuality and nonlocality, and give a short overview of results obtained elsewhere.