Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
Quantum key distribution (QKD) promises information theoretic security. However, the distances over which complete security can be achieved are fundamentally limited in the absence of quantum repeaters. Thus, a key question is how to build a quantum network (QN) given this restriction. One paradigm that has been considered is trusted node (TN) quantum networks where intermediate trusted nodes are used as relays of quantum keys. Another paradigm is to route key channels through intermediate nodes optically, either through wavelength or fiber switching, thus avoiding the use of TNs. In both of these paradigms, a QKD receiver or transmitter at a specific node can be shared between multiple QKD transmitters or receivers at different nodes in order to reduce the overall costs; this sharing can be enabled via an optical switch. In this paper, we investigate the two paradigms for designing QNs. In the TN model we assume the Decoy BB84 protocol, whereas in the non-TN model, we employ twin-field QKD (TF-QKD) due to the increased single hop distances. We present mixed integer linear program models to optimize network design in both of these paradigms and use these to investigate the viability of switching in the network models as a method of sharing devices. We show that sharing of devices can provide cost reduction in QNs up to a certain transmission requirement rate between users in the TN model, while also providing benefits even at significantly higher transmission requirements in the TF-QKD model. The specific value of this rate is dependent on the network graph; however, for mesh topology TN networks this is expected to occur at average key transmission requirements of ∼1000−5000bits/s. We further use the models to investigate the effects of different network parameters, such as cooling costs, switch frequency, and device costs. We show that cooled detectors are useful in large TF-QKD networks, despite higher costs, but are only useful in TN networks when transmission requirements are very high or cooling is cheap. We also investigate how network costs vary with switching frequency and switch loss, showing that compromising for slightly faster switching times and higher loss switches does not significantly increase network costs; thus a significant effort in improving switch loss may not be necessary. Finally, we look at how the benefits of sharing devices change as the cost of devices changes, showing that for any non-negligible device cost, device sharing is always beneficial at low transmission requirements.
Quantum key distribution (QKD) promises information theoretic security. However, the distances over which complete security can be achieved are fundamentally limited in the absence of quantum repeaters. Thus, a key question is how to build a quantum network (QN) given this restriction. One paradigm that has been considered is trusted node (TN) quantum networks where intermediate trusted nodes are used as relays of quantum keys. Another paradigm is to route key channels through intermediate nodes optically, either through wavelength or fiber switching, thus avoiding the use of TNs. In both of these paradigms, a QKD receiver or transmitter at a specific node can be shared between multiple QKD transmitters or receivers at different nodes in order to reduce the overall costs; this sharing can be enabled via an optical switch. In this paper, we investigate the two paradigms for designing QNs. In the TN model we assume the Decoy BB84 protocol, whereas in the non-TN model, we employ twin-field QKD (TF-QKD) due to the increased single hop distances. We present mixed integer linear program models to optimize network design in both of these paradigms and use these to investigate the viability of switching in the network models as a method of sharing devices. We show that sharing of devices can provide cost reduction in QNs up to a certain transmission requirement rate between users in the TN model, while also providing benefits even at significantly higher transmission requirements in the TF-QKD model. The specific value of this rate is dependent on the network graph; however, for mesh topology TN networks this is expected to occur at average key transmission requirements of ∼1000−5000bits/s. We further use the models to investigate the effects of different network parameters, such as cooling costs, switch frequency, and device costs. We show that cooled detectors are useful in large TF-QKD networks, despite higher costs, but are only useful in TN networks when transmission requirements are very high or cooling is cheap. We also investigate how network costs vary with switching frequency and switch loss, showing that compromising for slightly faster switching times and higher loss switches does not significantly increase network costs; thus a significant effort in improving switch loss may not be necessary. Finally, we look at how the benefits of sharing devices change as the cost of devices changes, showing that for any non-negligible device cost, device sharing is always beneficial at low transmission requirements.
Quantum key distribution (QKD) promises information theoretic security. However, the exponential decay of the secure key in optical fibers leads to limitations in long distance QKD distribution across fibers, which is necessary for global quantum networks (QNs). Satellite QKD can be used to generate keys over long distances bypassing fiber limitations and is thus a promising approach for global QNs. In this paper, we construct mixed integer linear program (MILP) models to investigate how to best connect the core fiber network to ground stations to minimize the overall network cost. We design one MILP that can provide a quantitative value for the number of satellites needed for a given configuration and another one to optimize the allocation of the core network nodes to ground stations to minimize the overall network cost. We use these models to investigate different strategies to allocate satellites to ground stations during a satellite overpass, showing that allocating satellites based on the expected transmission requirements can reduce the number of satellites needed in a network by up to 40% compared to randomly allocating the satellites to ground stations. Furthermore, we use these models to investigate securing the data center traffic in two networks, one local European network and one global network, and show that costs in the optimal configuration can be up to 40% cheaper than simply connecting core network sites to their geographically closest ground station.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.