arXiv (All)
open access
Optimal inequalities for completely bounded polynomials and the limitations of quantum query algorithms
We consider the problem of establishing limitations on the power of quantum query algorithms via the completely bounded polynomial method. In particular, we prove several optimal functional inequalities involving different notions of completely bounded polynomials. These inequalities lead to limitin
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
- Quantum lower bounds for convex optimization and real matrix-vector query problems#972730
- Quantum Query Complexity Beyond the Worst Case#1130235
- A note on the quantum Wielandt inequality#139157
- Complexity Amplification from Compression in Quantum Random Access Optimization#975154
- A Noise Operator Approach to Quantum Query Complexity and Time-Space Tradeoff Lower Bounds#1157308
Record · ID 972144
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