arXiv (OAI Expanded)
open access
Oracle problems as communication tasks and optimization of quantum algorithms
Quantum query complexity studies the number of queries needed to learn some property of a black box. A closely related question is how well an algorithm can succeed with this learning task using only a fixed number of queries. In this work, we propose measuring an algorithm's performance using the m
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
- Oracle problems as communication tasks and optimization of quantum algorithms#924405
- Learning parameter curves in feedback-based quantum optimization algorithms#1144750
- Quantum Query Advantage Requires Space#1077425
- Quantum Approximate Counting with Bernoulli Oracles#984515
- Noisy Quantum Query Complexity via Fractional Block Sensitivity#1155441
Record · ID 920174
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