We study properties of quantum strategies, which are complete specifications of a given
party's actions in any multiple-round interaction involving the exchange of quantum …

Quantum information and computation provide a fascinating twist on the notion of proofs in
computational complexity theory. For instance, one may consider a quantum computational …

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 …

This paper presents an efficient parallel approximation scheme for a new class of min-max
problems. The algorithm is derived from the matrix multiplicative weights update method and …

Recent developments in domains such as non-local games, quantum interactive proofs, and
quantum generative adversarial networks have renewed interest in quantum game theory …

The problem of insider threats is not new to organizations and research community.
Organization cannot afford any kinds of attacks on their confidential information and …

This paper studies complexity theoretic aspects of quantum refereed games, which are
abstract games between two competing players that send quantum states to a referee, who …

In this thesis we introduce quantum refereed games, which are quantum interactive proof
systems with two competing provers. We focus on a restriction of this model that we call" …

This thesis studies one-turn quantum refereed games, which are abstract zero-sum games
with two competing computationally unbounded quantum provers and a computationally …

This paper presents an efficient parallel algorithm for a new class of min-max problems
based on the matrix multiplicative weights update method. Our algorithm can be used to find …