arXiv (All)
open access
One-shot Routing in Quantum Networks
Distributed quantum computation requires many entangled pairs to be available simultaneously, so routing must optimize fidelity from a fixed, short-lived set of network resources rather than the rate of pairs accumulated over time. We formulate this one-shot routing problem for heterogeneous Werner-
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
- Privacy in continuous-variable distributed quantum sensing#927158
- Multi-Pair Fidelity-Aware Rate Allocation in a Quantum Network: Approximation Schemes#447907
- Quantum MeanFlow: single-shot generative sampling on NISQ hardware#822580
- QuPID: Quantum Parameter-Efficient Input-Dependent Retrieval Adaptation for Medical RAG#1118063
- Observational Indistinguishability and Integrity Blind Regions in Hybrid Quantum-Classical Workflows#1123537
Record · ID 1077679
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