量子和经典通信-空间在矩形边界上的折衷
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds
摘要:
我们推导出通信电路的通信C和空间S之间的折衷下界。第一个这样的界限适用于量子线路。如果对于任何具有图像Z的函数f,f的通信矩阵的偏差为1/2 ^d,则任何具有空间S的有界错误量子协议,其中Alice接收一些l个输入,Bob r个输入,并且他们为lr对输入(x_i,y_j)计算f(x_i,y_j),需要通信C=Ω(lrd \log |Z| /S)。特别地,有限域F上的n个\times n矩阵乘法需要C=Θ(n ^3 \log^2 |F| /S)。然后,我们转向随机有界错误协议,并推导出布尔矩阵乘法的界C=Ω(n^3/S^2),利用一个新的直积结果的随机通信复杂度的单边矩形下界。这意味着量子协议和随机协议之间的分离。
英文摘要:
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=Ω(lrd \log |Z|/S). In particular, n\times n-matrix multiplication over a finite field F requires C=Θ(n^3\log^2 |F|/S). We then turn to randomized bounded error protocols, and derive the bound C=Ω(n^3/S^2) for Boolean matrix multiplication, utilizing a new direct product result for the one-sided rectangle lower bound on randomized communication complexity. This implies a separation between quantum and randomized protocols.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。