Bell's 1964 theorem, which states that the predictions of quantum theory cannot be
accounted for by any local theory, represents one of the most profound developments in the …

This article surveys quantum computational complexity, with a focus on three fundamental
notions: polynomial-time quantum computations, the efficient verification of quantum proofs …

Note from the Research Highlights Co-Chairs: A Research Highlights paper appearing in
Communications is usually peer-reviewed prior to publication. The following paper is …

This paper investigates various aspects of the nonlocal effects that can arise when
entangled quantum information is shared between two parties. A natural framework for …

We review both theoretical and experimental developments in the area of quantum games
since the inception of the subject circa 1999. We will also offer a narrative on the controversy …

The view that machines cannot give rise to surprises is due, I believe, to a fallacy to which
philosophers and mathematicians are particularly subject. This is the assumption that as …

Tsirelson's problem asks whether the commuting operator model for two-party quantum
correlations is equivalent to the tensor-product model. We give a negative answer to this …

We construct a 1-round delegation scheme (ie, argument-system) for every language
computable in time t= t (n), where the running time of the prover is poly (t) and the running …

We describe a new technique for obtaining Tsirelson bounds, which are upper bounds on
the quantum value of a Bell inequality. Since quantum correlations do not allow signalling …

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