On the power of Ambainis lower bounds

  • Authors:

  • Shengyu Zhang

  • Affiliations:

  • Computer Science Department, Princeton University, Princeton, NJ

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2005

Quantified Score

Hi-index 5.23

Visualization

Abstract

The polynomial method and the Ambainis lower bound (or Alb, for short) method are two main quantum lower bound techniques. While recently Ambainis showed that the polynomial method is not tight, the present paper aims at studying the power and limitation of Alb's. We first use known Alb's to derive Ω(n1.5) lower bounds for BIPARTITENESS, BIPARTITENESS MATCHING and GRAPH MATCHING, in which the lower bound for BIPARTITENESS improves the previous Ω(n) one. We then show that all the three known Ambainis lower bounds have a limitation √N min{C0(f), C1(f)}, where C0(f) and C1(f) are the 0- and 1-certificate complexities, respectively. This implies that for many problems such as TRIANGLE, k-CLIQUE, BIPARTITENESS and BIPARTITE/GRAPH MATCHING which draw wide interest and whose quantum query complexities are still open, the best known lower bounds cannot be further improved by using Ambainis techniques. Another consequence is that all the Ambainis lower bounds are not tight. For total functions, this upper bound for Alb's can be further improved to min{√C0(f)C1(f), √NċCI(f)}, where CI(f) is the size of max intersection of a 0- and a 1-certificate set. Again this implies that Alb's cannot improve the best known lower bound for some specific problems such as AND-OR TREE, whose precise quantum query complexity is still open. Finally, we generalize the three known Alb's and give a new Alb style lower bound method, which may be easier to use for some problems.