A quantum switch's capacity region is characterized for general topologies, and a Markov-decision-process-based policy called ARE is proven asymptotically throughput-optimal.
A Brief Introduction to Quantum Network Control
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Quantum networking is an emerging area with the potential to transform information processing and communications. In this paper, we present a brief introduction to quantum network control, an area in quantum networking dedicated to designing algorithms for distributing entanglement (i.e., entangled qubits). We start by explaining what qubits and entanglement are and how they furnish quantum network control operations such as entanglement swapping and teleportation. With those operations, we present a model for distributing entanglement in a multi-hop quantum network to enable applications such as quantum key distribution and distributed quantum computing. We conclude the paper by presenting open research problems in the field, including the characterization of the quantum network capacity region and the design of throughput-optimal policies.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Optimal Scheduling in a Quantum Switch
A quantum switch's capacity region is characterized for general topologies, and a Markov-decision-process-based policy called ARE is proven asymptotically throughput-optimal.