15 citations · 26 across the 4 of their papers we have counts for
5 papers
Quantum Lazy Training
Erfan Abedi, Salman Beigi, Leila Taghavi
In the training of over-parameterized model functions via gradient descent, sometimes the parameters do not change significantly and remain close to their initial values. This phen…
Simplified Quantum Algorithm for the Oracle Identification Problem
Leila Taghavi
In the oracle identification problem we have oracle access to bits of an unknown string of length , with the promise that it belongs to a known set . Th…
Time and Query Optimal Quantum Algorithms Based on Decision Trees
Salman Beigi, Leila Taghavi, Artin Tajdini
It has recently been shown that starting with a classical query algorithm (decision tree) and a guessing algorithm that tries to predict the query answers, we can design a quantum…
Quantum Speedup Based on Classical Decision Trees
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…
Span Program for Non-binary Functions
Salman Beigi, Leila Taghavi
Span programs characterize the quantum query complexity of binary functions up to a constant factor. In this paper we generalize the notion of s…