arXiv:2609.34293
Optimal Quantum Algorithms for Ordered Search
Joseph Carolan, Andrew M. Childs
Abstract
Ordered search is the problem of locating a target element in a sorted list of size $n$ using comparison queries. Classically, binary search requires $\lceil \log_2 n\rceil$ queries, which is optimal. Quantum algorithms offer a constant-factor speedup, but the precise constant has been a longstanding open question. We close this gap by exhibiting two new quantum algorithms for ordered search, each using the optimal $\frac{1}π\ln n+o(\log n)$ queries. The first, discovered by Claude Fable 5, is a simple zero-error algorithm derived from a continuum relaxation of the problem. The second, discovered by GPT-5.6-Sol (informed by Claude's zero-error algorithm), is an exact algorithm based on an analytic solution of the polynomial program of Farhi, Goldstone, Gutmann, and Sipser.
AI Summary
Ordered search asks for the transition point in a sorted Boolean list of length $n$ using comparison queries. Quantum algorithms provide a constant-factor improvement over classical binary search, but the optimal leading constant had remained undetermined. This paper establishes $Q_E(\mathrm{OrderedSearch}_n)=\frac{1}{\pi}\ln n+o(\log n)$, matching the existing exact-query lower bound $\frac{1}{\pi}(\ln n-1)$. The leading term is approximately $0.221\log_2 n$, versus the previous exact upper bound of approximately $0.365\log_2 n$. Two constructions achieve this constant. A zero-error algorithm uses $\frac{1}{\pi}\ln n+O((\ln n)^{3/4})$ expected queries. It works in a continuum representation, alternating the comparison phase oracle with a fixed Fourier-basis reflection. Mellin-transform analysis shows that a broad wave packet moves by approximately $\pi$ per query in logarithmic position, eventually localizing around the transition point. Measurement, candidate verification, and restarting yield zero error. The exact worst-case construction gives an analytic feasible path through the nonnegative Laurent-polynomial formulation of ordered search. It alternately updates reversal-symmetric and reversal-antisymmetric coefficient components using mixtures of a hyperbolic-profile polynomial family. Convolution inequalities establish progress approaching $\pi$ per query in logarithmic rate; two final queries remove the remaining coefficients exactly. The results determine the leading query constant, not the lower-order terms: an additive $O(1)$ remainder remains open. The optimal dependence on allowed error also remains unresolved. Finite-size performance is not optimized, and query efficiency does not establish time efficiency; implementing the exact construction relies on Fejér–Riesz factorization.
The manuscript was prepared with assistance from GPT-5.6-Sol, GPT-6-Astra, and Claude Fable~5, and edited by the authors.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.