arXiv (All)
open access
Unbounded degree overhead for Alice-conditioned quantum Bell certificates
Requiring each sum-of-squares term to involve only one of Alice's measurement questions can impose an unbounded certification cost. In the simplest Bell scenario, we prove that no finite level of the Alice-conditioned NPA hierarchy contains all standard level-two Bell certificates. An explicit famil
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
- A Noise Operator Approach to Quantum Query Complexity and Time-Space Tradeoff Lower Bounds#1157308
- AlchemQ: Proof-Carrying Quantum Circuit Optimization with Per-Result Equivalence Certificates#1013761
- Unifying communication paradigms in measurement-based delegated quantum computing#163159
- On the Construction of Trapdoor Claw-Free Functions with Certifiable Key#1061447
Record · ID 997073
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