213 research outputs found
Bell Violations through Independent Bases Games
In a recent paper, Junge and Palazuelos presented two two-player games
exhibiting interesting properties. In their first game, entangled players can
perform notably better than classical players. The quantitative gap between the
two cases is remarkably large, especially as a function of the number of inputs
to the players. In their second game, entangled players can perform notably
better than players that are restricted to using a maximally entangled state
(of arbitrary dimension). This was the first game exhibiting such a behavior.
The analysis of both games is heavily based on non-trivial results from Banach
space theory and operator space theory. Here we present two games exhibiting a
similar behavior, but with proofs that are arguably simpler, using elementary
probabilistic techniques and standard quantum information arguments. Our games
also give better quantitative bounds.Comment: Minor update
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
We prove an optimal lower bound on the randomized communication
complexity of the much-studied Gap-Hamming-Distance problem. As a consequence,
we obtain essentially optimal multi-pass space lower bounds in the data stream
model for a number of fundamental problems, including the estimation of
frequency moments.
The Gap-Hamming-Distance problem is a communication problem, wherein Alice
and Bob receive -bit strings and , respectively. They are promised
that the Hamming distance between and is either at least
or at most , and their goal is to decide which of these is the
case. Since the formal presentation of the problem by Indyk and Woodruff (FOCS,
2003), it had been conjectured that the naive protocol, which uses bits of
communication, is asymptotically optimal. The conjecture was shown to be true
in several special cases, e.g., when the communication is deterministic, or
when the number of rounds of communication is limited.
The proof of our aforementioned result, which settles this conjecture fully,
is based on a new geometric statement regarding correlations in Gaussian space,
related to a result of C. Borell (1985). To prove this geometric statement, we
show that random projections of not-too-small sets in Gaussian space are close
to a mixture of translated normal variables
Simulating Quantum Correlations with Finite Communication
Assume Alice and Bob share some bipartite -dimensional quantum state. A
well-known result in quantum mechanics says that by performing two-outcome
measurements, Alice and Bob can produce correlations that cannot be obtained
locally, i.e., with shared randomness alone. We show that by using only two
bits of communication, Alice and Bob can classically simulate any such
correlations. All previous protocols for exact simulation required the
communication to grow to infinity with the dimension . Our protocol and
analysis are based on a power series method, resembling Krivine's bound on
Grothendieck's constant, and on the computation of volumes of spherical
tetrahedra.Comment: 19 pages, 3 figures, preliminary version in IEEE FOCS 2007; to appear
in SICOM
Elementary Proofs of Grothendieck Theorems for Completely Bounded Norms
We provide alternative proofs of two recent Grothendieck theorems for jointly
completely bounded bilinear forms, originally due to Pisier and Shlyakhtenko
(Invent. Math. 2002) and Haagerup and Musat (Invent. Math. 2008). Our proofs
are elementary and are inspired by the so-called embezzlement states in quantum
information theory. Moreover, our proofs lead to quantitative estimates.Comment: 14 page
- …