On the Tightness of the Buhrman-Cleve-Wigderson Simulation

@inproceedings{Zhang2009OnTT,
  title={On the Tightness of the Buhrman-Cleve-Wigderson Simulation},
  author={Shengyu Zhang},
  booktitle={ISAAC},
  year={2009}
}
Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions $f(g_1(x^1, y^1), \ldots, g_n(x^n, y^n))$ by simulating a decision tree computation for f [3]. It is also well-known that this simulation can be very inefficient for some functions f and (g 1, ..., g n ). In this paper we show that the simulation is actually polynomially tight up to the choice of (g 1, ..., g n ). This also implies that the classical and quantum communication complexities of certain… 

Quantum query-to-communication simulation needs a logarithmic overhead

It is shown that when • = ⊕, then the extra log n factor in the BCW simulation is unavoidable, and it is exhibited that there existed a total function F and 2-bit function •, such that Qcc(F ο •) = ω(Q(F)).

Composition Theorems in Communication Complexity

It is shown that the pattern matrix framework of Sherstov works whenever the inner function g is strongly balanced, and a general lower bound is formed on F whenever g satisfies this property.

Communication lower bounds via critical block sensitivity

The results extend and simplify the works of Beame et al. (SICOMP 2007) and Huynh and Nordström and prove new rank lower bounds as well as obtain the first length--space lower bounds for semi-algebraic proof systems, including Lovász--Schrijver and Lasserre (SOS) systems.

Simulation Methods in Communication Lower Bounds, Revisited

A white-box simulation is introduced, proving lifting theorems for block sensitivity with constant-size gadgets, and why this method has a potential to avoid the large-size gadget bottleneck in Raz-McKenzie simulation.

Log-rank and lifting for AND-functions

The techniques can be used to prove (within a logn factor) a lifting theorem for AND-functions, stating that the deterministic communication complexity of f∧ is polynomially related to the AND-decision tree complexity of m, which stands in contrast with previous results on special cases of the log-rank conjecture.

Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent

  • Penghui Yao
  • Computer Science
    Chic. J. Theor. Comput. Sci.
  • 2016
The parity decision tree complexity of a boolean function f and the communication complexity of the corresponding $k$-argument XOR functions are polynomially equivalent whenever $k\geq 4$.

Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas

Lower bounds of Ω (√n) and Ω(n1/4) are shown on the randomized and quantum communication complexity, respectively, of all n variable read-once Boolean formulas by "embedding" either the Disjointness problem or its complement in any given read- once Boolean formula.

Communication Lower Bounds via Query Complexity

This thesis proves lower bounds in communication complexity by exploiting new connections to query complexity by proving a general theorem stating that for a large class of communication problems F, any protocol for F can be efficiently simulated by a decision tree solving a related problem f .

References

SHOWING 1-10 OF 13 REFERENCES

The pattern matrix method for lower bounds on quantum communication

An entirely different proof of Razborov's result is given, using the original, one-dimensional discrepancy method, which refutes the commonly held intuition that the original discrepancy method fails for functions such as DISJOINTNESS and establishes a large new class of total Boolean functions whose quantum communication complexity is at best polynomially smaller than their classical complexity.

Quantum lower bounds by polynomials

This work examines the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}/sup N/ in the black-box model and gives asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings.

Quantum vs. classical communication and computation

A simple and general simulation technique is presented that transforms any black-box quantum algorithm to a quantum communication protocol for a related problem, in a way that fully exploits the quantum parallelism, to obtain new positive and negative results.

On quantum-classical equivalence for composed communication problems

It is proved that the quantum bounded-error complexity is polynomially related to the classical deterministic complexity and the block sensitivity of f, and this result holds regardless of prior entanglement.

Some complexity questions related to distributive computing(Preliminary Report)

The quantity of interest, which measures the information exchange necessary for computing f, is the minimum number of bits exchanged in any algorithm.

Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas

Lower bounds of Ω (√n) and Ω(n1/4) are shown on the randomized and quantum communication complexity, respectively, of all n variable read-once Boolean formulas by "embedding" either the Disjointness problem or its complement in any given read- once Boolean formula.

An information statistics approach to data stream and communication complexity

This work presents a new method for proving strong lower bounds in communication complexity based on the notion of the conditional information complexity of a function, and shows that it also admits a direct sum theorem.

Communication Complexity

This work will review the basic communication model and some of the classical results known for it, sometimes even with proofs, and consider a variant in which the players are allowed to flip fair unbiased coins.

Sensitivity, block sensitivity, and l-block sensitivity of boolean functions

Quantum communication complexity of symmetric predicates

The bounded-error quantum communication complexity of the set disjointness predicate is equal to (up to a logarithmic factor), which holds both in the model with prior entanglement and without it.