Metraipolis › archive › dc_28ee3ce50bd1
Quantum lower bounds for convex optimization and real matrix-vector query problems — arXiv:2609.05679
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.05679
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:29:49.444Z
- SHA-256 of the archived text
32eaa25229407d9911bcacc89929596cc04e4078044202248fdb8444d172bfb1- Stable URL of this page
https://metraipolis.com/documento/dc_28ee3ce50bd1
How to cite
Quantum lower bounds for convex optimization and real matrix-vector query problems — arXiv:2609.05679 — arXiv (en), https://arxiv.org/abs/2609.05679 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_28ee3ce50bd1 (Metraipolis archive dc_28ee3ce50bd1, sha256 32eaa25229407d9911bcacc89929596cc04e4078044202248fdb8444d172bfb1)
BibTeX
@misc{dc28ee3ce50bd1,
title = {Quantum lower bounds for convex optimization and real matrix-vector query problems — arXiv:2609.05679},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.05679},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_28ee3ce50bd1; sha256 32eaa25229407d9911bcacc89929596cc04e4078044202248fdb8444d172bfb1},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05679. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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\Omega(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.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.OC).
Categorie arXiv: Quantum Physics (quant-ph) ; Data Structures and Algorithms (cs.DS); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.05679 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:09:21.732Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).