3 research outputs found
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead
Buhrman, Cleve and Wigderson (STOC'98) observed that for every Boolean
function and the two-party bounded-error quantum communication complexity of is , where is the bounded-error quantum query
complexity of . Note that the bounded-error randomized communication
complexity of is bounded by , where denotes
the bounded-error randomized query complexity of . Thus, the BCW simulation
has an extra factor appearing that is absent in classical
simulation. A natural question is if this factor can be avoided. H{\o}yer and
de Wolf (STACS'02) showed that for the Set-Disjointness function, this can be
reduced to for some constant , and subsequently Aaronson and
Ambainis (FOCS'03) showed that this factor can be made a constant. That is, the
quantum communication complexity of the Set-Disjointness function (which is
) is .
Perhaps somewhat surprisingly, we show that when , then
the extra factor in the BCW simulation is unavoidable. In other words,
we exhibit a total function such that .
To the best of our knowledge, it was not even known prior to this work
whether there existed a total function and 2-bit function , such
that