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

Mark Braverman, Ankit Garg, Young Kun Ko +2

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 $\…