arXiv (OAI Expanded)
open access
Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths
A path in a quantum network is a chain of repeaters that distributes entanglement between two users. Selecting a path requires balancing the rate and quality (e.g., fidelity) of the delivered entanglement, but these quantities, unlike standard routing metrics, compose non-additively. The problem is
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
- Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths#919295
- Priority-Aware Routing for Quantum Networks:Integrating Coherence-Time Constraints into Scheduling#1142981
- Priority-Aware Routing for Quantum Networks:Integrating Coherence-Time Constraints into Scheduling#1136803
- High-Rank Encoding Can Improve Approximate Quantum Error Correction#820789
- Optimal Entanglement Routing in Quantum Repeater Chains: Beyond Fixed Operation Order and Purification Schedule#1132407
Record · ID 1110575
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