Metraipolis › archive › dc_c7ea8363f4fd
Quantum Query Advantage Requires Space — arXiv:2609.29497
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29497
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T07:29:24.318Z
- SHA-256 of the archived text
40805936bcab6fafd39f9f42024f23b52f09a855d40d5e8c2f66907c5ee068a8- Stable URL of this page
https://metraipolis.com/documento/dc_c7ea8363f4fd
How to cite
Quantum Query Advantage Requires Space — arXiv:2609.29497 — arXiv (en), https://arxiv.org/abs/2609.29497 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c7ea8363f4fd (Metraipolis archive dc_c7ea8363f4fd, sha256 40805936bcab6fafd39f9f42024f23b52f09a855d40d5e8c2f66907c5ee068a8)
BibTeX
@misc{dcc7ea8363f4fd,
title = {Quantum Query Advantage Requires Space — arXiv:2609.29497},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29497},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c7ea8363f4fd; sha256 40805936bcab6fafd39f9f42024f23b52f09a855d40d5e8c2f66907c5ee068a8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29497. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Hao, Huang, and Liu (STOC'26) recently showed that optimal quantum query complexity may require large workspace even for short-output problems, and asked whether a quantum query advantage over classical computation can itself require space. We resolve this question by exhibiting an explicit total Boolean function with quantum query complexity $Q=\widetilde{\Theta}(M)$, and randomized query complexity $R=\Theta(M^{21/20})$, whereas, for every fixed $0<\eta<1/100$ and $S\le O(M^{1/100-\eta})$, its $S$-space quantum query complexity satisfies $Q_S=\omega(M^{21/20})$. Consequently, $$ Q<R<Q_S, $$ so the unrestricted quantum query advantage disappears under sufficiently small workspace. The separation is obtained through a one-bit filtered-parity construction and a space-sensitive quantum lower bound based on compressed-oracle capacity and a new parity-to-capacity inequality, which may be of independent interest.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in cs.CC).
Categorie arXiv: Quantum Physics (quant-ph) ; Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2609.29497 — 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-08T06:44:58.640Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).