arXiv (All)
open access
Noisy Quantum Query Complexity via Fractional Block Sensitivity
We study quantum query complexity under several models of imperfect oracle access, and develop lower bounds through a common framework based on fractional block sensitivity (\(\fbs\)). For a negligent oracle that applies the correct query with probability \(1-p\), we prove a lower bound in terms o
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
- Metrological Benchmarking of Random Quantum Circuits#1144193
- Distributional Variants of the Aaronson-Ambainis Conjecture#1129919
- Routing Anonymity and Identifiability of Noisy Quantum Hardware#343475
- Oracle problems as communication tasks and optimization of quantum algorithms#924405
- Oracle problems as communication tasks and optimization of quantum algorithms#920174
Record · ID 1155441
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