arXiv (All)
open access
Tight bounds for hybrid quantum-classical query algorithms
We study hybrid quantum-classical algorithms in the query model. The computation consists of quantum subroutines that make at most $q$ oracle queries; between subroutines, all qubits are measured and discarded. We prove matching upper and lower bounds for several problems in this model: (i) (Unbia
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 Query Advantage Requires Space#1077425
- A Catalytic Algorithm for Transposing Unknown Qutrit Unitaries with Tight Query Bounds#1296671
- Quantum Submodular Maximization#1200211
- Binary Optimization of Measurement Groupings for Quantum Energy Estimation#1234706
- Privacy in continuous-variable distributed quantum sensing#927158
Record · ID 1215887
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