arXiv:2609.05679 · v2

Quantum lower bounds for convex optimization and real matrix-vector query problems

首次提交 2026-09-05 03:23

版本更新 2026-10-29 05:32

雷达观测 2026-10-30 11:25

摘要

We (the author and the AI systems that did the heavy lifting) show that the quantum query complexity of minimizing a convex function over a convex subset of $\mathbb{R}^n$ with evaluation and membership queries is $\tildeΩ(n)$, nearly matching the best known upper bound. In particular, we show this even for quadratic minimization, which is equivalent to inverting an $n \times n$ real matrix using matrix-vector queries. We also show linear or nearly linear lower bounds on the quantum query complexity of computing the trace, the sign of the determinant, and the magnitude of the determinant of a real matrix in the matrix-vector query model. We use a novel quantum lower bound technique, the determinantal witness method, based on identifying a witness whose Fourier transform vanishes on low-rank matrices and that correlates well with the function being computed.

作者备注：29 pages. v2: additional discussion of technical approach in introduction, minor corrections