Abstract
The polynomial method and Ambainis's lower bound method are two main quantum lower bound techniques. Recently Ambainis showed that the polynomial method is not tight. The present paper aims at studying the limitation of Ambainis's lower bounds. We first give a generalization of the three known Ambainis's lower bound theorems. Then it is shown that all these four Ambainis's lower bounds have an upper bound, which is in terms of certificate complexity. This implies that for some problems such as TRIANGLE, $k$-CLIQUE, and BIPARTITE/GRAPH MATCHING whose quantum query complexities are still open, the best known lower bounds cannot be further improved by using Ambainis's techniques. Another consequence is that all the Ambainis's lower bounds are not tight. Finally, we show that for total functions, this upper bound for Ambainis's lower bounds can be further improved. This also implies limitation of Ambainis's method on some specific problems such as AND-OR TREE, whose precise quantum complexity is still unknown.

This publication has 9 references indexed in Scilit: