most citedA Lower Bound for Quantum Phase Estimation

21 citations · 28 across the 2 of their papers we have counts for

collaborators
Showing quant-phShow all

2 papers · 1 filter

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…

quant-ph2003★ 7 cited

Approximation of Various Quantum Query Types

Arvid J. Bessen

Query complexity measures the amount of information an algorithm needs about a problem to compute a solution. On a quantum computer there are different realizations of a query and…