We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
We propose a simple yet rich model to extend the notions of Nash equilibria and correlated equilibria of strategic games to the quantum setting, in which we then study the relatio...
In this paper we present a game semantics for a quantum programming language based on a new definition of quantum strategies. The language studied is MCdata, a typed version of th...
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...