Related papers: Entangled games do not require much entanglement (…
Entanglement is of paramount importance in quantum information theory. Its supremacy over classical correlations has been demonstrated in numerous information theoretic protocols. Here we study possible adequacy of quantum entanglement in…
A version of the Monty Hall problem is presented where the players are permitted to select quantum strategies. If the initial state involves no entanglement the Nash equilibrium in the quantum game offers the players nothing more than can…
We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol, when played repeatedly ad infinitum. We focus on establishing that such repeated games -- by virtue of inherent quantum-mechanical…
We show a communication complexity lower bound for finding a correlated equilibrium of a two-player game. More precisely, we define a two-player $N \times N$ game called the 2-cycle game and show that the randomized communication complexity…
What happens when an infinite number of players play a quantum game? In this tutorial, we will answer this question by looking at the emergence of cooperation, in the presence of noise, in a one-shot quantum Prisoner's dilemma (QuPD). We…
A contemporary technological milestone is to build a quantum device performing a computational task beyond the capability of any classical computer, an achievement known as quantum adversarial advantage. In what ways can the entanglement…
The optimal coordination rates are determined in three primary settings of multi-user quantum networks, thus characterizing the minimal resources required in order to simulate a joint quantum state among multiple parties. We study the…
A pure multipartite quantum state is called absolutely maximally entangled if all reductions of no more than half of the parties are maximally mixed. However, an $n$-qubit absolutely maximally entangled state only exists when $n$ equals…
In this paper, the following scenario is considered: there are two qubits possessed by two parties at different locations. Qubits have been prepared in one of a maximum of four, mutually-orthogonal, entangled states and the parties wish to…
We investigate the computation of equilibria in extensive-form games where ex ante correlation is possible, focusing on correlated equilibria requiring the least amount of communication between the players and the mediator. Motivated by the…
We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). We introduce these basic ideas in the context of a simple example, closely…
We quantise the generalised Hawk-Dove Game. By restricting the strategy space available to the players, we show that every game of this type can be extended into the quantum realm to produce a Pareto optimal evolutionarily stable strategy.…
We show that the value of a general two-prover quantum game cannot be computed by a semi-definite program ofvpolynomial size (unless P=NP), a method that has been successful in more restricted quantum games. More precisely, we show that…
We present relation problems whose input size is $n$ such that they can be solved with no communication for entanglement-assisted quantum communication models, but require $\Omega(n)$ qubit communication for $2$-way quantum communication…
The phenomenon of quantum entanglement is fundamental to the implementation of quantum computation, and requires at least two qubits for its demonstration. However, both Deutsch algorithm and Grover's search algorithm for two bits do not…
We consider the clock game-a task formulated in the framework of quantum information theory-that can be used to improve the existing schemes of quantum-enhanced telescopy. The problem of learning when a stellar photon reaches a telescope is…
The Eisert et al. maximally entangled quantum game is studied within the framework of (elementary) group theory. It is shown that the game can be described in terms of real Hilbert space of states. It is also shown that the crucial…
We present a one-shot method for preparing pure entangled states between a sender and a receiver at a minimal cost of entanglement and quantum communication. In the case of preparing unentangled states, an earlier paper showed that a…
A necessary condition of the maximally multipartite entangled states (MMES) is given via n-tangle. The condition shows that the n-tangle equal zero for the four-, and eight-qubit of MMESs and the n-tangle equal 1 for two- and six- qubits of…
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…