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

Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette. Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness. SIAM Journal on Computing, 47(6):2277-2314, 2018. [doi]

Abstract

Abstract is missing.