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

Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette. Near-optimal bounds on bounded-round quantum communication complexity of disjointness. Electronic Colloquium on Computational Complexity (ECCC), 22:81, 2015. [doi]

Abstract

Abstract is missing.