Skip to content

Query-Optimal Quantum Minimum Finding from Numerical Estimators

Egil Bae

quant-pharXiv:2611.26606

Abstract

We propose a quantum minimum-finding algorithm for objectives accessed via numerical estimators that avoids the logarithmic query overhead of amplifying the confidence of estimates before the search. A coherent estimator that is -accurate with probability at least 2/3 on each of N labels suffices to find a 2-optimal label using O( N) base-estimator queries at constant confidence. The query bound and the additive-error constant are separately worst-case optimal. More generally, suppose a preparation assigns probability mass at least a known p to objective values at most a. Without knowing a or the prepared distribution, our algorithm returns a candidate and an estimate v such that, jointly with constant probability, v is -accurate for the candidate and v a+. The algorithm uses O(p-1/2) queries to each of the preparation and estimator oracles in the worst case, and the selected candidate can be retained as a quantum state. For preparation width sP and estimator workspace width w, it requires O(sP+w+(4/p)) qubits, independently of the requested confidence. Applications give worst-case optimal Θ( N/η) queries for selecting an η-optimal bounded expectation, and guided ground-energy estimation using O(ω-1) preparations and O((ωη)-1) elementary controlled-evolution queries at constant confidence, where ω is a lower bound on the guiding state's ground-space amplitude overlap.

Create a lesson