Related papers: Certificate Games and Consequences for the Classic…
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 investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate…
We introduce a quantum version of the Game of Life and we use it to study the emergence of complexity in a quantum world. We show that the quantum evolution displays signatures of complex behaviour similar to the classical one, however a…
Post-quantum cryptography studies the security of classical, i.e. non-quantum cryptographic protocols against quantum attacks. Until recently, the considered adversaries were assumed to use quantum computers and behave like classical…
This paper studies the complexity of solving two classes of non-cooperative games in a distributed manner in which the players communicate with a set of system nodes over noisy communication channels. The complexity of solving each game…
A natural generalization of the binary XOR games to the class of XOR-d games with $d > 2$ outcomes is studied. We propose an algebraic bound to the quantum value of these games and use it to derive several interesting properties of these…
We present a perspective on quantum games that focuses on the physical aspects of the quantities that are used to implement a game. If a game is to be played, it has to be played with objects and actions that have some physical existence.…
Incomplete cooperative games generalise the classical model of cooperative games by omitting the values of some of the coalitions. This allows to incorporate uncertainty into the model and study the underlying games as well as possible…
In classical complexity theory, the two definitions of probabilistically checkable proofs -- the constraint satisfaction and the nonlocal games version -- are computationally equal in power. In the quantum setting, the situation is far less…
Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to…
Communication games are collaborative information processing tasks involving a number of players with limited communication. Such games are useful tools for studying physical theories. A physical theory exhibits preparation contextuality…
Quantum classifiers are vulnerable to adversarial attacks that manipulate their input classical or quantum data. A promising countermeasure is adversarial training, where quantum classifiers are trained by using an attack-aware, adversarial…
In this paper, we consider lower bounds on the query complexity for testing CSPs in the bounded-degree model. First, for any ``symmetric'' predicate $P:{0,1}^{k} \to {0,1}$ except \equ where $k\geq 3$, we show that every (randomized)…
Quantum computers are reaching a level where interactions between classical and quantum computations can happen in real-time. This marks the advent of a new, broader class of quantum circuits: dynamic quantum circuits. They offer a broader…
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…
In this paper we give a set of necessary and sufficient conditions such that quantum players of a two-party {\sc xor} game cannot perform any better than classical players. With any such game, we associate a graph and examine its zero-error…
Quantum games embody non-intuitive consequences of quantum phenomena, such as entanglement and contextuality. The Mermin-Peres game is a simple example, demonstrating how two players can utilise shared quantum information to win a no -…
We consider the natural extension of two-player nonlocal games to an arbitrary number of players. An important question for such nonlocal games is their behavior under parallel repetition. For two-player nonlocal games, it is known that…
Let $f:\{0,1\}^n \rightarrow \{0,1\}$ be a Boolean function. The certificate complexity $C(f)$ is a complexity measure that is quadratically tight for the zero-error randomized query complexity $R_0(f)$: $C(f) \leq R_0(f) \leq C(f)^2$. In…
Local simultaneous state discrimination (LSSD) is a recently introduced problem in quantum information processing. Its classical version is a non-local game played by non-communicating players against a referee. Based on a known probability…