Related papers: Morphisms in categories of nonlocal games
Using the simulation paradigm in information theory, we define notions of quantum hypergraph homomorphisms and quantum hypergraph isomorphisms, and show that they constitute partial orders and equivalence relations, respectively.…
We introduce concurrent quantum non-local games, quantum output mirror games and concurrent classical-to-quantum non-local games, as quantum versions of synchronous non-local games, and provide tracial characterisations of their perfect…
We introduce a new class of non-local games, and corresponding densities, which we call bisynchronous. Bisynchronous games are a subclass of synchronous games and exhibit many interesting symmetries when the algebra of the game is…
Synchronous linear constraint system games are nonlocal games that verify whether or not two players share a solution to a given system of equations. Two algebraic objects associated to these games encode information about the existence of…
In the flavour of categorical quantum mechanics, we extend nonlocal games to allow quantum questions and answers, using quantum sets (special symmetric dagger Frobenius algebras) and the quantum functions of Musto, Reutter, and Verdon…
We define a notion of morphisms between open games, exploiting a surprising connection between lenses in computer science and compositional game theory. This extends the more intuitively obvious definition of globular morphisms as mappings…
Categories of polymorphic lenses in computer science, and of open games in compositional game theory, have a curious structure that is reminiscent of compact closed categories, but differs in some crucial ways. Specifically they have a…
Morphisms are homomorphisms under the concatenation operation of the set of words over a finite set. Changing the elements of the finite set does not essentially change the morphism. We propose a way to select a unique representing member…
Morphisms between (formal) contexts are certain pairs of maps, one between objects and one between attributes of the contexts in question. We study several classes of such morphisms and the connections between them. Among other things, we…
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as games on which proofs induce strategies. We are specifically…
We show that the C*-algebras associated with synchronous games give rise to certain quantum families of maps between the input and output sets of the game. In particular situations (e.g. for graph endomorphism games) these quantum families…
Morphic sequences form a natural class of infinite sequences, extending the well-studied class of automatic sequences. Where automatic sequences are known to have several equivalent characterizations and the class of automatic sequences is…
We address the question of when quantum entanglement is a useful resource for information processing tasks by presenting a new class of nonlocal games that are simple, direct, generalizations of the Clauser Horne Shimony Holt game. For some…
Symmetries and isomorphisms play similar conceptual roles when we consider how models represent physical situations, but they are formally distinct, as two models related by symmetries are not typically isomorphic. I offer a rigorous…
Game-theoretic characterizations of process equivalences traditionally form a central topic in concurrency; for example, most equivalences on the classical linear-time / branching-time spectrum come with such characterizations. Recent work…
Many theories of physical interest, which admit a Hamiltonian description, exhibit symmetries under a particular class of non - strictly canonical transformation, known as dynamical similarities. The presence of such symmetries allows a…
We study a class of nonlocal games, called transitive games, for which the set of perfect strategies forms a semigroup. We establish several interesting correspondences of bisynchronous transitive games with the theory of compact quantum…
This paper develops the category $\mathbf{NCG}$. Its objects are node-and-choice games, which include essentially all extensive-form games. Its morphisms allow arbitrary transformations of a game's nodes, choices, and players, as well as…
Categorical quantum mechanics, which examines quantum theory via dagger-compact closed categories, gives satisfying high-level explanations to the quantum information procedures such as Bell-type entanglement or complementary observables…
We present a family of nonlocal games in which the inputs the players receive are continuous. We study three representative members of the family. For the first two a team sharing quantum correlations (entanglement) has an advantage over…