41 citations · 69 across the 3 of their papers we have counts for
Showing 2005 · quant-phShow all
2 papers · 2 filters
quant-ph2005
A Lower Bound for the Sturm-Liouville Eigenvalue Problem on a Quantum Computer
Arvid J. Bessen
We study the complexity of approximating the smallest eigenvalue of a univariate Sturm-Liouville problem on a quantum computer. This general problem includes the special case of so…
quant-ph2005★ 21 cited
A Lower Bound for Quantum Phase Estimation
Arvid J. Bessen
We obtain a query lower bound for quantum algorithms solving the phase estimation problem. Our analysis generalizes existing lower bound approaches to the case where the oracle Q i…