Login / Signup
Near-optimal bounds on bounded-round quantum communication complexity of disjointness.
Mark Braverman
Ankit Garg
Young Kun-Ko
Jieming Mao
Dave Touchette
Published in:
Electron. Colloquium Comput. Complex. (2015)
Keyphrases
</>
worst case
computational complexity
lower bound
upper bound
error bounds
data acquisition
machine learning
learning algorithm
computational cost
computer networks
communication systems
communication channels
vc dimension
upper and lower bounds
quantum inspired
quantum computation