Near-optimal bounds on bounded-round quantum communication complexity of disjointness

TL;DR

This paper establishes near-optimal bounds on the quantum communication complexity of the disjointness problem, revealing the tradeoff between rounds and communication, and introduces new tools for quantum information complexity analysis.

Contribution

It proves a near-optimal round-communication tradeoff for quantum disjointness protocols and develops tools linking quantum information complexity to discrepancy methods.

Findings

Lower bound of rac{n}{r} + r on quantum communication for r-round protocols

Improved lower bound over previous rac{n}{r^2} + r results

Quantum information complexity relates to generalized discrepancy method

Abstract

We prove a near optimal round-communication tradeoff for the two-party quantum communication complexity of disjointness. For protocols with $r$ rounds, we prove a lower bound of $\tilde{\Omega}(n/r + r)$ on the communication required for computing disjointness of input size $n$, which is optimal up to logarithmic factors. The previous best lower bound was $\Omega(n/r^2 + r)$ due to Jain, Radhakrishnan and Sen [JRS03]. Along the way, we develop several tools for quantum information complexity, one of which is a lower bound for quantum information complexity in terms of the generalized discrepancy method. As a corollary, we get that the quantum communication complexity of any boolean function $f$ is at most $2^{O(QIC(f))}$, where $QIC(f)$ is the prior-free quantum information complexity of $f$ (with error $1/3$).