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:1802.00690 · Theoretical Computer Science

Modelling contextuality by probabilistic programs with hypergraph semantics

Peter Bruza

Published Dec 5, 2017• 3 citations
arXivHTMLPDF
DOI
10.1016/j.tcs.2017.11.028

Related papers

Probabilistic Programs for Investigating Contextuality in Human Information Processing

Peter Bruza, Péter Wittek

Lecture notes in computer science•Jan 1, 2019•1 citation

Contextuality: The Compatibility-Hypergraph Approach

Bárbara Amaral, Marcelo Terra Cunha

SpringerBriefs in mathematics•Jan 1, 2018•2 citations

Pragmatic versus semantic contextuality in quantum physics

Claudio Garola

International Journal of Theoretical Physics•Aug 1, 1995•4 citations

Operator systems, contextuality and non-locality

M. Anoussis, Alexandros Chatzinikolaou, Ivan G. Todorov

We introduce an operator system, universal for the probabilistic models of a contextuality scenario, and identify its maximal C∗-cover via the right C∗-algebra of a canonical ternary ring of operators, arising from a hypergraph version of stochastic operator matrices. We study dilating contextuality scenarios, which have the property that each positive operator representation thereof admits a dilation to a projective representation on a larger Hilbert space, and characterise them via the equality of the aforementioned universal operator system and the operator system arising from the canonical generators of the respective hypergraph C∗-algebra. We characterise the no-signalling probabilistic models over a pair of contextuality scenarios of different types, which arise from either the positive operator representations or from the projective representations of these scenarios, in terms of states on operator system tensor products. Generalising the notion of a synchronous no-signalling correlation to the hypergraph framework, we define coherent probabilistic models associated with a given contextuality scenario and characterise various classes thereof via different types of traces of the hypergraph C∗-algebra, associated with the scenario. We establish several equivalent formulations of the Connes Embedding Problem in terms of no-signalling probabilistic models and hypergraph operator systems.

arXiv:2405.11152•Dissertationes Mathematicae•Oct 28, 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

Quantum-Like Representation of Contextual Probabilistic Model

Andrei Yu. Khrennikov

Springer eBooks•Jan 1, 2009•2 citations
We introduce an operator system, universal for the probabilistic models of a contextuality scenario, and identify its maximal C∗-cover via the right C∗-algebra of a canonical ternary ring of operators, arising from a hypergraph version of stochastic operator matrices. We study dilating contextuality scenarios, which have the property that each positive operator representation thereof admits a dilation to a projective representation on a larger Hilbert space, and characterise them via the equality of the aforementioned universal operator system and the operator system arising from the canonical generators of the respective hypergraph C∗-algebra. We characterise the no-signalling probabilistic models over a pair of contextuality scenarios of different types, which arise from either the positive operator representations or from the projective representations of these scenarios, in terms of states on operator system tensor products. Generalising the notion of a synchronous no-signalling correlation to the hypergraph framework, we define coherent probabilistic models associated with a given contextuality scenario and characterise various classes thereof via different types of traces of the hypergraph C∗-algebra, associated with the scenario. We establish several equivalent formulations of the Connes Embedding Problem in terms of no-signalling probabilistic models and hypergraph operator systems.
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.