Related papers: Multiparty Karchmer-Wigderson Games and Threshold …
We show a communication complexity lower bound for finding a correlated equilibrium of a two-player game. More precisely, we define a two-player $N \times N$ game called the 2-cycle game and show that the randomized communication complexity…
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
For many protocols, quantum strategies have advantages compared with their classical counter-partners, and these advantages have attracted many interests and applications. One of the famous examples is the Clauser-Horne-Shimony-Holt (CHSH)…
We consider the Banzhaf-Coleman and Owen power indices for weighted majority games modified by a coalition configuration. We present calculation algorithms of them that make use of the method of generating functions. We programmed the…
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…
We present a general technique to implement products of many qubit operators communicating via a joint harmonic oscillator degree of freedom in a quantum computer. By conditional displacements and rotations we can implement Hamiltonians…
The numbers game is a one-player game played on a finite simple graph with certain ``amplitudes'' assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
We analyse an algorithm solving stochastic mean-payoff games, combining the ideas of relative value iteration and of Krasnoselskii-Mann damping. We derive parameterized complexity bounds for several classes of games satisfying…
What is the power of constant-depth circuits with $MOD_m$ gates, that can count modulo $m$? Can they efficiently compute MAJORITY and other symmetric functions? When $m$ is a constant prime power, the answer is well understood: Razborov and…
The convexification numerical method with the rigorously established global convergence property is constructed for a problem for the Mean Field Games System of the second order. This is the problem of the retrospective analysis of a game…
We give a converging semidefinite programming hierarchy of outer approximations for the set of quantum correlations of fixed dimension and derive analytical bounds on the convergence speed of the hierarchy. In particular, we give a…
We show that qubit stabilizer states can be represented by non-negative quasi-probability distributions associated with a Wigner-Weyl-Moyal formalism where Clifford gates are positive state-independent maps. This is accomplished by…
Though Cliffords and matchgates are both examples of classically simulable circuits, they are considered simulable for different reasons. The celebrated Gottesman-Knill explains the simulability Cliffords, and the efficient simulability of…
This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with linear dimension and…
Understanding the boundary between classical simulatability and the power of quantum computation is a fascinating topic. Direct simulation of noisy quantum computation requires solving an open quantum many-body system, which is very costly.…
In the Number On the Forehead (NOF) multiparty communication model, $k$ players want to evaluate a function $F : X_1 \times\cdots\times X_k\rightarrow Y$ on some input $(x_1,\dots,x_k)$ by broadcasting bits according to a predetermined…
We show that disjointness requires randomized communication Omega(n^{1/(k+1)}/2^{2^k}) in the general k-party number-on-the-forehead model of complexity. The previous best lower bound for k >= 3 was log(n)/(k-1). Our results give a…
We present a novel notion of $\lambda$-monotonicity for an $n$-species system of partial differential equations governed by mass-preserving flow dynamics, extending monotonicity in Banach spaces to the Wasserstein-2 metric space. We show…
Quantum discord as a measure of the quantum correlations cannot be easily computed for most of density operators. In this paper, we present a measure of the total quantum correlations that is operationally simple and can be computed…
We present a general method to find the upper and lower bounds on the generalized entanglement of formation for multi-party systems. The upper and lower bounds can be expressed in terms of the bi-partite entanglements of formation and/or…