arXiv (All)
open access
Improved Quantum Query Bounds for Boolean Matrix Product Verification
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Analytic Maximal Violation of Extended MABK Inequalities for Generalized GHZ States#822452
- Quantum Approximate Counting with Bernoulli Oracles#984515
- Complexity Amplification from Compression in Quantum Random Access Optimization#975154
- Quantum Query Complexity Beyond the Worst Case#1130235
- Optimal inequalities for completely bounded polynomials and the limitations of quantum query algorithms#972144
Record · ID 1154445
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive