15 citations · 26 across the 4 of their papers we have counts for
1 paper · 1 filter
Salman Beigi, Leila Taghavi
Lin and Lin have recently shown how starting with a classical query algorithm (decision tree) for a function, we may find upper bounds on its quantum query complexity. More precise…