Pith. sign in

REVIEW 1 cited by

Quantum Counting

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/9805082 v1 pith:T7WZ7QDH submitted 1998-05-27 quant-ph

Gilles Brassard (1) , Peter Hoyer (2) , Alain Tapp (1) ((1) Universite de Montreal , (2) Odense University) This is my paper · ORCID
classification quant-ph
keywords quantumgroveralgorithmamplitudeclassicalcountingobtainedsearching
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study some extensions of Grover's quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic speedup obtained by the quantum searching algorithm over classical brute force can still be obtained for a large family of search problems for which good classical heuristics exist. Finally, as our main result, we combine ideas from Grover's and Shor's quantum algorithms to perform approximate counting, which can be seen as an amplitude estimation process.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Nested Grover's Algorithm for Tree Search

    quant-ph 2025-09 reject novelty 4.0 of 10

    A nested Grover algorithm for tree search claims cost O(m*2^(m/4)) using partial candidate solutions, but the speedup relies on an unexamined assumption that the candidate set contains the solution.

Pith tools