模式矩阵法(期刊版)
The Pattern Matrix Method (Journal Version)
摘要:
我们开发了一种新的和强大的通信下界,模式矩阵方法的技术。具体地说,固定一个任意函数f:{0,1}^n->{0,1},设A_f是矩阵,其每一列都是f对变量x_1,x_2,.的某个子集的应用,x_{4n}。我们证明了A_f具有有界错误通信复杂性Ω(d),其中d是f的近似次数。这个结果在量子模型中仍然有效,不管先前的纠缠如何。特别地,它给出了一个新的和简单的证明Razborov的突破量子下界的不相交性和其他对称谓词。我们进一步刻画的差异,近似秩,和近似迹范数的A_f的充分研究的分析性质的f,广泛地推广了最近的几个结果,小偏差通信和不可知学习。本文的方法最近在多方通信复杂性方面取得了重要进展。
英文摘要:
We develop a novel and powerful technique for communication lower bounds, the pattern matrix method. Specifically, fix an arbitrary function f:{0,1}^n->{0,1} and let A_f be the matrix whose columns are each an application of f to some subset of the variables x_1,x_2,...,x_{4n}. We prove that A_f has bounded-error communication complexity Omega(d), where d is the approximate degree of f. This result remains valid in the quantum model, regardless of prior entanglement. In particular, it gives a new and simple proof of Razborov's breakthrough quantum lower bounds for disjointness and other symmetric predicates. We further characterize the discrepancy, approximate rank, and approximate trace norm of A_f in terms of well-studied analytic properties of f, broadly generalizing several recent results on small-bias communication and agnostic learning. The method of this paper has recently enabled important progress in multiparty communication complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。