Preliminary Study of Connectivity for Quantum Key Distribution Network

04/23/2020
by   Ying Liu, et al.
Rutgers University
0

Quantum network is fragile to disturbances when qubits are transmitted through quantum channel. Reliability is an essential requirement for a quantum network and even the future quantum internet. A metric is needed to describe the reliability of a quantum network to build a robust infrastructure and communication protocols. In this work, we combined quantum physical parameters with graphic algebraic connectivity to indicate the transmission throughput of a grid quantum network. This metric can be extended to multiple equal point-to-point distance topology. This work also studies how to tune specific physical parameters to maintain or even increase connectivity when nodes or edges are removed from a network. Using this metric, resources consumption are compared.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/11/2019

A Quantum Router for the Entangled Web

Qubit transmission protocols are presently point-to-point, and thus rest...
03/13/2020

QuNetSim: A Software Framework for Quantum Networks

As quantum internet technologies develop, the need for simulation softwa...
11/29/2017

Connectivity jamming game for physical layer attack in peer to peer networks

Because of the open access nature of wireless communications, wireless n...
06/29/2019

The Engineering of Software-Defined Quantum Key Distribution Networks

Quantum computers will change the cryptographic panorama. A technology o...
12/21/2021

Scalable High-Rate Twin-Field Quantum Key Distribution Networks without Constraint of Probability and Intensity

There have been several recent advancements in the field of long-distanc...
08/11/2015

Topology Control of wireless sensor network using Quantum Inspired Genetic algorithm

In this work, an evolving Linked Quantum register has been introduced, w...
01/24/2022

Automated machine learning for secure key rate in discrete-modulated continuous-variable quantum key distribution

Continuous-variable quantum key distribution (CV QKD) with discrete modu...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

Due to the large de-coherence property of a single photon over long distances, the development of quantum network lags quite behind quantum computer. The quick decay of correlation beyond coherent time caused by outside-world interference makes the reliability, one of the key issues for achieving a practical quantum network. Quantum Key Distribution (QKD) is the first quantum network protocol designed for quantum communication, which has been studied since 1980s.

This work aims to understanding the secure connectivity of a quantum network when QKD protocol is operating in its physical layer. QKD includes various key exchange protocols to establish a shared key before secure communication is taken between two direct connected parties. Although only one qubit can be transmitted each time, it is supposed that, after repeated transmission, a usable length of key / information can be shared between two parties. It is obvious that the number of repeats until a specified length of information is achieved, indirectly relates to connectivity.

There are several factors that cause errors when a qubit transmitted to the end: 1) non-clone property of quantum, that is, as long as a quantum wave is measured, the information carried by a qubit on-the-fly can be distorted or evenly destroyed. A known example is eavesdropping. This behavior causes a link or node removal, depending on the target of eavesdropper, in a quantum network; 2) resonance caused by other concurrent transmitted wave functions; 3) quantum transmitter such as a laser, produces inaccurate or distorted quantum pulse; 4) quantum detector which has a low receiving fidelity, such as optical imperfections, and dark counts. There are already few papers discussing it [bagraev2005parameter, gisin2002quantum, aguiar2013network, gobby2004quantum]. If qubits are transmitted through free space, more physical error sources need to take into consideration, such as signal strength deterioration caused by a quantum channel, and environmental noise.

Quantum channel can either be entangled or not entangled. Regarding entangled channel, before transmitting information, an entangled pair of photons are shared between transmitter and receiver. Next, an entangled qubit carrying information is transmitted by associating with the entangled channel. After receiving the new entangled pair, corresponding numerical operations are performed to obtain the original sent information, which is the so-called quantum teleportation.

Although entangled quantum teleportation can reduce the re-transmission, its real-world implementation over long-distance still needs great efforts. Current implemented quantum network protocols are through non-entangled channel, especially QKD. Most proposed network protocols which integrate quantum security [elliott2018darpa] are based on BB84 [shor2000simple].

2 Background: quantum bit rate and channel capacity

2.1 Secrete key rate based on BB84

Quantum bit error rate (QBER) is introduced by [gisin2002quantum] to compare different QKD setups. For a non-entangled channel based on BB84 protocol, the two-point QBER using faint laser pulses is according to [gisin2002quantum]

(1)

where is the sifted key rate which is counted when the Alice (A) and Bob (B) choose the same basis. Thus, in BB84 protocol, the .

is the raw data rate which equals to the number of photons per unit time multiplying the successful probabilities from sending photons to correctly receiving it. Thus,

[gisin2002quantum]. is the frequency of a laser to produce a pulse. is the average number of photon carried by the pulse. is the successful probability that photons arrive at the detector. relates to the channel conditions (i.e. the coherence decreases exponentially with distance [gobby2004quantum]) and eavesdropper’s measurement. is the probability that photons’ are detected. Thus,

(2)

where sending rate is .

For non-entangled photon stream,

(3)

where is the error rate that photons fall into the wrong detector due to optical imperfections. Assume to be the probability that the wrong detector captures photon. Therefore,

(4)

Based on [gisin2002quantum], , which is the error rate caused by dark count, equals to

(5)

where is the probability of valid dark count per detector. is the number of detectors at a receiver. Thus,

(6)

Based on [scarani2009security] and [vedovato2015space], the secret key rate equals to

(7)

where is the binary entropy.

2.2 Quantum Channel Capacity

A channel (optical / free space) in a quantum system can either be with or without pre-shared entangled pairs. The capacity under these two channels are defined slightly differently based on the input states and formats.

When the input is in product states (no entanglement), and the outputs of the channels (including multiple parallel channels) are measured jointly, the channel capacity according to [gyongyosi2018survey] is as follows:

(8)
(9)
(10)
(11)

where is the channel function, which describes how quantum information interacts with environment. For example, it can be either unitary transformation or other distortions. is the von Neumann entropy. is the density matrix of input quantum states. A quantum communication system should be designed to obtain the maximum channel capacity over all possible combinations of basic ensembles.

For a channel with pre-shared entangled pairs, the quantum channel capacity does not need asymptotic version. Thus, , which equals to , referencing from [gyongyosi2018survey] and [shor2003capacities], becomes

(12)
(13)

is the maximum mutual information between Alice and Bob. Mutual information measures how much B can tell about A. means capacity of one channel. Here (8) and (12) only describe the one-hop communication capacity.

2.3 Relations between R and C

Secrete key rate described by (7) only considers sending and receiving rate of qubits under the assumption of perfect channel conditions, which have no channel distortions, decays and errors. Intuitively, this is an ideal case. When photons are transmitted in optical fiber and not vacuum space, the impact of channel on signals must be considered.

Shannon theory describes the relationship between transmission rate and channel capacities to achieve small error during information transmission. Therefore, C is used as a guidance to design error-free channel codes. Thus, the relationship is as followings

(14)

(14) can be used to indicate the quality of a two point communications. If appears frequently within time period, the link quality or weight is statistically poor in average. Since quantum channel is fragile and stochastically not stable, we use the following metric to describe the average transmission ability of a link over .

(15)
(16)
(17)

where is the learning rate, which should be less than one.

3 Quantum network connectivity

3.1 Background: graph connectivity

The (8) and (12) only quantify the point-to-point channel capacity. Another interesting topic is the capacity of a multi-hop network, which considers the end to end network transmission ability and connectivity.

Network connectivity is usually studied through graph theory. For a static network, its connectivity is defined by algebraic connectivity / Fiedler value, which is the second smallest eigenvalue of the Laplacian matrix,

, of a network’s topological graph, where is the graph vertex set and is the edge set for .

The Fiedler value [liu2016maintaining] is always non-negative, and its value is zero if and only if the graph is disconnected, in which case the number of zero eigenvalues of equals the number of connected components in a graph (e.g. a disconnected network consisting of two subnetworks that are themselves topologically connected, would yield have two eigenvalues equal to zero). Referring to [fiedler1973algebraic], the Fiedler value, represented by , of a graph, can be obtained by the following eigenvalue optimization problem.

(18)

where

is a vector which does not equal to

1.

The Laplacian matrix of a given graph is defined as follows: Given a graph without self cycles and multiple links between two nodes, the Laplacian matrix is calculated by

(19)

where is a diagonal matrix whose diagonal entry contains the degrees for each node. is the adjacency matrix with each entry being a value of zero or one when nodes are connected to each other. In addition, its diagonal is zero since, for a communication network we assume that has no self cycles. A valuable characteristic of Laplacian matrix is that it is semi-definite. Thus, (18) is solvable.

3.2 Quantum network connectivity in physical layer

We use algebraic connectivity, in terms of R and C, to study the capacity connectivity of a quantum network. We formulate the problems as follows:

(20)

is the vertex set of a quantum network, which can be senders (say, lasers, repeaters) and receivers / detectors. which is the edge set, indicating communication rate / quality of a link.

Thus, we define each entry of adjacency matrix by (7) and (16). is a weighted matrix, whose weights are the function of transmission rate, , and channel capacity, , which reflects the link quality.

3.3 Quantum network connectivity resilience

Quantum network is fragile to eavesdroppers, environment disturbances, and decoherence over long time and distance transmission, no matter the channel is entangled and not. The eavesdropper’s observation can immediately destroy transmitted wave function. These failures, from network point of view, equals to removing links and edges from a graph, which has direct effects on network connectivity, and information transmission.

Resilient connectivity of a network means the information transmitted from A can still be received at B after several links and nodes fail on the original path. However, normally it’s time consuming to exam all redundant paths among two nodes in a network. Thus, an approximate criterion is to ensure the network connectivity does not drop or drop less after links and nodes failed in a network.

Algebraic connectivity provides good properties and measuring criterion to indicate connectivity. The larger value of algebraic connectivity indicates stronger network resilience. The properties of algebraic connectivity that relate to the comparison of a network connectivity, are: 1) If the network’s links are broken because of disturbances, the Fiedler value , where . This also informs that the Fiedler value can become larger when adding edges to a graph; 2) Fiedler value’s upper bound is limited to the minimum degree of nodes and the total number of nodes existing in a network. Thus, it also indicates that increasing the degrees for all nodes is ineffective since the upper bound is constrained by the minimum value of the nodes’ degrees; 3) the algebraic connectivity of the remaining graph after nodes are removed, is comparable as long as the number of remaining nodes in a network is same.

After identifying the weakest connectivity node, which means removing it would have the most harmful impact on the network’s algebraic connectivity, we can add classical router around the node to strengthen the quantum network connectivity.

4 Numerical evaluation

We have simulated both (8) and (12) shown in Fig. 1

for two-point link capacity. In both with and without entanglement, unitary channel matrix is applied, such as identity matrix,

, or no-loss rotation matrix, . In the two ideal cases (blue, red), we optimized for all ensembles of bases to find the maximum capacities. We derive that the entangled capacity is factor of 2 of sent qubits, which suggests the advantage of pre-distributing entangled pairs before real information is communicated. If randomly pick , it indicates that specific favors specific qubit input.

Figure 1: quantum link capacity

We studied the grid topology with 3 by 3 nodes. Node is numbered in the order of [[1, 2, 3], [4, 5, 6], [7, 8 ,9]], from left to right, and top to bottom. Fig. 2 shows we increase of [5], [2, 4, 6, 8], [1, 3, 7, 9] respectively with entangled and non-entangled link capacities. We group them according to their distance (hops) from the center of the topology. Capacity is learned based on (16) by 100 times with learning rate 0.5. All of other nodes are 1. We have obtained: 1) with increase of or any parameters that can increase , [2, 4, 6, 8], one hop neighbors, can improve the connectivity most for the grid topology, even if connectivity of other group does not increase after ; 2) although we increase more than 3 nodes of [2, 4, 6, 8] comparing to only improving that of one node, 5, the improvement of connectivity is more than three times. We think the reason is that the average closeness of a node to other nodes plays a role; 3) For non-entanglement case, connectivity drops dramatically after certain threshold, even if increases. The reason is the average learned capacity, become less than with increases. We expect the same phenomenon would occur for entangled channel with increases more. In conclusion, we believethat properly selecting nodes could improve connectivity while the same resources, are used.

Figure 2: increasing connectivity over

Fig. 3, 4 and 5 shows how connectivity varies after removing one node from the network while increasing of group [5], [2, 4, 6, 8] and [1, 3, 7, 9]. Fig. 3 shows the harmful impact of removing node 2 is larger than that of node 3. It even brings the connectivity with entangled channel below that of non-entangled one, which is not a usual case. Increasing of central node [5] has made small difference in terms of connectivity. From the same starting , the order of harmfulness of removing one node is [2] [3] [5]. Fig. 6 proves again that removing node 2 harms the connectivity more than node 3.

Figure 3: increase connectivity by node [5] after removing [2], [3], [5]
Figure 4: increase connectivity at nodes [2,4,6,8] after removing [2], [3], [5]
Figure 5: increase connectivity at nodes [1,3,7,9] after removing [2], [3], [5]

To relieve the harmfulness of removing node 2, Fig. 7 shows one can increase the of node 5 before for both entangle and non-entangled cases, and increase of nodes [4,6,8] for entangled case when . For non-entangled case, increasing node 5 saves more resources.

Figure 6: Compare harmfulness of removing nodes on connectivity
Figure 7: Recover connectivity after removing node 2

5 Conclusion

Combined with algebraic connectivity, we have studied the connectivity of a quantum network based on quantum related physical parameters, such as the number of photons per pulse. The method we used can provide preliminary quantitative indication of which resources to use to strengthen the connectivity, and how much to it should be tuned.

References