Filters
Results 1 - 1 of 1
Results 1 - 1 of 1.
Search took: 0.02 seconds
[en] We compute lower bounds for the exact quantum query complexity of a ternary function f. The lower bound is of order O(log3(n)). In case f is symmetric on a sphere then the lower bound is of order O(√(n)). This work is a natural continuation of the work of Beals, Buhrman, Cleve, Mosca, and de Wolf on lower limits for binary functions
Journal
