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

Saved in:
Bibliographic Details
Published in:SIAM journal on computing 2018-01, Vol.47 (6), p.2277-2314
Main Authors: Braverman, Mark, Garg, Ankit, Ko, Young Kun, Mao, Jieming, Touchette, Dave
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:
ISSN:0097-5397
1095-7111
DOI:10.1137/16M1061400