130 search results - page 10 / 26 » The Quantum Communication Complexity of Sampling |
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
— We propose a low complexity noncoherent receiver operating at twice the symbol-rate for systems where each data symbol consists of multiple frames/chips. The receiver does not ...
88
Voted
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
54
Voted
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
FCS
2006
14 years 11 months ago
2006
- Oblivious transfer OT is an important primitive in cryptography. In chosen one-out-of-two OT, Alice offers two bits, one of which Bob can choose to read, not learning any informa...