arXiv (All)
open access
Distributional Variants of the Aaronson-Ambainis Conjecture
A longstanding conjecture in quantum complexity theory asserts that, under the uniform input distribution, quantum query algorithms can be polynomially simulated by classical query algorithms. More precisely, the acceptance probability of any quantum query algorithm can be approximated, on average 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
- Noisy Quantum Query Complexity via Fractional Block Sensitivity#1155441
- Information capacity of quantum statistics: Fock-state tests of a discrete binary-sequence model on cloud photonic quantum processors#1012341
- Time-space lower bounds for breaking quantum cryptography#1160915
- Time-space lower bounds for breaking quantum cryptography#1157449
- Distinctness threshold for pseudorandom unitaries#925432
Record · ID 1129919
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