Related papers: Playing Quantum Monty Hall Game in a Quantum Compu…
In this paper, we propose a method of enciphering quantum states of two-state systems (qubits) for sending them in secrecy without entangled qubits shared by two legitimate users (Alice and Bob). This method has the following two…
We investigate a game where a sender (Alice) teleports coherent states to two receivers (Bob and Charlie) through a tripartite Gaussian state. The aim of the receivers is to optimize their teleportation fidelities by means of local…
A locking protocol between two parties is as follows: Alice gives an encrypted classical message to Bob which she does not want Bob to be able to read until she gives him the key. If Alice is using classical resources, and she wants to…
We consider a simple streaming game between two players Alice and Bob, which we call the mirror game. In this game, Alice and Bob take turns saying numbers belonging to the set $\{1, 2, \dots,2N\}$. A player loses if they repeat a number…
We generalize the quantum Prisoner's Dilemma to the case where the players share a non maximally entangled states. We show that the game exhibits an intriguing structure as a function of the amount of entanglement with two thresholds which…
Suppose Alice has a coin with heads probability $q$ and Bob has one with heads probability $p>q$. Now each of them will toss their coin $n$ times, and Alice will win iff she gets more heads than Bob does. Evidently the game favors Bob, but…
We explicitly show a protocol in which an arbitrary two qubit a|00> + b|01> + c|10> + d|11> is faithfully and deterministically teleported from Alice to Bob. We construct the 16 orthogonal generalized Bell states which can be used to…
We consider a coalitional game with the same payoff for all players. To maximize the payoff, the players need to use one collective strategy, if all players are in certain states, and the other strategy otherwise. The current state of each…
After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In…
Several quantum versions of the battle of the sexes game are analyzed. Some of them are shown to reproduce the classical game. In some, there are no Nash quantum pure equilibria. In some others, the payoffs are always equal to each other.…
Motivated by non-local games and quantum coloring problems, we introduce a graph homomorphism game between quantum graphs and classical graphs. This game is naturally cast as a "quantum-classical game"--that is, a non-local game of two…
This paper considers a two-terminal problem in which Alice and Bob aim to perform a joint measurement on a bipartite quantum system $\rho^{AB}$. Alice transmits the results of her measurements to Bob over a classical channel, and the two…
A protocol for considering decoherence in quantum games is presented. Results for two-player, two-strategy quantum games subject to decoherence are derived and some specific examples are given. Decoherence in other types of quantum games is…
This work, based on the author's MA thesis, concentrates on simultaneous move quantum games of two players. A numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in…
If two parties, Alice and Bob, share some number, n, of partially entangled pairs of qubits, then it is possible for them to concentrate these pairs into some smaller number of maximally entangled states. We present a simplified version of…
We illustrate using a quantum system the principle of a cryptographic switch, in which a third party (Charlie) can control to a continuously varying degree the amount of information the receiver (Bob) receives, after the sender (Alice) has…
In this paper, we perform a minimalistic quantization of the classical game of tic-tac-toe, by allowing superpositions of classical moves. In order for the quantum game to reduce properly to the classical game, we require legal quantum…
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 build new quantum games, similar to the spin flip game, where as a novelty the players perform measurements on a quantum system associated to a continuous time search algorithm. The measurements collapse the wave function into one of the…
Introducing the simplest of all No-Signalling Games: the RGB Game where two verifiers interrogate two provers, Alice and Bob, far enough from each other that communication between them is too slow to be possible. Each prover may be…