Related papers: Mini-maximizing two qubit quantum computations
We present multilinear and mixed-integer multilinear programs to find a Nash equilibrium in multi-player noncooperative games. We compare the formulations to common algorithms in Gambit, and conclude that a multilinear feasibility program…
We improve the upper bound on the minimal resources required for measurement-based quantum computation. Minimizing the resources required for this model is a key issue for experimental realization of a quantum computer based on projective…
We investigate Nash Equilibrium in the quantum Battle of Sexes Game. We find the game has infinite Nash Equilibria and all of them leads to the asymmetry result. We also show that there is no unique but infinite Nash Equilibrium in it if we…
We study a quantum game played by two players with restricted multiple strategies. It is found that in this restricted quantum game Nash equilibrium does not always exist when the initial state is entangled. At the same time, we find that…
Theory of quantum games is a new area of investigation that has gone through rapid development during the last few years. Initial motivation for playing games, in the quantum world, comes from the possibility of re-formulating quantum…
We suggest to look at quantum measurement outcomes not through the lens of probability theory, but instead through decision theory. We introduce an original game-theoretical framework, model and algorithmic procedure where measurement…
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-player, normal-form games can be computed in polynomial time…
We derive sublinear-time quantum algorithms for computing the Nash equilibrium of two-player zero-sum games, based on efficient Gibbs sampling methods. We are able to achieve speed-ups for both dense and sparse payoff matrices at the cost…
Current fault-tolerant quantum compilers allocate error budgets uniformly during resource estimation, causing suboptimal physical resource overhead. We optimize this allocation using a potential game formulation, where Nash Equilibrium…
The theory of quantum games permits players to choose strategies that prepare and measure quantum states. Whereas conventional game theory provides guarantees for fixed-point stability in non-cooperative games, so-called Nash equilibria, we…
The primary resource for quantum computation is Hilbert-space dimension. Whereas Hilbert space itself is an abstract construction, the number of dimensions available to a system is a physical quantity that requires physical resources.…
The $N$-player quantum game is analyzed in the context of an Einstein-Podolsky-Rosen (EPR) experiment. In this setting, a player's strategies are not unitary transformations as in alternate quantum game-theoretic frameworks, but a classical…
We build new quantum games, similar to the spin flip game, where as a novelty the players perform measurements on a quantum system associated to a continuous time search algorithm. The measurements collapse the wave function into one of the…
Quantum game theory has emerged as a promising candidate to further the understanding of quantum correlations. Motivated by this, it is demonstrated that pure strategy Nash equilibria can be utilised as a mechanism to witness and determine…
The two-players $N$ strategies games quantized according to the Eisert-Lewenstein-Wilkens scheme (Phys. Rev. Lett. 83 (1999), 3077) are considered. Group theoretical methods are applied to the problem of finding a general form of gate…
We propose a simple yet rich model to extend the notions of Nash equilibria and correlated equilibria of strategic games to the quantum setting, in which we then study the relations between classical and quantum equilibria. Unlike the…
We introduce Q-Nash, a quantum annealing algorithm for the NP-complete problem of Fnding pure Nash equilibria in graphical games. The algorithm consists of two phases. The first phase determines all combinations of best response strategies…
We develop an octonionic representation of the payoff function for three player, two strategy, maximally entangled quantum games in order to obtain computationally friendly version of this function. This computational capability is then…
Contemporary applications of machine learning in two-team e-sports and the superior expressivity of multi-agent generative adversarial networks raise important and overlooked theoretical questions regarding optimization in two-team games.…
Game theory is the mathematical framework for analyzing strategic interactions in conflict and competition situations. In recent years quantum game theory has earned the attention of physicists, and has emerged as a branch of quantum…