Skip to main navigation Skip to search Skip to main content

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 journalArticlepeer-review

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.
Sort by

Keyphrases

Computer Science

Physics

Mathematics