DeepAI AI Chat
Log In Sign Up

Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead

by   Sourav Chakraborty, et al.

Buhrman, Cleve and Wigderson (STOC'98) observed that for every Boolean function f : {-1, 1}^n →{-1, 1} and ∙ : {-1, 1}^2 →{-1, 1} the two-party bounded-error quantum communication complexity of (f ∘∙) is O(Q(f) log n), where Q(f) is the bounded-error quantum query complexity of f. Note that the bounded-error randomized communication complexity of (f ∘∙) is bounded by O(R(f)), where R(f) denotes the bounded-error randomized query complexity of f. Thus, the BCW simulation has an extra O(log n) factor appearing that is absent in classical simulation. A natural question is if this factor can be avoided. Høyer and de Wolf (STACS'02) showed that for the Set-Disjointness function, this can be reduced to c^log^* n for some constant c, 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 NOR_n ∘∧) is O(Q(NOR_n)). Perhaps somewhat surprisingly, we show that when ∙ = ⊕, then the extra log n factor in the BCW simulation is unavoidable. In other words, we exhibit a total function F : {-1, 1}^n →{-1, 1} such that Q^cc(F ∘⊕) = Θ(Q(F) log n). To the best of our knowledge, it was not even known prior to this work whether there existed a total function F and 2-bit function ∙, such that Q^cc(F ∘∙) = ω(Q(F)).


page 1

page 2

page 3

page 4


Symmetry and Quantum Query-to-Communication Simulation

Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean fun...

An Optimal Separation of Randomized and Quantum Query Complexity

We prove that for every decision tree, the absolute values of the Fourie...

Optimal Separation and Strong Direct Sum for Randomized Query Complexity

We establish two results regarding the query complexity of bounded-error...

Quantum Log-Approximate-Rank Conjecture is also False

In a recent breakthrough result, Chattopadhyay, Mande and Sherif [ECCC T...

The quantum query complexity of composition with a relation

The negative weight adversary method, ADV^±(g), is known to characterize...

Basic quantum subroutines: finding multiple marked elements and summing numbers

We show how to find all k marked elements in a list of size N using the ...

Hybrid Decision Trees: Longer Quantum Time is Strictly More Powerful

In this paper, we introduce the hybrid query complexity, denoted as Q(f;...