Quantum counting, and a relevant sign
arXiv:2310.07428 · doi:10.1007/978-3-032-16206-9_3
Abstract
Two indispensable algorithms in an introductory course on Quantum Computing are Grover's search algorithm and quantum phase estimation. Quantum counting is a simple yet beautiful blend of these two algorithms, and it is therefore an attractive topic for a student project in such a course. However, a sign that is irrelevant when implementing Grover's algorithm becomes relevant. We briefly review these algorithms, highlighting the aforementioned sign.
7 pages, 3 figures + Supplementary Material (qiskit code); v2: minor improvements, version to be published in MATRIX Annals