Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Uma Girish:

TR19-152 | 6th November 2019
Uma Girish, Ran Raz, Avishay Tal

Quantum versus Randomized Communication Complexity, with Efficient Players

We study a new type of separation between quantum and classical communication complexity which is obtained using quantum protocols where all parties are efficient, in the sense that they can be implemented by small quantum circuits with oracle access to their inputs. More precisely, we give an explicit partial Boolean ... more >>>

ISSN 1433-8092 | Imprint