3 papers
quant-ph2021
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…
quant-ph2019
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…
quant-ph2018
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…