Optimal quantum key distribution networks: capacitance versus security
- URL: http://arxiv.org/abs/2312.04221v3
- Date: Fri, 17 May 2024 12:58:30 GMT
- Title: Optimal quantum key distribution networks: capacitance versus security
- Authors: Lorenzo Cirigliano, Valentina Brosco, Claudio Castellano, Claudio Conti, Laura Pilozzi,
- Abstract summary: We propose a strategy for the optimization of trusted-relays based networks that intertwines classical network approaches and quantum information theory.
Specifically, by defining a quantum communication efficiency functional, we identify the optimal quantum communication connections through the network by balancing security and the quantum communication rate.
The optimized network is then constructed as the network of the maximal quantum communication efficiency connections and its performance is evaluated by studying the scaling of average properties as functions of the number of nodes and of the network spatial extension.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The rate and security of quantum communications between users placed at arbitrary points of a quantum communication network depend on the structure of the network, on its extension and on the nature of the communication channels. In this work we propose a strategy for the optimization of trusted-relays based networks that intertwines classical network approaches and quantum information theory. Specifically, by suitably defining a quantum communication efficiency functional, we identify the optimal quantum communication connections through the network by balancing security and the quantum communication rate. The optimized network is then constructed as the network of the maximal quantum communication efficiency connections and its performance is evaluated by studying the scaling of average properties as functions of the number of nodes and of the network spatial extension.
Related papers
- Resource Placement for Rate and Fidelity Maximization in Quantum Networks [8.707824275470188]
Existing classical optical network infrastructure cannot be immediately used for quantum network applications due to photon loss.
We present a comprehensive framework for network planning, aiming to efficiently distributing quantum repeaters across existing infrastructure.
We explore the effect of quantum memory multiplexing within quantum repeaters, as well as the influence of memory coherence time on quantum network utility.
arXiv Detail & Related papers (2023-08-30T18:45:21Z) - Quantum walk-based protocol for secure communication between any two
directly connected nodes on a network [2.501693072047969]
This work presents an algorithm that generates entanglement between any two directly connected nodes of a quantum network.
It paves the way for private inter-node quantum communication channels in the network.
We show that after implementation, the probability of the walker being at all nodes other than the source and target is negligible.
arXiv Detail & Related papers (2022-11-23T13:19:41Z) - 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) - Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations.
The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
arXiv Detail & Related papers (2022-05-05T03:49:19Z) - 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) - The Computational and Latency Advantage of Quantum Communication
Networks [70.01340727637825]
This article summarises the current status of classical communication networks.
It identifies some critical open research challenges that can only be solved by leveraging quantum technologies.
arXiv Detail & Related papers (2021-06-07T06:31:02Z) - 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) - Quantum communication capacity transition of complex quantum networks [1.14219428942199]
For highly connected networks, we identify a threshold transition in the capacity as the density of network nodes increases.
For scale-free networks, the end-to-end capacity saturates to constants as the number of nodes increases, and always decays with the distance.
Our results are based on capacity evaluations, therefore the minimum density requirement for an appreciable capacity applies to any general protocols of quantum networks.
arXiv Detail & Related papers (2020-11-14T21:42:04Z)
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.