A quantum algorithm combining fixed-point search and amplitude estimation approximates the probability that a random input has a satisfying response, with a quadratic query-complexity speedup when solution fractions are exponentially small.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum algorithm for approximating the expected value of a random-exist quantified oracle
A quantum algorithm combining fixed-point search and amplitude estimation approximates the probability that a random input has a satisfying response, with a quadratic query-complexity speedup when solution fractions are exponentially small.