Login / Signup

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

Mark BravermanAnkit GargYoung Kun-KoJieming MaoDave Touchette
Published in: FOCS (2015)
Keyphrases
  • worst case
  • lower bound
  • upper bound
  • communication systems
  • neural network
  • support vector
  • evolutionary algorithm
  • memory requirements
  • lower and upper bounds
  • communication overhead