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

Mark Braverman, Ankit Garg, Young K.U.N. Ko, M. A.O. Jieming, Dave Touchette

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Fingerprint

Dive into the research topics of 'Near-optimal bounds on the bounded-round quantum communication complexity of disjointness'. Together they form a unique fingerprint.

Keyphrases

Computer Science

Physics

Mathematics