The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We derive lower bounds for tradeoffs between the communication C and space S for communicating circuits. The first such bound applies to quantum circuits. If for any function f with image Z the multicolor discrepancy of the communication matrix of f is 1/2^d, then any bounded error quantum protocol with space S, in which Alice receives some l inputs, Bob r inputs, and they compute f(x_i,y_j) for the lr pairs of inputs (x_i,y_j) needs communication C=\Omega(lrd \log |Z|/S). In particular,arXiv:quant-ph/0412088v1 fatcat:l5kyxfgztrel3e5wk3maiey3nq