Improved Quantum Query Upper Bounds Based on Classical Decision Trees

Nikhil S. Mande
Arkadev Chattopadhyay
Tuesday, 26 Apr 2022, 16:00 to 17:00
A-201 (STCS Seminar Room)
In the first part of this talk we will discuss the notion of rank of decision trees, which is essentially the largest depth of a complete subtree embedded in the initial tree. We observe the equivalence of rank and "guessing complexity," a measure of decision trees used by Lin and Lin [Theory of Computing'16] and Beigi and Taghavi [Quantum'20] to give upper bounds on quantum query complexity of functions based on classical query algorithms for them.

In the second part of the talk we will first note that the best speed-up obtainable using the approach of Beigi and Taghavi is captured by a polynomial optimization program on assignments of real weights to edges of the underlying classical decision tree. We then give a recursive expression for the optimal solution to this program and bound the optimum from above in terms of natural measures of the decision tree.

Based on joint work with Arjan Cornelissen and Subhasree Patro (