Metraipolis › archive › dc_0fa469909a8f

Improved Quantum Query Bounds for Boolean Matrix Product Verification — arXiv:2609.40180

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.40180
License (as archived)
CC0-1.0
Archived
2026-10-07T15:17:18.821Z
SHA-256 of the archived text
5dde5400d1605f90e99e1e920879ad8287ebcf86265a20c458479f05644ee53b
Stable URL of this page
https://metraipolis.com/documento/dc_0fa469909a8f

How to cite

Improved Quantum Query Bounds for Boolean Matrix Product Verification — arXiv:2609.40180 — arXiv (en), https://arxiv.org/abs/2609.40180 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0fa469909a8f (Metraipolis archive dc_0fa469909a8f, sha256 5dde5400d1605f90e99e1e920879ad8287ebcf86265a20c458479f05644ee53b)
BibTeX
@misc{dc0fa469909a8f,
  title = {Improved Quantum Query Bounds for Boolean Matrix Product Verification — arXiv:2609.40180},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.40180},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0fa469909a8f; sha256 5dde5400d1605f90e99e1e920879ad8287ebcf86265a20c458479f05644ee53b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.40180. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove the first non-trivial upper bound for the quantum query complexity of Boolean Matrix Product Verification ($\mathsf{BMPV}$), answering a longstanding open question in quantum query complexity. For $n\times n$ matrices, our upper bound is $\widetilde O(n^{17/12})$, improving on the standard $O(n^{3/2})$ bound obtained using Grover search by Buhrman and Špalek [SODA 2006]. We complement this result by showing an $\Omega(n^{5/4})$ lower bound, which improves over the previous best known lower bound of $\widetilde\Omega(n^{19/18})$ by Childs, Kimmel, and Kothari [ESA 2012]. Our approach centers on a connection with Orthogonal Vectors ($\mathsf{OV}$), which asks whether an indexed list of $n$ Boolean vectors of dimension $n$ contains two vectors with disjoint supports. In particular, we prove equivalences between $\mathsf{OV}$ and $\mathsf{BMPV}$ and establish the above bounds for $\mathsf{OV}$. We also prove a tight $\widetilde \Theta(n^{3/2})$ bound for a variant of $\mathsf{BMPV}$ that asks whether the product contains a given row vector. Together, these results imply a polynomial separation between the quantum query complexities of deciding whether a graph has radius at most two and whether it has diameter at most two.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in cs.DS).
Categorie arXiv: Quantum Physics (quant-ph) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.40180 — 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-07T14:50:37.675Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).