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 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.
In the past few decades, the connections between non-local games arising in quantum information theory and the theory of operator algebras have undergone a phase of significant development. Operator algebras provide a particularly fruitful framework for approaching questions of non-locality in quantum systems, as the input-output behavior of measurements on bipartite quantum systems can be encoded through noncommutative operator algebras and their state spaces. This thesis is the compilation of a series of papers, written by the author in collaboration with Ivan G. Todorov, utilizing this framework by using the theory of operator algebras and completely positive maps to study questions involving non-local games. ☐ Using the simulation paradigm from information theory, we define a quantized version of homomorphisms and isomorphisms between classical hypergraphs, generalizing quantum homomorphisms and isomorphisms of graphs from the literature. We show that these quantum homomorphisms and isomorphisms constitute pre-orders and equivalence relations, respectively. We use quantum homomorphisms of hypergraphs to provide multiple examples of strict separation between correlation classes of varying types. Specializing to the case when our underlying hypergraphs arise from classical non-local games, we define quantum non-local game homomorphisms and isomorphisms. We also show how the existence of a homomorphism or isomorphism of some fixed type between games is reflected in a comparison of optimal and asymptotic game values with respect to this type. These non-local game homomorphisms are defined via a new class of non-signalling correlations which we introduce here. We develop the multivariate tensor product theory in the category of operator systems, which we then use to provide a characterization of game homomorphisms in terms of state spaces for various tensor products of canonically associated operator systems. We then apply these results to the study of synchronous non-local games, defining jointly synchronous correlations and showing how they correspond to tracial states of tensor products of C*-algebras canonically associated to each game party. ☐ We then move to a second level of quantization by proposing a "quantized" notion of hypergraphs (where "quantum" here is in the sense of a non-commutative analogue for a discrete combinatorial object), and introduce quantum homomorphisms between these quantum objects. We provide an initial foray into the properties quantum morphisms between quantum hypergraphs display, showing they satisfy analogous properties to quantum homomorphisms between classical hypergraphs. We also indicate initial connections these quantum homomorphisms between quantum hypergraphs have to the study of quantum input-output games. We end the thesis showing that homomorphisms of a local type between quantum hypergraphs is closely related, and in some cases identical, to the TRO equivalence of finite-dimensionally acting operator spaces canonically associated with each hypergraph. This suggests a quantum information theoretic approach to Morita equivalence in the category of operator spaces.
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.
Abstract We introduce and examine three subclasses of the family of quantum no-signalling (QNS) correlations introduced by Duan and Winter: quantum commuting, quantum and local. We formalise the notion of a universal TRO of a block operator isometry, define an operator system, universal for stochastic operator matrices, and realise it as a quotient of a matrix algebra. We describe the classes of QNS correlations in terms of states on the tensor products of two copies of the universal operator system and specialise the correlation classes and their representations to classical-to-quantum correlations. We study various quantum versions of synchronous no-signalling correlations and show that they possess invariance properties for suitable sets of states. We introduce quantum non-local games as a generalisation of non-local games. We define the operation of quantum game composition and show that the perfect strategies belonging to a certain class are closed under channel composition. We specialise to the case of graph colourings, where we exhibit quantum versions of the orthogonal rank of a graph as the optimal output dimension for which perfect classical-to-quantum strategies of the graph colouring game exist, as well as to non-commutative graph homomorphisms, where we identify quantum versions of non-commutative graph homomorphisms introduced by Stahlke.
Non-locality and contextuality are key features of quantum mechanics that distinguish it from classical physics. We aim to develop a deeper, more structural understanding of these phenomena, underpinned by robust and elegant mathematical theory with a view to providing clarity and new perspectives on conceptual and foundational issues. A general framework for logical non-locality is introduced and used to prove that 'Hardy's paradox' is complete for logical non-locality in all (2,2,l) and (2,k,2) Bell scenarios, a consequence of which is that Bell states are the only entangled two-qubit states that are not logically non-local, and that Hardy non-locality can be witnessed with certainty in a tripartite quantum system. A number of developments of the unified sheaf-theoretic approach to non-locality and contextuality are considered, including the first application of cohomology as a tool for studying the phenomena: we find cohomological witnesses corresponding to many of the classic no-go results, and completely characterise contextuality for large families of Kochen-Specker-like models. A connection with the problem of the existence of perfect matchings in k-uniform hypergraphs is explored, leading to new results on the complexity of deciding contextuality. A refinement of the sheaf-theoretic approach is found that captures partial approximations to locality/non-contextuality and can allow Bell models to be constructed from models of more general kinds which are equivalent in terms of non-locality/contextuality. Progress is made on bringing recent results on the nature of the wavefunction within the scope of the logical and sheaf-theoretic methods. Computational tools are developed for quantifying contextuality and finding generalised Bell inequalities for any measurement scenario which complement the research programme. This also leads to a proof that local ontological models with `negative probabilities' generate the no-signalling polytopes for all Bell scenarios.
A finite hypergraph H consists of a finite set of vertices V(H) and a collection of subsets E(H)⊆2V(H) which we consider as partition of unity relations between projection operators. These partition of unity relations freely generate a universal C*-algebra, which we call the "free hypergraph C*-algebra" C∗(H). General free hypergraph C*-algebras were first studied in the context of quantum contextuality. As special cases, the class of free hypergraph C*-algebras comprises quantum permutation groups, maximal group C*-algebras of graph products of finite cyclic groups, and the C*-algebras associated to quantum graph homomorphism, isomorphism, and colouring. Here, we conduct the first systematic study of aspects of free hypergraph C*-algebras. We show that they coincide with the class of finite colimits of finite-dimensional commutative C*-algebras, and also with the class of C*-algebras associated to synchronous nonlocal games. We had previously shown that it is undecidable to determine whether C∗(H) is nonzero for given H. We now show that it is also undecidable to determine whether a given C∗(H) is residually finite-dimensional, and similarly whether it only has infinite-dimensional representations, and whether it has a tracial state. It follows that for each one of these properties, there is H such that the question whether C∗(H) has this property is independent of the ZFC axioms, assuming that these are consistent. We clarify some of the subtleties associated with such independence results in an appendix.
The presence of contextuality in quantum theory was first highlighted by Bell, Kochen and Specker, who discovered that for quantum systems of three or more dimensions, measurements could not be viewed as deterministically revealing pre-existing properties of the system. More precisely, no model can assign deterministic outcomes to the projectors of a quantum measurement in a way that depends only on the projector and not the context (the full set of projectors) in which it appeared, despite the fact that the Born rule probabilities associated with projectors are independent of the context. A more general, operational definition of contextuality introduced by Spekkens, which we will term 'probabilistic contextuality', drops the assumption of determinism and allows for operations other than measurements to be considered contextual. Even two-dimensional quantum mechanics can be shown to be contextual under this generalised notion. Probabilistic noncontextuality represents the postulate that elements of an operational theory that cannot be distinguished from each other based on the statistics of arbitrarily many repeated experiments (they give rise to the same operational probabilities) are ontologically identical. In this paper, we introduce a framework that enables us to distinguish between different noncontextuality assumptions in terms of the relationships between the ontological representations of objects in the theory given a certain relation between their operational representations. This framework can be used to motivate and define a 'possibilistic' analogue, encapsulating the idea that elements of an operational theory that cannot be unambiguously distinguished operationally can also not be unambiguously distinguished ontologically. We then prove that possibilistic noncontextuality is equivalent to an alternative notion of noncontextuality proposed by Hardy. Finally, we demonstrate that these weaker noncontextuality assumptions are sufficient to prove alternative versions of known 'no-go' theorems that constrain ψ -epistemic models for quantum mechanics.