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]
@article{BravermanGKMT18,
title = {Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness},
author = {Mark Braverman and Ankit Garg and Young Kun-Ko and Jieming Mao and Dave Touchette},
year = {2018},
doi = {10.1137/16M1061400},
url = {https://doi.org/10.1137/16M1061400},
researchr = {https://researchr.org/publication/BravermanGKMT18},
cites = {0},
citedby = {0},
journal = {SIAM Journal on Computing},
volume = {47},
number = {6},
pages = {2277-2314},
}