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

SpringerBriefs in mathematics

Contextuality: The Compatibility-Hypergraph Approach

Bárbara Amaral, Marcelo Terra Cunha

Published Jan 1, 2018• 3 citations
Publisher
DOI
10.1007/978-3-319-93827-1_2

Related papers

Modelling contextuality by probabilistic programs with hypergraph semantics

Peter Bruza

arXiv:1802.00690•Theoretical Computer Science•Dec 5, 2017•4 citations

Contextuality: The Exclusivity-Graph Approach

Bárbara Amaral, Marcelo Terra Cunha

SpringerBriefs in mathematics•Jan 1, 2018•0 citations

Hypergraph framework for irreducible noncontextuality inequalities from logical proofs of the Kochen-Specker theorem

Ravi Kunjwal

Kochen-Specker (KS) theorem reveals the inconsistency between quantum theory and any putative underlying model of it satisfying the constraint of KS-noncontextuality. A logical proof of the KS theorem is one that relies only on the compatibility relations amongst a set of projectors (a KS set) to witness this inconsistency. These compatibility relations can be represented by a hypergraph, referred to as a contextuality scenario. Here we consider contextuality scenarios that we term KS-uncolourable, e.g., those which appear in logical proofs of the KS theorem. We introduce a hypergraph framework to obtain noise-robust witnesses of contextuality from such scenarios. Our approach builds on the results of R. Kunjwal and R. W. Spekkens, Phys. Rev. Lett. 115, 110403 (2015), by providing new insights into the relationship between the structure of a contextuality scenario and the associated noise-robust noncontextuality inequalities that witness contextuality. The present work also forms a necessary counterpart to the framework presented in R. Kunjwal, Quantum 3, 184 (2019), which only applies to KS-colourable contextuality scenarios, i.e., those which do not admit logical proofs of the KS theorem but do admit statistical proofs. We rely on a single hypergraph invariant, defined in R. Kunjwal, Quantum 3, 184 (2019), that appears in our contextuality witnesses, namely, the weighted max-predictability. The present work can also be viewed as a study of this invariant. Significantly, unlike the case of R. Kunjwal, Quantum 3, 184 (2019), none of the graph invariants from the graph-theoretic framework for KS-contextuality due to Cabello, Severini, and Winter (the ``CSW framework", Phys. Rev. Lett. 112, 040401 (2014)) are relevant for our noise-robust noncontextuality inequalities.

arXiv:1805.02083•Quantum•Jan 10, 2020•20 citations

Contextuality-by-default for behaviours in compatibility scenarios

Alisson Tezzin, Rafael Wagner, Bárbara Amaral

We show that the main idea behind contextuality-by-default (CbD), i.e., the assumption that a physical measurement has to be understood as a contextual collection of random variables, is implicit in the compatibility-hypergraph approach to contextuality (CA) and use this result to develop in the latter important concepts which were introduced in the former. We introduce in CA the non-degeneracy condition, which is the analogous of consistent connectedness, and prove that this condition is, in general, weaker than non-disturbance condition. The set of non-degenerate behaviours defines a polytope, implying that one can characterize consistent connectedness using linear inequalities. We introduce the idea of extended contextuality for behaviours and prove that a behaviour is non-contextual in the standard sense iff it is non-degenerate and non-contextual in the extended sense. Finally, we use extended scenarios and behaviours to shed new light on our results.

arXiv:2008.02273•Aug 5, 2020•2 citations

Measures of contextuality

Andrzej Grudka, Karol Horodecki, Michał Horodecki +5 more

•Sep 17, 2012•0 citations

Hypergraph Contextuality

Mladen Pavičić

Quantum contextuality is a source of quantum computational power and a theoretical delimiter between classical and quantum structures. It has been substantiated by numerous experiments and prompted generation of state independent contextual sets, that is, sets of quantum observables capable of revealing quantum contextuality for any quantum state of a given dimension. There are two major classes of state-independent contextual sets—the Kochen-Specker ones and the operator-based ones. In this paper, we present a third, hypergraph-based class of contextual sets. Hypergraph inequalities serve as a measure of contextuality. We limit ourselves to qutrits and obtain thousands of 3-dim contextual sets. The simplest of them involves only 5 quantum observables, thus enabling a straightforward implementation. They also enable establishing new entropic contextualities.

arXiv:1911.06448•Entropy•Nov 12, 2019•9 citations
Kochen-Specker (KS) theorem reveals the inconsistency between quantum theory and any putative underlying model of it satisfying the constraint of KS-noncontextuality. A logical proof of the KS theorem is one that relies only on the compatibility relations amongst a set of projectors (a KS set) to witness this inconsistency. These compatibility relations can be represented by a hypergraph, referred to as a contextuality scenario. Here we consider contextuality scenarios that we term KS-uncolourable, e.g., those which appear in logical proofs of the KS theorem. We introduce a hypergraph framework to obtain noise-robust witnesses of contextuality from such scenarios. Our approach builds on the results of R. Kunjwal and R. W. Spekkens, Phys. Rev. Lett. 115, 110403 (2015), by providing new insights into the relationship between the structure of a contextuality scenario and the associated noise-robust noncontextuality inequalities that witness contextuality. The present work also forms a necessary counterpart to the framework presented in R. Kunjwal, Quantum 3, 184 (2019), which only applies to KS-colourable contextuality scenarios, i.e., those which do not admit logical proofs of the KS theorem but do admit statistical proofs. We rely on a single hypergraph invariant, defined in R. Kunjwal, Quantum 3, 184 (2019), that appears in our contextuality witnesses, namely, the weighted max-predictability. The present work can also be viewed as a study of this invariant. Significantly, unlike the case of R. Kunjwal, Quantum 3, 184 (2019), none of the graph invariants from the graph-theoretic framework for KS-contextuality due to Cabello, Severini, and Winter (the ``CSW framework", Phys. Rev. Lett. 112, 040401 (2014)) are relevant for our noise-robust noncontextuality inequalities.
We show that the main idea behind contextuality-by-default (CbD), i.e., the assumption that a physical measurement has to be understood as a contextual collection of random variables, is implicit in the compatibility-hypergraph approach to contextuality (CA) and use this result to develop in the latter important concepts which were introduced in the former. We introduce in CA the non-degeneracy condition, which is the analogous of consistent connectedness, and prove that this condition is, in general, weaker than non-disturbance condition. The set of non-degenerate behaviours defines a polytope, implying that one can characterize consistent connectedness using linear inequalities. We introduce the idea of extended contextuality for behaviours and prove that a behaviour is non-contextual in the standard sense iff it is non-degenerate and non-contextual in the extended sense. Finally, we use extended scenarios and behaviours to shed new light on our results.
Quantum contextuality is a source of quantum computational power and a theoretical delimiter between classical and quantum structures. It has been substantiated by numerous experiments and prompted generation of state independent contextual sets, that is, sets of quantum observables capable of revealing quantum contextuality for any quantum state of a given dimension. There are two major classes of state-independent contextual sets—the Kochen-Specker ones and the operator-based ones. In this paper, we present a third, hypergraph-based class of contextual sets. Hypergraph inequalities serve as a measure of contextuality. We limit ourselves to qutrits and obtain thousands of 3-dim contextual sets. The simplest of them involves only 5 quantum observables, thus enabling a straightforward implementation. They also enable establishing new entropic contextualities.