R. Venkateswaran

Quantum Approximate Counting with Nonadaptive Grover Iterations

2021 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

Approximate Counting refers to the problem where we are given query access to a function f : [N] → {0,1}, and we wish to estimate K = #{x : f(x) = 1} to within a …