Problem
Research questions and friction points this paper is trying to address.
QKD Networks
Network Topologies
Reliability
Efficiency
Network Topologies for QKD Networks
π€ AI Summary
ζ¬ζη η©ΆδΊιεε―ι₯εεη½η»ηζζη»ζοΌιθΏεΎη»ζ葨达ε
Άε―ι ζ§εζηηΉζ§οΌεΉΆζεΊζ建倧ει«ζη½η»ηζΉζ³γ
π Abstract
Quantum key distribution (QKD) is a method for distributing cryptographic keys between remote endpoints, enjoying security based on quantum physics. This paper makes a first step towards studying topologies for QKD networks. QKD networks imply several required characteristics for their reliability and efficiency. We express such properties in terms of graph structure. For the comparison of potential graphs, we describe cost functions that allow us to identify families of graphs that are reliable and efficient. To make the discussion realistic, we summarize representative field-reported QKD performance numbers and illustrate the sensitivity of secret-key rate (SKR) to a few dB of additional loss. Last, we present methods to construct large efficient graphs through connecting smaller graphs.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Quantum Key Distribution
Network Topologies
Graph Structure
Cost Functions
Efficient Graphs
π Similar Papers
No similar papers found.
