Sciweavers

Share
ISAAC
2009
Springer

On the Tightness of the Buhrman-Cleve-Wigderson Simulation

10 years 4 days ago
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.
Shengyu Zhang
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where ISAAC
Authors Shengyu Zhang
Comments (0)
books