Related papers: Generalized Tsirelson Inequalities, Commuting-Oper…
The problem of computing a common point that lies in the intersection of a finite number of closed convex sets, each known to one agent in a network, is studied. This issue, known as the distributed convex feasibility problem or the…
Recent experimental evidence [Gruji\'c et al., PLoS ONE 5, e13749 (2010)] on the spatial Prisoner's Dilemma suggests that players choosing to cooperate or not on the basis of their previous action and the actions of their neighbors coexist…
In rational verification, the aim is to verify which temporal logic properties will obtain in a multi-agent system, under the assumption that agents ("players") in the system choose strategies for acting that form a game theoretic…
The widely held belief that BQP strictly contains BPP raises fundamental questions: Upcoming generations of quantum computers might already be too large to be simulated classically. Is it possible to experimentally test that these systems…
Coordination games with explicit spatial or relational structure are of interest to economists, ecologists, sociologists, and others studying emergent global properties in collective behavior. When assemblies of individuals seek to…
Quantum algorithms reformulate computational problems as quantum evolutions in a large Hilbert space. Most quantum algorithms assume that the time-evolution is perfectly unitary and that the full Hilbert space is available. However, in…
We introduce a simple two-player test which certifies that the players apply tensor products of Pauli $\sigma_X$ and $\sigma_Z$ observables on the tensor product of $n$ EPR pairs. The test has constant robustness: any strategy achieving…
While many theoretical studies have revealed the strategies that could lead to and maintain cooperation in the Iterated Prisoner's Dilemma, less is known about what human participants actually do in this game and how strategies change when…
We investigate the computation of equilibria in extensive-form games where ex ante correlation is possible, focusing on correlated equilibria requiring the least amount of communication between the players and the mediator. Motivated by the…
In this work we construct tests that allow a classical user to certify high dimensional entanglement in uncharacterized and possibly noisy quantum devices. We present a family of non-local games $\{G_n\}$ that for all $n$ certify states…
Achieving quantum computational advantage requires solving a classically intractable problem on a quantum device. Natural proposals rely upon the intrinsic hardness of classically simulating quantum mechanics; however, verifying the output…
Quantum pseudotelepathy is a strong form of nonlocality. Different from the conventional non-local games where quantum strategies win statistically, e.g., the Clauser-Horne-Shimony-Holt game, quantum pseudotelepathy in principle allows…
We undertake experimental detection of the entanglement present in arbitrary three-qubit pure quantum states on an NMR quantum information processor. Measurements of only four observables suffice to experimentally differentiate between the…
Higher-order quantum theory deals with causal quantum processes, described by quantum combs, and test procedures, described by quantum testers, "measuring" these processes. In this work, we show that "jointly non-implementable" or…
A generalized Kochen-Specker theorem is proved. It is shown that there exist sets of $n$ projection operators, representing $n$ yes-no questions about a quantum system, such that none of the $2^n$ possible answers is compatible with sum…
We give a test that can distinguish efficiently between product states of n quantum systems and states which are far from product. If applied to a state psi whose maximum overlap with a product state is 1-epsilon, the test passes with…
We address the problem of coding for classical multiple-access channels (MACs) with the assistance of non-signaling correlations between parties. It is well-known that non-signaling assistance does not change the capacity of classical…
Solving feedback Stackelberg games with nonlinear dynamics and coupled constraints, a common scenario in practice, presents significant challenges. This work introduces an efficient method for computing approximate local feedback…
Bell non-locality is a fundamental feature of quantum mechanics whereby measurements performed on "spatially separated" quantum systems can exhibit correlations that cannot be understood as revealing predetermined values. This is a special…
This thesis explores foundational aspects of quantum information theory and quantum cryptography. First, we investigate quantum correlations in interactive settings, including the CHSH and graph isomorphism games. We aim to distinguish…