Quantum versus Randomized Communication Complexity, with Efficient Players

Uma Girish
Uma Girish

Electronic Colloquium on Computational Complexity (ECCC), pp. 1522019.

Cited by: 0|Bibtex|Views28|
EI

Abstract:

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 function that can ...More

Code:

Data:

Your rating :
0

 

Tags
Comments