Yancheng Wu

Matrix-Free GPU Semidefinite Programming for Quantum Ordered Search at the k=6 Frontier

Quantum computation offers the potential for a significant constant-factor speedup for the Ordered Search Problem (OSP). A classical construction is the $k$-query quantum ordered search algorithm, which can exactly search an $N$-element ordered list and achieves a query complexity improvement of a f…