4 citations · 6 across the 9 of their papers we have counts for
1 paper · 1 filter
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 $\…