Related papers: A new model for quantum games based on the Marinat…
Enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum game with the problem of data clustering, and then develop a quantum-game-based clustering algorithm, in which data points…
We study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap Nim games. In quantum game theory, a subset of Subtraction…
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…
We consider a class of games between two competing players that take turns acting on the same many-body quantum register. Each player can perform unitary operations on the register, and after each one of them acts on the register the energy…
In this paper, we study the problem of learning in quantum games - and other classes of semidefinite games - with scalar, payoff-based feedback. For concreteness, we focus on the widely used matrix multiplicative weights (MMW) algorithm…
In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff. A combinatorial game is a two-player game with no chance and no hidden information, such as Go or Chess. In…
An increasing number of communication and computational schemes with quantum advantages have recently been proposed, which implies that quantum technology has fertile application prospects. However, demonstrating these schemes…
Quantum state targeting is a quantum game which results from combining traditional quantum state estimation with additional classical information. We consider a particular version of the game and show how it can be played with maximally…
Game theory is a well established branch of mathematics whose formalism has a vast range of applications from the social sciences, biology, to economics. Motivated by quantum information science, there has been a leap in the formulation of…
We propose the use of a quantum algorithm to deal with the problem of searching with errors in the framework of two-person games. Specifically, we present a solution to the Ulam's problem that polynomially reduces its query complexity and…
Quantum pseudotelepathy is a strong form of nonlocality. Different from the conventional non-local games where quantum strategies win statistically, e.g., the Clauser-Horne-Shimony-Holt game, quantum pseudotelepathy in principle allows…
We study a general $2 \times 2$ symmetric, entangled, quantum game. When one player has access only to classical strategies while the other can use the full range of quantum strategies, there are ``miracle'' moves available to the quantum…
The behavior of entangled quantum systems can generally not be explained as being determined by shared classical randomness. In the first part of this paper, we propose a simple game for n players demonstrating this non-local property of…
The Fermi-Hubbard model, a fundamental framework for studying strongly correlated phenomena could significantly benefit from quantum simulations when exploring non-trivial settings. However, simulating this problem requires twice as many…
I give an analysis of the simplest non-commutative quantum game, which is a gambling game much like Heads or Tails. The quantum gamespace displays strategies which are not interpretable through direct-product strategies of the two players.…
We present a new form of a Parrondo game using discrete-time quantum walk on a line. The two players A and B with different quantum coins operators, individually losing the game can develop a strategy to emerge as joint winners by using…
This paper develops and analyses a novel quantum combinatorial game: quantum checkers (codenamed Cheqqers). The concepts of superposition, entanglement, measurements and interference from quantum mechanics are integrated into the game of…
Quantum computers leverage the principles of quantum mechanics to do computation with a potential advantage over classical computers. While a single classical computer transforms one particular binary input into an output after applying one…
We show that given an explicit description of a multiplayer game, with a classical verifier and a constant number of players, it is QMA-hard, under randomized reductions, to distinguish between the cases when the players have a strategy…
Using the representation introduced in \cite{frame}, an artificial game in quantum strategy space is proposed and studied. Although it has well-known classical correspondence, which has classical mixture strategy Nash Equilibrium states,…