Related papers: Noisy non-transitive quantum games

We present a formalism that captures the process of proving quantum superiority to skeptics as an interactive game between two agents, supervised by a referee. Bob, is sampling from a classical distribution on a quantum device that is…

In a two-person Rock-Paper-Scissors (RPS) game, if we set a loss worth nothing and a tie worth 1, and the payoff of winning (the incentive a) as a variable, this game is called as generalized RPS game. The generalized RPS game is a…

We consider a variation of the well-studied quantum state redistribution task, in which the starting state is known only to the receiver Bob and not to the sender Alice. We refer to this as quantum state redistribution with a one-sided…

We are considering a quantum version of the penny flip game, whose implementation is influenced by the environment that causes decoherence of the system. In order to model the decoherence we assume Markovian approximation of open quantum…

Connecting quantum computers to a quantum network opens a wide array of new applications, such as securely performing computations on distributed data sets. Near-term quantum networks are noisy, however, and hence correctness and security…

A quantum version of the Monty Hall problem is proposed inspired by an experimentally-feasible, quantum-optical set-up that resembles the classical game. The expected payoff of the player is studied by analyzing the classical expectation…

We analyse two party non-local games whose predicate requires Alice and Bob to generate matching bits, and their three party extensions where a third player receives all inputs and is required to output a bit that matches that of the…

Analyzing the impact of noise is of fundamental importance to understand the advantages provided by quantum systems. While the classical simulability of noisy discrete-variable systems is increasingly well understood, noisy bosonic circuits…

We present a quantization scheme for a three-player Prisoner's Dilemma game. It is shown that entanglement plays a dominant role in the three-player quantum game. Four different types of payoffs are identified on the basis of different…

This paper considers the decidability of fully quantum nonlocal games with noisy maximally entangled states. Fully quantum nonlocal games are a generalization of nonlocal games, where both questions and answers are quantum and the referee…

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…

A fundamental limitation of quantum communication is that a single qubit can carry at most 1 bit of classical information. For an important class of quantum communication channels, known as entanglement-breaking, this limitation holds even…

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 introduce a notion of expected utility for quantum tasks and discuss some general conditions under which this is increased by the presence of quantum noise in the underlying resource states. We apply the resulting formalism to the…

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…

This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal games where strategies that make use of entanglement…

Magic states are essential for universal quantum computation and are widely viewed as a key source of quantum advantage, yet in realistic devices they are inevitably noisy. In this work, we characterize how noise on injected magic resources…

This paper introduces two information-theoretically secure protocols that achieve quantum secure direct communication between Alice and Bob in the first case, and among Alice, Bod and Charlie in the second case. Both protocols use the same…

We study stochastic effects on the lagging anchor dynamics, a reinforcement learning algorithm used to learn successful strategies in iterated games, which is known to converge to Nash points in the absence of noise. The dynamics is…

A notion of asymmetric quantum dialogue (AQD) is introduced. Conventional protocols of quantum dialogue are essentially symmetric as both the users (Alice and Bob) can encode the same amount of classical information. In contrast, the scheme…