Related papers: Better Non-Local Games from Hidden Matching
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…
We construct a Parrondo's game using discrete time quantum walks. Two lossing games are represented by two different coin operators. By mixing the two coin operators $U_{A}(\alpha_{A},\beta_{A},\gamma_{A})$ and…
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…
Nonlocal gate operation is based on sharing an ancillary pair of qubits in perfect entanglement. When the ancillary pair are partially entangled, the efficiency of the gate operation drops. Using general transformations, we devise…
We characterize exact, and approximate, optimality of games that players can interact with using quantum strategies. In comparison to a previous work of the author, arXiv: 2311.12887, which applied a 2016 framework due to Ostrev for…
We provide a quantum gambling protocol using three (symmetric) nonorthogonal states. The bias of the proposed protocol is less than that of previous ones, making it more practical. We show that the proposed scheme is secure against…
We provide a complete structural characterization of perfect quantum strategies for arbitrary quantum magic rectangle games. We derive necessary and sufficient conditions that jointly constrain the shared state and measurement operators,…
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 analyze the impact of the Unruh effect on the quantum Magic Square game. We find the values of acceleration parameter for which quantum strategy yields higher players' winning probability than classical strategy.
Game theory is the mathematical framework for analyzing strategic interactions in conflict and competition situations. In recent years quantum game theory has earned the attention of physicists, and has emerged as a branch of quantum…
We formulate the $(n,k)$ Coset Monogamy Game, in which two players must extract complementary information of unequal size ($k$ bits vs. $n-k$ bits) from a random coset state without communicating. The complementary information takes the…
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…
In a variant of communication complexity tasks, two or more separated parties cooperate to compute a function of their local data, using a limited amount of communication. It is known that communication of quantum systems and shared…
At Crypto 2011, some of us had proposed a family of cryptographic protocols for key establishment capable of protecting quantum and classical legitimate parties unconditionally against a quantum eavesdropper in the query complexity model.…
Compiling Bell games under cryptographic assumptions replaces the need for physical separation, allowing nonlocality to be probed with a single untrusted device. While Kalai et al. (STOC'23) showed that this compilation preserves quantum…
An evolutionary approach for computing the winning strategy for Nim-like games is proposed in this paper. The winning strategy is computed by using the Multi Expression Programming (MEP) technique - a fast and efficient variant of the…
We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games…
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Lov\'asz Local Lemma which can dramatically reduce the number of edges needed in…
Solving parity games is a major building block for numerous applications in reactive program verification and synthesis. While they can be solved efficiently in practice, no known approach has a polynomial worst-case runtime complexity. We…
Infinite-state games are a commonly used model for the synthesis of reactive systems with unbounded data domains. Symbolic methods for solving such games need to be able to construct intricate arguments to establish the existence of winning…