On the Tightness of the Buhrman-Cleve-Wigderson Simulation

Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) 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 (g1, · · · , gn). In this paper we show that the simulation is actually polynomially tight up to the choice of (g1, · · · , gn). This also implies that the classical and quantum communication complexities of certain blockcomposed functions are polynomially related.

• Type: Conference
• Year: 2009
• Where: ISAAC
• Authors: Shengyu Zhang
• Keywords: Algorithms, Block-composed Functions, Decision Tree Computation, General Communication Protocol, ISAAC 2009