Quantum approximate counting can match the optimal query complexity without the quantum Fourier transform, using only Grover iterations and classic coin-estimation analysis.
Title resolution pending
1 Pith paper cite this work, alongside 18 external citations. Polarity classification is still indexing.
1
Pith paper citing it
18
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2019 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Quantum Approximate Counting, Simplified
Quantum approximate counting can match the optimal query complexity without the quantum Fourier transform, using only Grover iterations and classic coin-estimation analysis.