Dynamic Routing for Quantum Key Distribution Networks

• URL: http://arxiv.org/abs/2212.03144v1
• Date: Tue, 6 Dec 2022 17:17:12 GMT
• Title: Dynamic Routing for Quantum Key Distribution Networks
• Authors: Omar Amer, Walter O. Krawec, Victoria U. Manfredi, and Bing Wang
• Abstract summary: In this paper, we consider quantum key distribution (QKD) in a quantum network with both quantum repeaters and a small number of trusted nodes. We develop a new dynamic routing strategy that makes routing decisions based on the current network state, as well as evaluate various classical/quantum post-processing techniques.
• Score: 2.913123182364138
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we consider quantum key distribution (QKD) in a quantum network with both quantum repeaters and a small number of trusted nodes. In contrast to current QKD networks with only trusted nodes and the true Quantum Internet with only quantum repeaters, such networks represent a middle ground, serving as near-future QKD networks. In this setting, QKD can be efficiently and practically deployed, while providing insights for the future true Quantum Internet. To significantly improve the key generation efficiency in such networks, we develop a new dynamic routing strategy that makes routing decisions based on the current network state, as well as evaluate various classical/quantum post-processing techniques. Using simulations, we show that our dynamic routing strategy can improve the key rate between two users significantly in settings with asymmetric trusted node placement. The post-processing techniques can also increase key rates in high noise scenarios. Furthermore, combining the dynamic routing strategy with the post-processing techniques can further improve the overall performance of the QKD network.

Related papers

• Routing algorithm within the multiple non-overlapping paths approach for quantum key distribution networks [0.70224924046445]
  We develop a novel key routing algorithm for quantum key distribution (QKD) networks. We present the results of testing the algorithm on two QKD network models consisting of 6 and 10 nodes.
  arXiv  Detail & Related papers  (2024-11-12T14:04:31Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Quantum key distribution in a packet-switched network [0.0]
  We outline a three-step approach for key rate optimization in a packet-switched network. Our simulated results show that practical key rates may be achieved in a sixteen-user network with no optical storage capacity. We find that implementing cut-off storage times in a strategy analogous to real-time selection in free-space QKD can significantly enhance performance.
  arXiv  Detail & Related papers  (2023-02-27T17:48:17Z)
• Quantization-aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks [58.195261590442406]
  We study the problem of training and certifying adversarially robust quantized neural networks (QNNs) Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization. We present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs.
  arXiv  Detail & Related papers  (2022-11-29T13:32:38Z)
• DQC$^2$O: Distributed Quantum Computing for Collaborative Optimization in Future Networks [54.03701670739067]
  We propose an adaptive distributed quantum computing approach to manage quantum computers and quantum channels for solving optimization tasks in future networks. Based on the proposed approach, we discuss the potential applications for collaborative optimization in future networks, such as smart grid management, IoT cooperation, and UAV trajectory planning.
  arXiv  Detail & Related papers  (2022-09-16T02:44:52Z)
• Optimization of QKD Networks with Classical and Quantum Annealing [0.7827586118586438]
  Quantum Key Distribution (QKD) hardware is used in a tier 1 provider network. The ensemble of QKD systems needs to be able to exchange as many encryption keys. Redundancy and latency requirements add additional boundary conditions.
  arXiv  Detail & Related papers  (2022-06-28T16:08:12Z)
• An Efficient Routing Protocol for Quantum Key Distribution Networks [9.203625000707856]
  Quantum key distribution (QKD) can provide point-to-point information-theoretic secure key services for two connected users. QOLSR considerably improves quantum key utilization in QKD networks through link-state awareness and path optimization.
  arXiv  Detail & Related papers  (2022-04-29T07:37:45Z)
• An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters [64.48099252278821]
  We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle. In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes. We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
  arXiv  Detail & Related papers  (2022-02-08T03:24:06Z)
• Entanglement Rate Optimization in Heterogeneous Quantum Communication Networks [79.8886946157912]
  Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond. Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware. In quantum networks, entanglement is a key resource that allows for data transmission between different nodes.
  arXiv  Detail & Related papers  (2021-05-30T11:34:23Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Efficient Routing for Quantum Key Distribution Networks [3.5766737249359544]
  We model the performance of the E91 entanglement based QKD protocol when operating in a network consisting of both quantum repeaters and trusted nodes. We propose a number of routing protocols for this network and compare their performance under different usage scenarios.
  arXiv  Detail & Related papers  (2020-05-25T21:03:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.