We develop a resource-theoretical approach that allows us to quantify values of two-player, one-round cooperative games with quantum inputs and outputs, as well as values of quantum probabilistic hypergraphs. We analyse the quantum game values arising from the type hierarchy of quantum no-signalling correlations, establishing tensor norm expressions for each of the correlation types. As a consequence, we provide metric characterisations of state convertibility via LOSR and LOCC.En route, we obtain an alternative description of the maximal tensor products of ternary rings of operators.
We develop a resource-theoretical approach that allows us to quantify values of two-player, one-round cooperative games with quantum inputs and outputs, as well as values of quantum probabilistic hypergraphs. We analyse the quantum game values arising from the type hierarchy of quantum no-signalling correlations, establishing tensor norm expressions for each of the correlation types. As a consequence, we provide metric characterisations of state convertibility via LOSR and LOCC.En route, we obtain an alternative description of the maximal tensor products of ternary rings of operators.
The aim of this work is to study two-prover quantum games (i.e., games with quantum inputs and outputs) from an operator-algebraic and operator-space point of view. We characterize several notions of the value of such games by formulating them in terms of tensor norms in the category of operator spaces. The main results of the paper concern the description of the so-called no-signalling value of these games, for which we not only provide a precise operator-space formulation, but also establish close connections between this study and some problems in operator algebras. In particular, we show how the recent counterexample to Grothendieck's theorem for operator spaces given in \cite{Ara} can be understood as a direct consequence of results in quantum information theory. We also obtain new upper bounds on the gap between the no-signalling value and the quantum value of two-prover quantum games, improving the best previously known estimates.
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 develop a method for the transfer of perfect strategies between various classes of two-player, one round cooperative non-local games with quantum inputs and outputs using the simulation paradigm in quantum information theory. We show that such a transfer is possible when canonically associated operator spaces for each game are quantum homomorphic or isomorphic, as defined in the joint work of H. and Todorov (2024). We examine a new class of QNS correlations, needed for the transfer of strategies between games, and characterize them in terms of states on tensor products of canonical operator systems. We define jointly tracial correlations and show they correspond to traces acting on tensor products of canonical C∗-algebras associated with individual game parties. We then make an inquiry into the initial application of such results to the study of concurrent quantum games.
Quantum non-local games with quantum inputs or outputs have been formulated in several different languages, including rank-one and quantum XOR games, support maps between projection lattices, probabilistic quantum hypergraphs, and Frobenius-algebraic rule operators on finite quantum sets. We give a unified operator-algebraic comparison of these models by assigning to each rule its winning transformation space: the operator space of transformations accepted with certainty. We introduce R-projection-test quantum games with finite-dimensional input and output von Neumann algebras and an arbitrary, possibly infinite-dimensional, referee von Neumann algebra R. Their winning transformation spaces are precisely operator spaces with a natural bimodule structure, equivalently rectangular quantum relations. We compare this formalism with projection-lattice games, hypergraph quantum games, and the graphical rule-operator definition. Projection-lattice games capture exactly the reflexive winning bimodules. Hypergraph quantum games admit value-preserving projection-test realisations, and, after passing to perfect transformations, describe the same reflexive part as projection-lattice games. Using Daws' technique, we also translate rule operators to projections in tensor products of finite-dimensional von Neumann algebras. This identification places graphical rules in the same operator-bimodule framework and preserves both values and perfectness. Finally, we compare concurrency with the synchronicity conditions of Goldberg and of Bochniak--Kasprzak--Sołtan. The framework is illustrated by classical, rank-one, quantum XOR, colouring, and quantum graph homomorphism and isomorphism games.
Abstract We study properties of quantum strategies, which are complete specifications of a givenparty's actions in any multiple-round interaction involving the exchange of quantum information with one or more other parties. In particular, we focus on a representation of quantumstrategies that generalizes the Choi-Jamiol/kowski representation of quantum operations. This new representation associates with each strategy a positive semidefinite operator acting onlyon the tensor product of its input and output spaces. Various facts about such representations are established, and two applications are discussed: the first is a new and conceptually simpleproof of Kitaev's lower bound for strong coin-flipping, and the second is a proof of the exact characterization QRG = EXP of the class of problems having quantum refereed games. 1 Introduction The theory of games provides a general structure within which both cooperation and competitionamong independent entities may be modeled, and provides powerful tools for analyzing these models. Applications of this theory have fundamental importance in many areas of science.This paper considers games in which the players may exchange and process quantum information. We focus on competitive games, and within this context the types of games we consider arevery general. For instance, they allow multiple rounds of interaction among the players involved, and place no restrictions on players ' strategies beyond those imposed by the theory of quantuminformation. While classical games can be viewed as a special case of quantum games, it is important tostress that there are fundamental differences between general quantum games and classical games. For example, the two most standard representations of classical games, namely the normal formand extensive form representations, are not directly applicable to general quantum games. This is due to the nature of quantum information, which admits a continuum of pure (meaning extremal)
We study no-signalling correlations over Cantor spaces, placing the product of infinitely many copies of a finite non-local game in a unified general setup. We define the subclasses of local, quantum spatial, approximately quantum and quantum commuting Cantor correlations and describe them in terms of states on tensor products of inductive limits of operator systems. We provide a correspondence between no-signalling (resp. approximately quantum, quantum commuting) Cantor correlations and sequences of correlations of the same type over the projections onto increasing number of finitely many coordinates. We introduce Cantor games, and associate canonically such a game to a sequence of finite input/output games, showing that the numerical sequence of the values of the games in the sequence converges to the corresponding value of the compound Cantor game.