DeepAI AI Chat
Log In Sign Up

The quantum query complexity of composition with a relation

by   Aleksandrs Belovs, et al.

The negative weight adversary method, ADV^±(g), is known to characterize the bounded-error quantum query complexity of any Boolean function g, and also obeys a perfect composition theorem ADV^±(f ∘ g^n) = ADV^±(f) ADV^±(g). Belovs gave a modified version of the negative weight adversary method, ADV_rel^±(f), that characterizes the bounded-error quantum query complexity of a relation f ⊆{0,1}^n × [K], provided the relation is efficiently verifiable. A relation is efficiently verifiable if ADV^±(f_a) = o(ADV_rel^±(f)) for every a ∈ [K], where f_a is the Boolean function defined as f_a(x) = 1 if and only if (x,a) ∈ f. In this note we show a perfect composition theorem for the composition of a relation f with a Boolean function g ADV_rel^±(f ∘ g^n) = ADV_rel^±(f) ADV^±(g) . For an efficiently verifiable relation f this means Q(f ∘ g^n) = Θ( ADV_rel^±(f) ADV^±(g) ).


page 1

page 2

page 3

page 4


A composition theorem for randomized query complexity via max conflict complexity

Let R_ϵ(·) stand for the bounded-error randomized query complexity with ...

A Composition Theorem via Conflict Complexity

Let (·) stand for the bounded-error randomized query complexity. We show...

On the randomised query complexity of composition

Let f⊆{0,1}^n×Ξ be a relation and g:{0,1}^m→{0,1,*} be a promise functio...

Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge

We define a new query measure we call quantum distinguishing complexity,...

Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead

Buhrman, Cleve and Wigderson (STOC'98) observed that for every Boolean f...

A note on the tight example in On the randomised query complexity of composition

We make two observations regarding a recent tight example for a composit...

On Query-to-Communication Lifting for Adversary Bounds

We investigate query-to-communication lifting theorems for models relate...