Finding Stationary Points by Comparisons
Finding mathematical sweet spots using only yes-or-no comparisons
Researchers developed a new method to find stationary points—places where functions flatten out—when you can only ask a computer "which of these two values is bigger?" instead of calculating exact function values. The approach uses roughly 10,000 times fewer queries than naive methods for typical problem sizes, and a quantum version cuts that further by a factor equal to the square root of the problem's dimensions.
Many real optimization problems can only be queried through comparisons—ranking models, A/B testing, or noisy systems where you can compare outcomes but not measure them precisely. This algorithm makes it practical to find good solutions in those scenarios. The quantum version hints at how quantum computers might eventually offer speedups for real-world optimization beyond brute-force advantage.