Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette. Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness. In Venkatesan Guruswami, editor, IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015. pages 773-791, IEEE, 2015. [doi]
Abstract is missing.