Separations in communication complexity using cheat sheets and information complexity

2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp. 555-564, 2016.

Cited by: 21|Views40
EI

Abstract:

While exponential separations are known between quantum and randomized communication complexity for partial functions (Raz, STOC 1999), the best known separation between these measures for a total function is quadratic, witnessed by the disjointness function. We give the first super-quadratic separation between quantum and randomized comm...More

Code:

Data:

Your rating :
0

 

Tags
Comments