Related papers: Unbounded entanglement in nonlocal games

Effects of quantum and classical correlations on game theory are studied to clarify the new aspects brought into game theory by the quantum mechanical toolbox. In this study, we compare quantum correlation represented by a maximally…

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…

For many applications the presence of a quantum advantage crucially depends on the availability of resourceful states. Although the resource typically depends on the particular task, in the context of multipartite systems entangled quantum…

We prove an upper bound on the maximal rate at which a Hamiltonian interaction can generate entanglement in a bipartite system. The scaling of this bound as a function of the subsystem dimension on which the Hamiltonian acts nontrivially is…

We use the example of playing a 2-player game with entangled quantum objects to investigate the effect of quantum correlation. We find that for simple game scenarios it is classical correlation that is the central feature and that these…

We present a method of optimizing recently designed protocols for implementing an arbitrary nonlocal unitary gate acting on a bipartite system. These protocols use only local operations and classical communication with the assistance of…

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…

Here we deal with a nonlocality argument proposed by Cabello which is more general than Hardy's nonlocality argument but still maximally entangled states do not respond. However, for most of the other entangled states maximum probability of…

Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, single round quantum games or at most finitely repeated games have been widely studied, however…

A preparation game is a task whereby a player sequentially sends a number of quantum states to a referee, who probes each of them and announces the measurement result. The measurement setting in each round, as well as the final score of the…

Quantum key distribution (QKD) refers to specific quantum strategies which permit the secure distribution of a secret key between two parties that wish to communicate secretly. Quantum cryptography has proven unconditionally secure in ideal…

We consider a variation of the multi-party communication complexity scenario where the parties are supplied with an extra resource: particles in an entangled quantum state. We show that, although a prior quantum entanglement cannot be used…

We study the quantum moment problem: Given a conditional probability distribution together with some polynomial constraints, does there exist a quantum state rho and a collection of measurement operators such that (i) the probability of…

Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…

Entanglement distribution is essential for unlocking the potential of distributed quantum information processing. We consider an $N$-partite network where entanglement is distributed via a central source over lossy channels, and network…

We consider 2-player games played on a finite state space for infinite rounds. The games are concurrent: in each round, the two players choose their moves simultaneously; the current state and the moves determine the successor. We consider…

The recognition of entanglement states is a notoriously difficult problem when no prior information is available. Here, we propose an efficient quantum adversarial bipartite entanglement detection scheme to address this issue. Our proposal…

Quantum discord has been utilised in order to find quantum advantage in an extension of the Clauser, Horne, Shimony, and Holt (CHSH) game. By writing the game explicitly as a Bayesian game, the resulting game is modified such the payoff's…

We bound separations between the entangled and classical values for several classes of nonlocal $t$-player games. Our motivating question is whether there is a family of $t$-player XOR games for which the entangled bias is $1$ but for which…

We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are `unique' constraints (i.e., permutations), the value of the game can be well…