58 research outputs found
Characterization of Binary Constraint System Games
We consider a class of nonlocal games that are related to binary constraint
systems (BCSs) in a manner similar to the games implicit in the work of Mermin
[N.D. Mermin, "Simple unified form for the major no-hidden-variables theorems,"
Phys. Rev. Lett., 65(27):3373-3376, 1990], but generalized to n binary
variables and m constraints. We show that, whenever there is a perfect
entangled protocol for such a game, there exists a set of binary observables
with commutations and products similar to those exhibited by Mermin. We also
show how to derive upper bounds strictly below 1 for the the maximum entangled
success probability of some BCS games. These results are partial progress
towards a larger project to determine the computational complexity of deciding
whether a given instance of a BCS game admits a perfect entangled strategy or
not.Comment: Revised version corrects an error in the previous version of the
proof of Theorem 1 that arises in the case of POVM measurement
The Complexity of Testing Monomials in Multivariate Polynomials
The work in this paper is to initiate a theory of testing monomials in
multivariate polynomials. The central question is to ask whether a polynomial
represented by certain economically compact structure has a multilinear
monomial in its sum-product expansion. The complexity aspects of this problem
and its variants are investigated with two folds of objectives. One is to
understand how this problem relates to critical problems in complexity, and if
so to what extent. The other is to exploit possibilities of applying algebraic
properties of polynomials to the study of those problems. A series of results
about and polynomials are obtained in this paper,
laying a basis for further study along this line
Locally Testable Codes and Cayley Graphs
We give two new characterizations of (\F_2-linear) locally testable
error-correcting codes in terms of Cayley graphs over \F_2^h:
\begin{enumerate} \item A locally testable code is equivalent to a Cayley
graph over \F_2^h whose set of generators is significantly larger than
and has no short linear dependencies, but yields a shortest-path metric that
embeds into with constant distortion. This extends and gives a
converse to a result of Khot and Naor (2006), which showed that codes with
large dual distance imply Cayley graphs that have no low-distortion embeddings
into .
\item A locally testable code is equivalent to a Cayley graph over \F_2^h
that has significantly more than eigenvalues near 1, which have no short
linear dependencies among them and which "explain" all of the large
eigenvalues. This extends and gives a converse to a recent construction of
Barak et al. (2012), which showed that locally testable codes imply Cayley
graphs that are small-set expanders but have many large eigenvalues.
\end{enumerate}Comment: 22 page
- …