180 research outputs found
Simultaneous Multiparty Communication Protocols for Composed Functions
In the Number On the Forehead (NOF) multiparty communication model,
players want to evaluate a function on some input by broadcasting bits according to a
predetermined protocol. The input is distributed in such a way that each player
sees all of it except . In the simultaneous setting, the players
cannot speak to each other but instead send information to a referee. The
referee does not know the players' input, and cannot give any information back.
At the end, the referee must be able to recover from what
she obtained.
A central open question, called the barrier, is to find a function
which is hard to compute for or more players (where the 's
have size ) in the simultaneous NOF model. This has important
applications in circuit complexity, as it could help to separate from
other complexity classes. One of the candidates belongs to the family of
composed functions. The input to these functions is represented by a boolean matrix , whose row is the input and is a
block-width parameter. A symmetric composed function acting on is specified
by two symmetric - and -variate functions and , that output
where is the -th block of width
of . As the majority function is conjectured to be outside of
, Babai et. al. suggested to study , with large
enough.
So far, it was only known that is not enough for to
break the barrier in the simultaneous deterministic NOF model. In this
paper, we extend this result to any constant block-width , by giving a
protocol of cost for any symmetric composed
function when there are players.Comment: 17 pages, 1 figure; v2: improved introduction, better cost analysis
for the 2nd protoco
The Power of Super-logarithmic Number of Players
In the `Number-on-Forehead\u27 (NOF) model of multiparty communication,
the input is a k times m boolean matrix A (where k is the number of players) and Player i sees all bits except those in the i-th row, and the players communicate by broadcast in order to evaluate a specified function f at A.
We discover new computational power when k exceeds log m. We give a protocol with communication cost poly-logarithmic in m, for block composed functions with limited block width. These are functions
of the form f o g where f is a symmetric b-variate function, and g is a (kr)-variate function and (f o g)(A) is defined, for a k times (br) matrix to be f(g(A-1),...,g(A-b)) where A-i is the i-th (k times r) block of A. Our protocol works provided that k > 1+ ln b + (2 to the power of r).
Ada et al. (ICALP\u272012) previously obtained simultaneous and deterministic efficient protocols for composed functions of block-width one. The new protocol is the first to work for block composed functions with block-width greather than one. Moreover, it is simultaneous, with vanishingly small error probability, if public coin randomness is allowed. The deterministic and zero-error version barely uses interaction
Space Pseudorandom Generators by Communication Complexity Lower Bounds
In 1989, Babai, Nisan and Szegedy gave a construction of a pseudorandom generator for logspace, based on lower bounds for multiparty communication complexity. The seed length of their pseudorandom generator was relatively large, because the best lower bounds for multiparty communication complexity are relatively weak. Subsequently, pseudorandom generators for logspace with seed length O(log^2 n) were given by Nisan, and Impagliazzo, Nisan and Wigderson.
In this paper, we show how to use the pseudorandom generator construction of Babai, Nisan and Szegedy to obtain a third construction of a pseudorandom generator with seed length O(log^2 n), achieving the same parameters as Nisan, and Impagliazzo, Nisan and Wigderson. We achieve this by concentrating on protocols in a restricted model of multiparty communication complexity that we call the conservative one-way unicast model and is based on the conservative one-way model of Damm, Jukna and Sgall. We observe that bounds in the conservative one-way unicast model (rather than the standard Number On the Forehead model) are sufficient for the pseudorandom generator construction of Babai, Nisan and Szegedy to work.
Roughly speaking, in a conservative one-way unicast communication protocol, the players speak in turns, one after the other in a fixed order, and every message is visible only to the next player. Moreover, before the beginning of the protocol, each player only knows the inputs of the players that speak after she does and a certain function of the inputs of the players that speak before she does. We prove a lower bound for the communication complexity of conservative one-way unicast communication protocols that compute a family of functions obtained by compositions of strong extractors. Our final pseudorandom generator construction is related to, but different from the constructions of Nisan, and Impagliazzo, Nisan and Wigderson
On the Communication Complexity of High-Dimensional Permutations
We study the multiparty communication complexity of high dimensional permutations in the Number On the Forehead (NOF) model. This model is due to Chandra, Furst and Lipton (CFL) who also gave a nontrivial protocol for the Exactly-n problem where three players receive integer inputs and need to decide if their inputs sum to a given integer n. There is a considerable body of literature dealing with the same problem, where (N,+) is replaced by some other abelian group. Our work can be viewed as a far-reaching extension of this line of research. We show that the known lower bounds for that group-theoretic problem apply to all high dimensional permutations. We introduce new proof techniques that reveal new and unexpected connections between NOF communication complexity of permutations and a variety of well-known problems in combinatorics. We also give a direct algorithmic protocol for Exactly-n. In contrast, all previous constructions relied on large sets of integers without a 3-term arithmetic progression
Multipartite entanglement in XOR games
We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of the entangled and classical biases, which measure the maximum advantage
of a quantum or classical strategy over a uniformly random strategy. For the case of two-player XOR games, Tsirelson proved that this ratio is upper bounded by the celebrated Grothendieck constant. In contrast, Pérez-García et al. proved the existence of entangled states that give quantum players an unbounded advantage over classical players in a three-player XOR game.
We show that the multipartite entangled states that are most often seen in today’s literature can only lead to a bias that is a constant factor larger than the classical bias. These states include GHZ states, any state local-unitarily equivalent to combinations of GHZ and maximally entangled states shared between different subsets of the players (e.g., stabilizer states), as well as generalizations of GHZ states of the form ∑iɑi|i〉...|i〉 for arbitrary amplitudes ɑi. Our results have the following surprising consequence: classical three-player XOR games do not follow an XOR parallel repetition theorem, even a very weak one. Besides this, we discuss implications of our results for communication complexity and hardness of approximation.
Our proofs are based on novel applications of extensions of Grothendieck’s inequality, due to Blei and Tonge, and Carne, generalizing Tsirelson’s use of Grothendieck’s
inequality to bound the bias of two-player XOR games
- …