On query-to-communication lifting for adversary bounds

  title={On query-to-communication lifting for adversary bounds},
  author={Anurag Anshu and Shalev Ben-David and Srijita Kundu},
  journal={Proceedings of the 36th Computational Complexity Conference},
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… 

Figures from this paper

Lower bounds on quantum query complexity for symmetric functions

The value of lower bounding techniques using polynomial method and adversary method for quantum query complexity for the class of symmetric functions, arguably one of the most natural and basic set of Boolean functions is explored.

Simulation Methods in Communication Lower Bounds, Revisited

A white-box simulation is introduced, proving lifting theorems for block sensitivity with constant-size gadgets, and why this method has a potential to avoid the large-size gadget bottleneck in Raz-McKenzie simulation.

Communication Complexity of Collision

The Collision problem is to decide whether a given list of numbers ( x 1 , . . . , x n ) ∈ [ n ] n is 1-to-1 or 2-to-1 when promised one of them is the case. We show an n Ω(1) randomised

Fractional certificates for bounded functions

A folklore conjecture in quantum computing is that the acceptance probability of a quantum query algorithm can be approximated by a classical decision tree, with only a polynomial increase in the



Negative weights make adversaries stronger

A stronger version of the adversary method which goes beyond this principle to make explicit use of the stronger condition that the algorithm actually computes the function, and which is a lower bound on bounded-error quantum query complexity.

Quantum lower bounds by quantum arguments

Two new Ω(√N) lower bounds on computing AND of ORs and inverting a permutation and more uniform proofs for several known lower bounds which have been previously proven via a variety of different techniques are proved.

Reflections for quantum query algorithms

We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently

Lower bounds for randomized and quantum query complexity using Kolmogorov arguments

  • Sophie LaplanteF. Magniez
  • Computer Science, Mathematics
    Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
  • 2004
A very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply, and derives a general form of the ad hoc weighted method used by Hoyer, Neerbek and Shi to give a quantum lower bound on ordered search and sorting.

Quantum lower bounds by polynomials

This work examines the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}/sup N/ in the black-box model and gives asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings.

Query-to-communication lifting for BPP using inner product

This work proves a new query-to-communication lifting for randomized protocols, with inner product as gadget, with blockwise min-entropy framework to prove lifting theorems in both settings in a unified way.

All Classical Adversary Methods Are Equivalent for Total Functions

All known classical adversary lower bounds on randomized query complexity are equivalent for total functions and are equal to the fractional block sensitivity fbs(f), and the relational adversary is equivalent to a simpler lower bound, which is called rank-1 relational adversary.

Classical Lower Bounds from Quantum Upper Bounds

It is shown that for any function f, the approximate degree of computing the OR of n copies of f is Omega(sqrt n) times the approximatedegree of f, which is optimal, and a new proof of Razborov's celebrated Omega (sqrtn) lower bound on the quantum communication complexity of the disjointness problem is given.

Rectangles Are Nonnegative Juntas

The main structure theorem states that each rectangle in the communication matrix of f o gn can be simulated by a nonnegative combination of juntas, the strongest yet formalization for the intuition that each low-communication randomized protocol can only "query" few inputs of f as encoded by the gadget g.

Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound

  • Aleksandrs Belovs
  • Computer Science, Mathematics
    2014 IEEE 29th Conference on Computational Complexity (CCC)
  • 2014
This paper constructs optimal quantum query algorithms for the cases when h is the XOR or the OR function, or the exact-half function or the majority function, and proves an upper bound of $${O(k^{1/4})}$$O (k 1/4).