arXiv (All)
open access
New lower bounds for CDS and $f$-routing
Understanding the entanglement cost of non-local quantum computation (NLQC) is relevant to complexity theory, cryptography, quantum gravity, and related areas. A central special case is $f$-routing, motivated in part by quantum position verification. Proving lower bounds on its entanglement cost in
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
- New lower bounds for CDS and $f$-routing#1028594
- The Persistent Challenge of Data Locality in the Post-Exascale Era#1146695
- A strictly positive lower bound on the thermodynamic cost of running a Boolean circuit#609776
- Adaptive Differential Evolution and Multistart Search for Noisy QAOA Optimization#1048925
- Quantum-gravity-inspired Alcubierre warp-drive geometries#972613
Record · ID 1050472
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