Upper Bounds on Communication in Terms of Approximate Rank

Abstract

We show that any Boolean function with approximate rank r can be computed by bounded-error quantum protocols without prior entanglement of complexity \(O( \sqrt{r} \log r)\). In addition, we show that any Boolean function with approximate rank r and discrepancy \(\delta \) can be computed by deterministic protocols of complexity O(r), and private coin bounded-error randomized protocols of complexity \(O((\frac{1}{\delta })^2 + \log r)\). Our deterministic upper bound in terms of approximate rank is tight up to constant factors, and the dependence on discrepancy in our randomized upper bound is tight up to taking square-roots. Our results can be used to obtain lower bounds on approximate rank. We also obtain a strengthening of Newman’s theorem with respect to approximate rank.