We introduce the (G, H)-isomorphism game, a new two-player non-local game that classical
players can win with certainty iff the graphs G and H are isomorphic. We then define …

We develop further the new versions of quantum chromatic numbers of graphs introduced by
the first and fourth authors. We prove that the problem of computation of the commuting …

This paper presents a comprehensive exploration of semi-definite programming (SDP)
techniques within the context of quantum information. It examines the mathematical …

We introduce a general method which converts, in a unified way, any form of quantum
contextuality, including any form of state-dependent contextuality, into a quantum violation of …

We introduce a notion of quantum function and develop a compositional framework for finite
quantum set theory based on a 2-category of quantum sets and quantum functions. We use …

A homomorphism from a graph X to a graph Y is an adjacency preserving map f: V (X)→ V
(Y). We consider a nonlocal game in which Alice and Bob are trying to convince a verifier …

We investigate a simple class of multi-prover interactive proof systems (classical non-local
games), called binary constraint system (BCS) games, and characterize those that admit a …

Although'quantum contextuality'is one of the most fundamental non-classical feature, its
generic role in information processing and computation is an open quest. In this article, we …

We define several new types of quantum chromatic numbers of a graph and characterize
them in terms of operator system tensor products. We establish inequalities between these …

We present a classical interactive protocol that verifies the validity of a quantum witness
state for the local Hamiltonian problem. It follows from this protocol that approximating the …