相关论文: Tsirelson's problem and an embedding theorem for g…
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…
We investigate uniformity properties of strategies. These properties involve sets of plays in order to express useful constraints on strategies that are not \mu-calculus definable. Typically, we can state that a strategy is…
In the context of finite tensor products of Hilbert spaces, we prove that similarity of a tensor product of operator semigroups to a contraction semigroup is equivalent to the corresponding similarity for each factor, after an appropriate…
Coordination games with explicit spatial or relational structure are of interest to economists, ecologists, sociologists, and others studying emergent global properties in collective behavior. When assemblies of individuals seek to…
General tradeoff relations present in nonlocal correlations of bipartite systems are studied, regardless of any specific quantum states and measuring directions. Extensions to multipartite scenarios are possible and very promising.…
We describe a two-player non-local game, with a fixed small number of questions and answers, such that an $\epsilon$-close to optimal strategy requires an entangled state of dimension $2^{\Omega(\epsilon^{-1/8})}$. Our non-local game is…
Computational advertising has been studied to design efficient marketing strategies that maximize the number of acquired customers. In an increased competitive market, however, a market leader (a leader) requires the acquisition of new…
The model of local Turing machines is introduced, including classical and quantum ones, in the framework of matrix-product states. The locality refers to the fact that at any instance of the computation the heads of a Turing machine have…
The $C^{\ast}$-algebra $\mathcal{U}_{nc}(n)$ is the universal $C^{\ast}$-algebra generated by $n^2$ generators $u_{ij}$ that make up a unitary matrix. We prove that Kirchberg's formulation of Connes' embedding problem has a positive answer…
This work presents a tensor-network formulation of the Traveling Salesman Problem (TSP) and several of its variants. The approach represents candidate tours with tensor-network layers, weights them by Boltzmann factors, and enforces…
By using a correlated projection operator, the time-convolutionless (TCL) method to derive a quantum master equation can be utilized to investigate the transport behavior of quantum systems as well. Here, we analyze a three-dimensional…
We show that certain ways of solving some combinatorial optimization problems can be understood as using query planes to divide the space of problem instances into polyhedra that could fit into those that characterize the problem's various…
Entanglement properties of driven quantum systems can potentially differ from the equilibrium situation due to long range coherences. We confirm this observation by studying a suitable toy model for mesoscopic transport~: the open quantum…
The use of game theoretic models has been quite successful in describing various cooperative and non-cooperative optimization problems in networks and other domains of computer systems. In this paper, we study an application of game…
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish things that the individual agents cannot, or can do things more…
The Prisoners' Dilemma is perhaps the most famous model in the field of game theory. Consequently, it is natural to investigate its quantum version when one considers to apply quantum strategies to game theory. There are two main results in…
For a bi-partite quantum system defined in a finite dimensional Hilbert space we investigate in what sense entanglement change and interactions imply each other. For this purpose we introduce an entanglement operator, which is then shown to…
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…
In this paper we establish strong embedding theorems, in the sense of the Komlos-Major-Tusnady framework, for the performance metrics of a general class of transitory queueing models of nonstationary queueing systems. The nonstationary and…
We show that the *-algebra of the product of two synchronous games is the tensor product of the corresponding *-algebras. We prove that the product game has a perfect C*-strategy if and only if each of the individual games does, and that in…