Related papers: Quantum Checkers: The Development and Analysis of …
This paper contributes a new way to evaluate AI. Much as one might evaluate a machine in terms of its performance at chess, this approach involves evaluating a machine in terms of its performance at a game called "MAD Chairs". At the time…
This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The extra group structure makes possible to easily derive some very general results characterizing…
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…
A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of the graph coloring problem. It performs…
We investigate the quantization of non-zero sum games. For the particular case of the Prisoners' Dilemma we show that this game ceases to pose a dilemma if quantum strategies are allowed for. We also construct a particular quantum strategy…
Matching games naturally generalize assignment games, a well-known class of cooperative games. Interest in matching games has grown recently due to some breakthrough results and new applications. This state-of-the-art survey provides an…
We introduce a quantum version of the Game of Life and we use it to study the emergence of complexity in a quantum world. We show that the quantum evolution displays signatures of complex behaviour similar to the classical one, however a…
We consider an application of the mathematical formalism of quantum mechanics (QM) outside physics, namely, to game theory. We present a simple game between macroscopic players, say Alice and Bob (or in a more complex form - Alice, Bob and…
In this paper, we explore Quantum Game Jam (QGJ) as a method for facilitating interdisciplinary collaboration and creating science game prototypes. QGJ was a series of game development events, science game jams, organized five times…
This paper is concerned with complexity theoretic aspects of a general formulation of quantum game theory that models strategic interactions among rational agents that process and exchange quantum information. In particular, we prove that…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
The concept of forming harmonious coalitions is introduced to both classical and quantum symmetric cooperative game. In both cases, players are motivated to form coalitions. Also, the main feature of the cooperative game is conserved.
A simple and general formulation of the quantum game theory is presented, accommodating all possible strategies in the Hilbert space for the first time. The theory is solvable for the two strategy quantum game, which is shown to be…
We introduce a quantum cloning game in which $k$ separate collaborative parties receive a classical input, determining which of them has to share a maximally entangled state with an additional party (referee). We provide the optimal winning…
We present a proposal for optically implementing the quantum game of the two-player quantum prisoner's dilemma involving nonmaximally entangled states by using beam splitters, phase shifters, cross-Kerr medium, photon detector and the…
The aim of this paper is to bring together the notions of quantum game and game isomorphism. The work is intended as an attempt to introduce a new criterion for quantum game schemes. The generally accepted requirement forces a quantum…
The quest of this work is to present discussions of some fundamental questions of economics in the era of quantum technology, which require a treatment different from economics studied thus far in the literature. A study of quantum economic…
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large…
A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of…