Related papers: Complete characterization of perfect quantum strat…
Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games can involve entanglement among many states which is…
Operating quantum sensors and quantum computers would make data in the form of quantum states available for purely quantum processing, opening new avenues for studying physical processes and certifying quantum technologies. In this…
The efficient and reliable verification of quantum states plays a crucial role in various quantum information processing tasks. We consider the task of verifying entangled states using one-way and two-way classical communication and…
Pure states are very important in any theory since they represent states of maximal information about the system within the theory. Here, we show that no non-trivial (not local realistic) extremal states (boxes) of general no-signaling…
The non-local game scenario provides a powerful framework to study the limitations of classical and quantum correlations, by studying the upper bounds of the winning probabilities those correlations offer in cooperation games where…
Quantum error correction code discovery has relied on algebraic constructions with predetermined structure or computational search lacking mechanistic interpretability. We introduce a game-theoretic framework recasting code optimization as…
Whether a PTAS (polynomial-time approximation scheme) exists for game equilibria has been an open question, and its absence has indications and consequences in three fields: the practicality of methods in algorithmic game theory,…
A communication game consists of distributed parties attempting to jointly complete a task with restricted communication. Such games are useful tools for studying limitations of physical theories. A theory exhibits preparation contextuality…
Quantum state discrimination is a fundamental concept in quantum information theory, which refers to a class of techniques to identify a specific quantum state through a positive operator-valued measure. In this work, we investigate how…
Magic quantum states (non-stabilizer states) play a pivotal role in fault-tolerant quantum computation. Simultaneously, random resources have emerged as a key element in various randomized techniques within contemporary quantum science. In…
We introduce the notion of empirical coordination for quantum correlations. Quantum mechanics enables the calculation of probabilities for experimental outcomes, emphasizing statistical averages rather than detailed descriptions of…
Correlation self-testing of quantum theory involves identifying a task or set of tasks whose optimal performance can be achieved only by theories that can realise the same set of correlations as quantum theory in every causal structure.…
Recently, it has been argued that quantum mechanics is a complete theory, and that different quantum states do necessarily correspond to different elements of reality, under the assumptions that quantum mechanics is correct and that…
Two-player (antagonistic) games on (possibly stochastic) graphs are a prevalent model in theoretical computer science, notably as a framework for reactive synthesis. Optimal strategies may require randomisation when dealing with inherently…
The structure of all completely positive quantum operations is investigated which transform pure two-qubit input states of a given degree of entanglement in a covariant way. Special cases thereof are quantum NOT operations which transform…
Universality of quantum mechanics -- its applicability to physical systems of quite different nature and scales -- indicates that quantum behavior can be a manifestation of general mathematical properties of systems containing…
A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of…
We investigate the quantization of non-zero sum games. For the particular case of the Prisoners' Dilemma we show that this game ceases to pose a dilemma if quantum strategies are allowed for. We also construct a particular quantum strategy…
We demonstrate a new construction for perfect quantum secret sharing (QSS) schemes based on imperfect "ramp" secret sharing combined with classical encryption, in which the individual parties' shares are split into quantum and classical…
A quantum game in the Eisert scheme is defined by the payoff matrix, plus some quantum entanglement parameters. In the symmetric nonzero-sum 2x2 games, the relevant features of the game are given by two parameters in the payoff matrix, and…