With carefully chosen multi-phase oracles, a two-solution Grover search maintains high success probability over a wider range of iteration counts than the standard deterministic algorithm, according to simulations up to register size 775.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Grover's search with an oracle distinguishing between solutions
With carefully chosen multi-phase oracles, a two-solution Grover search maintains high success probability over a wider range of iteration counts than the standard deterministic algorithm, according to simulations up to register size 775.