DeepAI AI Chat
Log In Sign Up

On Query-to-Communication Lifting for Adversary Bounds

by   Anurag Anshu, et al.

We investigate query-to-communication lifting theorems for models related to the quantum adversary bounds. Our results are as follows: 1. We show that the classical adversary bound lifts to a lower bound on randomized communication complexity with a constant-sized gadget. We also show that the classical adversary bound is a strictly stronger lower bound technique than the previously-lifted measure known as critical block sensitivity, making our lifting theorem one of the strongest lifting theorems for randomized communication complexity using a constant-sized gadget. 2. Turning to quantum models, we show a connection between lifting theorems for quantum adversary bounds and secure 2-party quantum computation in a certain "honest-but-curious" model. Under the assumption that such secure 2-party computation is impossible, we show that a simplified version of the positive-weight adversary bound lifts to a quantum communication lower bound using a constant-sized gadget. We also give an unconditional lifting theorem which lower bounds bounded-round quantum communication protocols. 3. Finally, we give some new results in query complexity. We show that the classical adversary and the positive-weight quantum adversary are quadratically related. We also show that the positive-weight quantum adversary is never larger than the square of the approximate degree. Both relations hold even for partial functions.


page 1

page 2

page 3

page 4


Lower bounds on quantum query complexity for symmetric functions

One of the main reasons for query model's prominence in quantum complexi...

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

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

The Adversary Bound Revisited: From Optimal Query Algorithms to Optimal Control

This note complements the paper "One-Way Ticket to Las Vegas and the Qua...

All Classical Adversary Methods are Equivalent for Total Functions

We show that all known classical adversary lower bounds on randomized qu...

Certificate games

We introduce and study Certificate Game complexity, a measure of complex...

Exact quantum query complexity of computing Hamming weight modulo powers of two and three

We study the problem of computing the Hamming weight of an n-bit string ...

Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory

In a work by Raz (J. ACM and FOCS 16), it was proved that any algorithm ...