Spanning-tree packing yields an optimal protocol for conference key generation from pairwise QKD links in arbitrary quantum network topologies.
Quantum Internet: Technologies, Protocols, and Research Challenges
3 Pith papers cite this work. Polarity classification is still indexing.
abstract
As the field of the quantum internet advances, a comprehensive guide to navigate its complexities has become increasingly crucial. While quantum computing shares foundational principles with the quantum internet, distinguishing between the two is essential for further development and deeper understanding. This work systematically introduces the quantum internet by discussing its importance, core components, operational mechanisms, anticipated timeline for viability, key contributors, major challenges, and future directions. Additionally, it presents the fundamental concepts of quantum mechanics that underpin the technology, offering a clear and targeted overview intended for researchers and industry professionals and laying the groundwork for future innovations and research in the field.
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
Proposes a heterogeneous quantum repeater network architecture using recursive designs and RuleSets with a new bridging building block, but states that full-scale resource trade-off analysis remains future work.
Upper bounds on distillable conference key in pair-entangled networks are derived depending on topology and entanglement, with tightness proven and optimality of pairwise distillation plus merging shown for specific cases.
citing papers explorer
-
Spanning-tree-packing protocol for conference key propagation in quantum networks
Spanning-tree packing yields an optimal protocol for conference key generation from pairwise QKD links in arbitrary quantum network topologies.
-
Resource Management in Heterogeneous Quantum Repeater Networks
Proposes a heterogeneous quantum repeater network architecture using recursive designs and RuleSets with a new bridging building block, but states that full-scale resource trade-off analysis remains future work.
-
Bounds on quantum conference key agreement in pair-entangled networks
Upper bounds on distillable conference key in pair-entangled networks are derived depending on topology and entanglement, with tightness proven and optimality of pairwise distillation plus merging shown for specific cases.