# Quantum Approximate Counting, Simplified

Patrick Rall

symposium on discrete algorithms, pp. 24-32, 2019.

Cited by: 10|Views3

Abstract:

In 1998, Brassard, Hoyer, Mosca, and Tapp (BHMT) gave a quantum algorithm for approximate counting. Given a list of $N$ items, $K$ of them marked, their algorithm estimates $K$ to within relative error $\varepsilon$ by making only $O\left( \frac{1}{\varepsilon}\sqrt{\frac{N}{K}}\right)$ queries. Although this speedup is of "Grover" typ...More

Code:

Data:

Full Text
Bibtex