Related papers: Exploiting Finite Geometries for Better Quantum Ad…
In these lecture notes we investigate the implications of the identification of strategies with quantum operations in game theory beyond the results presented in [J. Eisert, M. Wilkens, and M. Lewenstein, Phys. Rev. Lett. 83, 3077 (1999)].…
Quantum advantage in computation refers to the existence of computational tasks that can be performed efficiently on a quantum computer but cannot be efficiently simulated on any classical computer. Identifying the precise boundary of…
Main papers on quantum games are written by physicists for physicists, and the inevitable exploitation of physics jargon may create difficulties for mathematicians or economists. Our goal here is to make clear the physical content and to…
Attention to the very physical aspects of information characterizes the current research in quantum computation, quantum cryptography and quantum communication. In most of the cases quantum description of the system provides advantages over…
The optimal success probability of a communication game sets fundamental limitations on an operational theory. Quantum advantage of parity oblivious random access code (PORAC), a communication game, over classical resources reveals the…
The complexity of free games with two or more classical players was essentially settled by Aaronson, Impagliazzo, and Moshkovitz (CCC'14). There are two complexity classes that can be considered quantum analogues of classical free games:…
The recent debate on hyper-computation has raised new questions both on the computational abilities of quantum systems and the Church-Turing Thesis role in Physics. We propose here the idea of geometry of effective physical process as the…
The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive…
We show a general method of compiling any $k$-prover non-local game into a single-prover interactive game maintaining the same (quantum) completeness and (classical) soundness guarantees (up to negligible additive factors in a security…
We analyze the necessary physical conditions to model an open quantum system as a quantum game. By applying the formalism of Quantum Operations on a particular system, we use Kraus operators as quantum strategies. The physical…
Nonlocal games provide a unified framework for studying the distinction between classical, quantum, and more general no-signaling correlations. In this work, we develop this perspective by connecting the Bell-locality framework to several…
We consider $N$-player games, in continuous time, finite state space and finite time horizon, on a geometrical structure possessing a macroscopic limit in a suitable sense. This geometrical structure breaks the permutation invariance…
We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable…
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 study the scenario where the players of a classical complete information game initially share an entangled pure quantum state. Each player may perform arbitrary local operations on his own qubits, but no direct communication is allowed.…
Communication games are crucial tools for investigating the limitations of physical theories. The communication complexity (CC) problem is a typical example, for which several distributed parties attempt to jointly calculate a given…
We study two forms of a symmetric cooperative game played by three players, one classical and other quantum. In its classical form making a coalition gives advantage to players and they are motivated to do so. However in its quantum form…
We use the standard three-party Einstein-Podolsky-Rosen (EPR) setting in order to play general three-player non-cooperative symmetric games. We analyze how the peculiar non-factorizable joint probabilities that may emerge in the EPR setting…
It is by now well-established that there exist non-local games for which the best entanglement-assisted performance is not better than the best classical performance. Here we show in contrast that any two-player XOR game, for which the…
We present a device independent quantum secret sharing scheme in arbitrary even dimension. We propose a $d$-dimensional $N$-partite linear game, utilizing a generic multipartite higher dimensional Bell inequality, a generalization of…