Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness.

Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette

Browse the full FOCS paper archive.