arXiv (All)
open access
Strong Selective and List-Decoding Direct Product Theorems for Quantum Query Complexity
Quantum strong direct-product theorems for specific functions have been known for nearly two decades. These have been extended to general results for function computation and state generation. The proofs of these results use a version of the multiplicative adversary method that does not naturally ex
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
- Exponential strong converse for blind quantum data compression#1142929
- Centralised multi link measurement compression with side information#1011934
- Need for Coherent Access in Constructing Quantum Cryptography#1154562
- Need for Coherent Access in Constructing Quantum Cryptography#1136750
- Algebraic Kolmogorov--Arnold representation theorem for quantum measurement#1083111
Record · ID 1062565
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