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

Mark Braverman, Ankit Garg, Young Kun Ko, Jieming Mao, Dave Touchette

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

Fingerprint

Dive into the research topics of 'Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness'. Together they form a unique fingerprint.

Engineering & Materials Science