Theory of Noise-Scaled Stability Bounds and Entanglement Rate Maximization in the Quantum Internet.

Crucial problems of the quantum Internet are the derivation of stability properties of quantum repeaters and theory of entanglement rate maximization in an entangled network structure. The stability property of a quantum repeater entails that all incoming density matrices can be swapped with a target density matrix. The strong stability of a quantum repeater implies stable entanglement swapping with the boundness of stored density matrices in the quantum memory and the boundness of delays. Here, a theoretical framework of noise-scaled stability analysis and entanglement rate maximization is conceived for the quantum Internet. We define the term of entanglement swapping set that models the status of quantum memory of a quantum repeater with the stored density matrices. We determine the optimal entanglement swapping method that maximizes the entanglement rate of the quantum repeaters at the different entanglement swapping sets as function of the noise of the local memory and local operations. We prove the stability properties for non-complete entanglement swapping sets, complete entanglement swapping sets and perfect entanglement swapping sets. We prove the entanglement rates for the different entanglement swapping sets and noise levels. The results can be applied to the experimental quantum Internet.

Introduction

The quantum Internet allows legal parties to perform networking based on the fundamentals of quantum mechanics[1-12]. The connections in the quantum Internet are formulated by a set of quantum repeaters and the legal parties have access to large-scale quantum devices[13-17] such as quantum computers[18-27,28,29]. Quantum repeaters are physical devices with quantum memory and internal procedures[3-9,14-16,30-48]. An aim of the quantum repeaters is to generate the entangled network structure of the quantum Internet via entanglement distribution[49-61]. The entangled network structure can then serve as the core network of a global-scale quantum communication network with unlimited distances (due to the attributes of the entanglement distribution procedure). Quantum repeaters share entangled states over shorter distances; the distance can be extended by the entanglement swapping operation in the quantum repeaters[3,5,6,10,14-16]. The swapping operation takes an incoming density matrix and an outgoing density matrix; both density matrices are stored in the local quantum memory of the quantum repeater[62-79]. The incoming density matrix is half of an entangled state such that the other half is stored in the distant source node, while the outgoing density matrix is half of an entangled state such that the other half is stored in the distant target node. The entanglement swapping operation, applied on the incoming and outgoing density matrices in a particular quantum repeater, entangles the distant source and target quantum nodes. Crucial problems here are the size and delay bounds connected to the local quantum memory of a quantum repeater and the optimization of the swapping procedure such that the entanglement rate of the quantum repeater (outgoing entanglement throughput measured in entangled density matrices per a preset time unit) is maximal. These questions lead us to the necessity of strictly defining the fundamental stability and performance criterions[80-88] of quantum repeaters in the quantum Internet.

Here, a theoretical framework of noise-scaled stability analysis and entanglement rate maximization is defined for the quantum Internet. By definition, the stability of a quantum repeater can be weak or strong. The strong stability implies weak stability, by some fundamentals of queueing theory[89-93]. Weak stability of a quantum repeater entails that all incoming density matrices can be swapped with a target density matrix. Strong stability of a quantum repeater further guarantees the boundness of the number of stored density matrices in the local quantum memory. The defined system model of a quantum repeater assumes that the incoming density matrices are stored in the local quantum memory of the quantum repeater. The stored density matrices formulate the set of incoming density matrices (input set). The quantum memory also consists of a separate set for the outgoing density matrices (output set). Without loss of generality, the cardinality of the input set (number of stored density matrices) is higher than the cardinality of the output set. Specifically, the cardinality of the input set is determined by the entanglement throughput of the input connections, while the cardinality of the output set equals the number of output connections. Therefore, if in a given swapping period, the number of incoming density matrices exceeds the cardinality of the output set, then several incoming density matrices must be stored in the input set (Note: The logical model of the storage mechanisms of entanglement swapping in a quantum repeater is therefore analogous to the logical model of an input-queued switch architecture[89-91]). The aim of entanglement swapping is to select the density matrices from the input and output sets, such that the outgoing entanglement rate of the quantum repeater is maximized; this also entails the boundness of delays. The maximization procedure characterizes the problem of optimal entanglement swapping in the quantum repeaters.

Finding the optimal entanglement swapping means determining the entanglement swapping between the incoming and outgoing density matrices that maximizes the outgoing entanglement rate of the quantum repeaters. The problem of entanglement rate maximization must be solved for a particular noise level in the quantum repeater and with the presence of various entanglement swapping sets. The noise level in the proposed model is analogous to the lost density matrices in the quantum repeater due to imperfections in the local operations and errors in the quantum memory units. The entanglement swapping sets are logical sets that represent the actual state of the quantum memory in the quantum repeater. The entanglement swapping sets are formulated by the set of received density matrices stored in the local quantum memory and the set of outgoing density matrices, which are also stored in the local quantum memory. Each incoming and outgoing density matrix represent half of an entangled system, such that the other half of an incoming density matrix is stored in the distant source quantum repeater, while the other half of an outgoing density matrix is stored in the distant target quantum repeater. The aim of determining the optimal entanglement swapping method is to apply the local entanglement swapping operation on the set of incoming and outgoing density matrices such that the outgoing entanglement rate of the quantum repeater is maximized at a particular noise level. As we prove, the entanglement rate maximization procedure depends on the type of entanglement swapping sets formulated by the stored density matrices in the quantum memory. We define the logical types of the entanglement swapping sets and characterize the main attributes of the swapping sets. We present the efficiency of the entanglement swapping procedure as a function of the local noise and its impacts on the entanglement rate. We prove that the entanglement swapping sets can be defined as a function of the noise, which allows us to define noise-scaled entanglement swapping and noise-scaled entanglement rate maximization. The proposed theoretical framework utilizes the fundamentals of queueing theory, such as the Lyapunov methodology[89], which is an analytical tool used to assess the performance of queueing systems[89-94], and defines a fusion of queueing theory with quantum Shannon theory[95-103] and the theory of quantum Internet.

The novel contributions of our manuscript are as follows:

We define a theoretical framework of noise-scaled entanglement rate maximization for the quantum Internet.

We determine the optimal entanglement swapping method that maximizes the entanglement rate of a quantum repeater at the different entanglement swapping sets as a function of the noise level of the local memory and local operations.

We prove the stability properties for non-complete entanglement swapping sets, complete entanglement swapping sets and perfect entanglement swapping sets.

We prove the entanglement rate of a quantum repeater as a function of the entanglement swapping sets and the noise level.

This paper is organized as follows. In Section 2, the preliminary definitions are discussed. Section 3 proposes the noise-scaled stability analysis. In Section 4, the noise-scaled entanglement rate maximization is defined. Section 5 provides a performance evaluation. Finally, Section 6 concludes the results. Supplemental Information is included in the Appendix.

System Model and Problem Statement

System model

Let refer to the nodes of an entangled quantum network , which consists of a transmitter node , a receiver node , and quantum repeater nodes , . Let , refer to a set of edges (an edge refers to an entangled connection in a graph representation) between the nodes of , where each identifies an -level entanglement, , between quantum nodes and of edge , respectively. Let be an actual quantum network with nodes and a set of entangled connections. An -level, , entangled connection , refers to the shared entanglement between a source node and a target node , with hop-distancesince the entanglement swapping (extension) procedure doubles the span of the entangled pair in each step. This architecture is also referred to as the doubling architecture[10,14-16].

For a particular -level entangled connection with hop-distance (1), there are intermediate nodes between the quantum nodes and .

Figure 1 depicts a quantum Internet scenario with an intermediate quantum repeater . The aim of the quantum repeater is to generate long-distance entangled connections between the distant quantum repeaters. The long-distance entangled connections are generated by the entanglement swapping operation applied in . The quantum repeater must manage several different connections with heterogeneous entanglement rates. The density matrices are stored in the local quantum memory of the quantum repeater. The aim is to find an entanglement swapping in that maximizes the entanglement rate of the quantum repeater.

Figure 1

The problem of entanglement swapping in quantum repeater with input and output connections in a quantum Internet scenario. Quantum repeater stores an incoming entangled density matrix from the -th input (the other half of is shared with a source quantum repeater ) and the outgoing entangled density matrix (the other half of is shared with a target quantum repeater ) in its local quantum memory. The entanglement swapping operation in generates long-distance entangled connections between the distant quantum nodes. The incoming and outgoing density matrices formulate sets and together formulate the entanglement swapping set. The aim of the optimization procedure is to determine the optimal entanglement swapping to maximize the outgoing entanglement rate of ).

Entanglement fidelity

The aim of the entanglement distribution procedure is to establish a -dimensional entangled system between the distant points and , through the intermediate quantum repeater nodes. Let , and let be the target entangled system and , subject to be generated. At a particular density generated between and , the fidelity of is evaluated as

Without loss of generality, an aim of a practical entanglement distribution is to reach in (2) for a given [10-12,14-17,30].

Entanglement purification and entanglement throughput

Entanglement purification[69,104,105] is a probabilistic procedure that creates a higher fidelity entangled system from two low-fidelity Bell states. The entanglement purification procedure yields a Bell state with an increased entanglement fidelity ,where is the fidelity of the imperfect input Bell pairs. The purification requires the use of two-way classical communications[10-12,14-17,30].

Let refer to the entanglement throughput of a given entangled connection measured in the number of -dimensional entangled states established over per sec at a particular fidelity (dimension of a qubit system is )[10-12,14-17,30].

For any entangled connection , a condition should be satisfied, aswhere is a critical lower bound on the entanglement throughput at a particular fidelity of a given , i.e., of a particular has to be at least .

Definitions

Some preliminary definitions for the proposed model are as follows.

Definition 1

(Incoming and outgoing density matrix). In a -th quantum repeater , an incoming density matrix is half of an entangled state received from a previous neighbor node . The outgoing density matrix in is half of an entangled state shared with a next neighbor node .

Definition 2

(Entanglement Swapping Operation). The entanglement swapping operation is a local transformation in a -th quantum repeater that swaps an incoming density matrix with an outgoing density matrix and measures the density matrices to entangle the distant source and target nodes and .

Definition 3

(Entanglement Swapping Period). Let be a cycle with time determined by the oscillator in node , where is the frequency of . Then, let be an entanglement swapping period in which the set of incoming density matrices is swapped via with the set of outgoing density matrices, defined as , where is the number of C.

Definition 4

(Complete and Non-Complete Swapping Sets). Set formulates a complete set if set contains all the incoming density matrices per that is received by during a swapping period, where is the number of input entangled connections of and is the number of incoming densities of the -th input connection per ; thus, and . Set formulates a complete set if contains all the outgoing density matrices that are shared by during a swapping period ; thus, and .

Let be an entanglement swapping set of , defined as

Then, is a complete swapping set, ifwith cardinality

Otherwise, formulates a non-complete swapping set , with cardinality

Definition 5

(Perfect Swapping Sets). A complete swapping set is a perfect swapping setat a given , ifholds for the cardinality.

Definition 6

(Coincidence set). In a given , the coincidence set is a subset of incoming density matrices in of received from that requires the outgoing density matrix from for the entanglement swapping. The cardinality of the coincidence set is

Definition 7

(Coincidence set increment in an entanglement swapping period) Let refer to the number of density matrices arriving from for swapping with at . This means the increment of the cardinality of the coincidence set iswhere is the next entanglement swapping period. The derivations assume that an incoming density matrix chooses a particular output density matrix for the entanglement swapping with probability (Bernoulli i.i.d.).

Definition 8

(Incoming and outgoing entanglement rate) Let be the incoming entanglement rate of per a given , defined aswhere refers to the number of density matrices arriving from for swapping with per .

Then, at a given , the , the outgoing entanglement rate of is defined aswhere is the loss, , and is a delay measured in entanglement swapping periods caused by the optimal entanglement swapping at a particular entanglement swapping set.

Definition 9

(Swapping constraint). In a given , each incoming density in can be swapped with at most one outgoing density, and only one outgoing density is available in for each outgoing entangled connection.

Definition 10

(Weak stable (stable) and strongly stable entanglement swapping). Weak stability (stability) of a quantum repeater entails that all incoming density matrices can be swapped with a target density matrix in . A entanglement swapping in is weak stable (stable) if, for every , there exists a , such thatwhere is the set of incoming densities of at , while is the cardinality of the set.

For a strongly stable entanglement swapping in , the weak stability is satisifed and the cardinality of is bounded. A entanglement swapping in is strongly stable if

Noise-scaled entanglement swapping sets

Proposition 1 (Noise Scaled Swapping Sets). Let be a noise coefficient that models the noise of the local quantum memory and the local operations, . For , the swapping set at a given is complete swapping set , while for any , the swapping set is non-complete swapping set at a given .

In realistic situations, corresponds to the noises and imperfections of the physical devices and physical-layer operations (quantum operations, realization of quantum gates, storage errors, losses from local physical devices, optical losses, etc) in the quantum repeater that lead to the loss of density matrices. For further details on the physical-layer aspects of repeater-assisted quantum communications in an experimental quantum Internet setting, we suggest[6].

Figure 2 illustrates the perfect swapping set, complete swapping set and non-complete swapping set. For both sets, the incoming densities are stored in incoming set . Its cardinality depends on the incoming entanglement throughputs of the incoming connections. The outgoing set is a collection of outgoing density matrices. The outgoing matrix is half of an entangled state and the other half is shared with a distant target node.

Figure 2

Logical types of entanglement swapping sets at a given . (a) For a perfect entanglement swapping set , the cardinalities of the input and output sets are and ; thus, . The cardinality of the coincidence sets , , , is . (b) For a complete entanglement swapping set , and ; thus, . The cardinality of the coincidence sets , and is . (c) For a non-complete entanglement swapping set , some densities are randomly lost due to noise (depicted by empty dots) in , leading to , where , and , where is the number of lost densities at a given . Since for each an output is associated at a given , in a density loss in a given coincidence set also causes a decrease in the cardinality of the output set (due to the swapping constraint); thus, . The cardinality of the coincidence sets , and is .

The input set and output se of consist of the incoming and outgoing density matrices. For a non-complete entanglement swapping set, the noise is non-zero; therefore, loss is present in the quantum memory. As a convention of our model (see the swapping constraint in Definition 9), any density matrix loss is modeled as a “double loss” that affects both sets and . Because of a loss, the swapping operation cannot be performed on the incoming and outgoing density matrices.

Problem statement

The problem formulation for the noise-scaled entanglement rate maximization is given in Problems 1–3.

Problem 1 Determine the entanglement swapping method that maximizes the entanglement rate of a quantum repeater at the different entanglement swapping sets as a function of the noise level of the local memory and local operations.

Problem 2 Prove the stability for non-complete entanglement swapping sets, complete entanglement swapping sets and perfect entanglement swapping sets.

Problem 3 Determine the outgoing entanglement rate of a quantum repeater as a function of the entanglement swapping sets and the noise level.

Problem 4 Define the optimal entanglement swapping period length as a function of the noise level at the different entanglement swapping sets.

The resolutions of Problems 1–4 are proposed in Proposition 1 and Theorems 1–4.

Entanglement Swapping Stability at Swapping Sets

This section presents the stability analysis of the quantum repeaters for the different entanglement swapping sets.

Proposition 2 (Noise-scaled weight coefficient). Let be a weight at a non-complete swapping set at , where is the noise at a given . For a complete swapping set, , and is a maximized weight at . For any non-complete set , , where f(·) is a sub-linear function, and . At a perfect swapping set , the weight is .

Proof. At a given , let be constant, with respect to the swapping constraint, defined asthus , if incoming density is selected from set for the swapping with , and 0 otherwise. The aim is therefore to construct afeasible entanglement swapping method for all input and output neighbors of , for all entanglement swapping periods.

Then, from (see Definition 7) and (17), a weight coefficient can be defined for a given entanglement swapping at a given , aswhere is the inner product, is a matrix of all coincidence set cardinalities for all input and output connections at , defined aswhile is as given in (18).

For a perfect and complete entanglement swapping set, at , let refer to the entanglement swapping, with , where is the maximized weight coefficient defined aswhere is an optimal entanglement swapping method at (in general not unique, by theory) with the maximized weight. By some fundamental theory[89-91,93], it can be verified that for a non-complete set with entanglement swapping at , defined aswith norm a [89,91], defined aswith , the relationholds for the weights.

Then, let be a Lyapunov function[89-91,93] of (see (20)) as

Then it can be verified[89-91,93] thatholds, as is sufficiently large[89-91,93], where . Since (26) is analogous to the condition on strong stability given in (16), it follows that as (21) holds for all entanglement swapping periods, the entanglement swapping at in is a strongly stable entanglement swapping with maximized weight coefficients for all periods.

Since for any complete and perfect entanglement swapping set, the noise is zero, the weight coefficient of at a perfect swapping set is also a maximized weight with as

As the noise is nonzero, , an entanglement swapping cannot reach the maximized weight coefficient (21), thuswhere the non-zero noise decreases to aswhere is a sub-linear function, asandwhere , and is a constant.

For a non-complete set, (26) can be rewritten aswhere , which represents the stability condition given in (15). As follows, an entanglement swapping at a non-complete entanglement swapping set is stable.

These statements are further improved in Theorems 1 and 2, respectively.

Non-complete swapping sets

Theorem 1

(Noise-scaled stability at non-complete swapping sets) An entanglement swapping at is stable for any non-complete entanglement swapping set .

Proof . Let be the noise at a given , and let be the actual entanglement swapping at any non-complete entanglement swapping set . Using the formalism of[93], let refer to a Lyapunov function of a size matrix , defined aswhere is the -th element of .

Let and constants, , . Then, an entanglement swapping with is stable if onlywhere is a difference of the Lyapunov functions and , where is a next entanglement swapping period, defined asandby theory[89-91,93].

To verify (34), first is rewritten via (25) aswhere can be evaluated aswhere is the normalized number of arrival density matrices from for swapping with at a next entanglement swapping period , defined aswhere is a total number of incoming density matrices of from the quantum repeaters.

Using (38), the result in (37) can be rewrittenthus (34) can be rewritten aswhere is the expected normalized number of density matrices arrive from for swapping with at .

Let be the weight coefficient of the actual entanglement swapping at the noise at a given , asand let be defined as

Then, by some fundamental theory[89-91,93],where is a constant, and is a -th entanglement swapping at a noise , while is the weight of .

Then, using (44), from (41) can be rewritten aswhere C1 is set as[93]

Therefore, there as is selected such thatthenholds, by theory[89-91,93], since (48) can be rewritten aswhere is defined astherefore the stability condition in (15) is satisfied viathat concludes the proof.

As a corollary, (34) is satisfied for the entanglement swapping method with any non-zero noise, at a given .

Complete and perfect swapping sets

Lemma 1 extends the results for entanglement swapping at complete and perfect swapping sets.

Lemma 1

(Noise-scaled stability at perfect and complete swapping sets) An optimal entanglement swapping at is strongly stable for any complete and perfect entanglement swapping set.

Proof. Let be the weight coefficient of at at a given , as given in (21), with aswhere is the set of all possible entanglement swapping operations at a given , and at outgoing density matrices, . For a perfect entanglement swapping set, is the set of all possible entanglement swapping operations, since [89,91]).

Then, let be a difference of the Lyapunov functions and ,andwhere is a next entanglement swapping period; as

Then, for any complete swapping set , from (45), at is aswhere is set as in (46), and by some fundamentals of queueing theory[89-91,93], the condition in (16) can be rewritten aswhere as given in (50), while is the cardinality of the coincidence sets of at a given , as

Thus, (57) can be rewritten as

By similar assumptions, for any perfect entanglement swapping with cardinality of the coincidence sets of at a given , the condition in (16) can be rewritten as

Thus, from (59) and (60), it follows that (52) is strongly stable for any complete and perfect entanglement swapping set, which concludes the proof.

Noise-Scaled Entanglement Rate Maximization

This section proposes the entanglement rate maximization procedure for the different entanglement swapping sets.

Since the entanglement swapping is stable for both complete and non-complete entanglement swapping, this allows us to derive further results for the noise-scaled entanglement rate. The proposed derivations utilize the fundamentals of queueing theory (Note: in queueing theory, Little’s law defines a connection between the average queue length and the average delay as , where is the arrival rate. The stability property is a required preliminary condition for the relation). The derivations of the maximized noise-scaled entanglement rate assume that an incoming density matrix chooses a particular output density matrix for the entanglement swapping with probability .

Preliminaries

Let be the cardinality of the coincidence sets at a given , asand let be the total number of incoming density matrices in per a given , aswhere refers to the number of density matrices arrive from for swapping with per .

From (61) and (62), let be the delay measured in entanglement swapping periods, aswhere is the delay for a given at a given , as

At delay , the number of swapped density matrices per iswhere is the number of lost density matrices in of per at a non-zero noise , if , and is the extended period, defined aswith ; thus, (65) identifies the outgoing entanglement rate per for a particular entanglement swapping set.

Theorem 2

(Entanglement rate decrement at non-complete swapping sets). For a non-complete entanglement swapping set , , the outgoing entanglement rate is per , where is the total incoming entanglement throughput at a given , and , where , where and , where is a constant.

Proof. The entanglement rate decrement for a non-complete entanglement swapping set is as follows.

After some calculations, the result in (45) can be rewritten aswherewhere refers to the normalized number of density matrices arrive from for swapping with at aswhile is defined as[89,93]

From (67), can be evaluated asthus, after entanglement swapping periods , is yielded aswhere is the -th entanglement swapping, while identifies the initial system state, thusby theory[93].

Therefore, after entanglement swapping periods, the expected value of can be evaluated aswhere , thus, assuming that the arrival of the density matrices can be modeled as an i.i.d. arrival process, the result in (74) can be rewritten as

Then, since for any noise at , the relationholds, thus for any entanglement swapping period , from the sub-linear property of , the relationfollows for .

Therefore, from (29) can be rewritten assuch that for , the relationholds, which allows us to rewrite (75) in the following manner:wherethus from (81), (80) is aswhere

Therefore, the delay for any non-complete swapping set is as

As a corollary, the outgoing entanglement rate per at (84), is asthat concludes the proof.

Complete swapping sets

Theorem 3

(Entanglement rate decrement at complete swapping sets). For a complete entanglement swapping set , , the outgoing entanglement rate is per , where , with .

Proof. Since for any complete swapping set,it follows thattherefore (82) can be rewritten for a complete swapping set as

Therefore, the decrement for any complete swapping set is aswith relation , where is as in (84).

As a corollary, the entanglement rate at (89), is aswhich concludes the proof.

Perfect swapping sets

Lemma 2

(Entanglement rate decrement at perfect swapping sets). For a perfect entanglement swapping set , , the outgoing entanglement rate is per , where , with .

Proof. The proof trivially follows from the fact, that for a perfect entanglement swapping set, the cardinality of all coincidence sets , , , is , thus

As follows,and the entanglement rate at (92), is as

The proof is concluded here.

Sub-linear function at a swapping period

Theorem 4

For any , at a given entanglement swapping period, , can be evaluated as .

Proof. Let be the optimal entanglement swapping at with a maximized weight coefficient , and let be an arbitrary entanglement swapping with defined aswhere an optimal entanglement swapping at an -th entanglement swapping period, while is an entanglement swapping period, defined aswhere .

Then, the weight coefficient of entanglement swapping (94) at an -th entanglement swapping period is aswhile at is as

It can be concluded, that the difference of (96) and (97) is asthus (96) is at most more than (97), since the weight coefficient of can at most decrease by every period (i.e., at a given entanglement swapping period at most density matrix pairs can be swapped by ).

On the other hand, letbe the weight coefficient of at . It also can be verified, that the corresponding relation for the difference of (96) and (97) is as

From (98) and (99), for the coefficient of at , it follows thattherefore, function for any non-zero noise, , is evaluated as (i.e., )while for any (i.e., )which concludes the proof.

Performance Evaluation

In this section, a numerical performance evaluation is proposed to study the delay and the entanglement rate at the different entanglement swapping sets.

Entanglement swapping period

In Fig. 3(a), the values of as a function of and are depicted. , . In Fig. 3(b), the values of are depicted as a function of and .

Figure 3

(a) The values of , , as a function of , and , . (b) The values of as a function of and , .

Delay and entanglement rate ratio

In Fig. 4(a), the values of are depicted as a function of the incoming entanglement rate for the non-complete , complete and perfect entanglement swapping sets. The delay values are evaluated as via the maximized values of (84), (92) and (92), i.e., the delay depends on the cardinality of the coincidence set and the incoming entanglement rate (This relation also can be derived from Little’s law; for details, see the fundamentals of queueing theory[89-91,93]).

Figure 4

(a) The delay values for the different entanglement swapping sets as a function of the incoming entanglement rate, , , , for the complete and perfect sets, for a non-complete set and , , , and . (b) The ratio of the outgoing and incoming entanglement rates for the different entanglement swapping sets as a function of the incoming entanglement rate. The entanglement rate decrease for the non-complete swapping set caused by losses is , while for the complete and perfect entanglement swapping sets.

In Fig. 4(b), the ratio of the outgoing and incoming entanglement rates is depicted as a function of the incoming entanglement rate. For the non-complete entanglement swapping set, the loss is set as .

The highest delay values can be obtained for non-complete entanglement swapping set , while the lowest delays can be found for the perfect entanglement swapping set . For a complete entanglement swapping set , the delay values are between the non-complete and perfect sets. This is because for a non-complete set, the losses due to the non-zero noise allow only an approximation of the delay of a complete set; thus, . For a complete entanglement swapping set, while the noise is zero, , the cardinality of the coincidence set is high, ; thus, the delay is higher than the delay of a perfect entanglement swapping set, . For a perfect set, the noise is zero, and the cardinality of the coincidence sets is one for all inputs; thus, . Therefore, the delay is minimal for a perfect set.

From the relation of , the corresponding delays of the entanglement swapping sets, the relation for the decrease in the outgoing entanglement rates is straightforward, as follows. As holds for the ratio of the outgoing and incoming entanglement rates, then , i.e., no significant decrease is caused by the entanglement swapping operation.

The highest outgoing entanglement rates are obtained for a perfect entanglement swapping set, which is followed by the outgoing rates at a complete entanglement swapping set. For a non-complete set, the outgoing rate is significantly lower due to the losses caused by the non-zero noise in comparison with the perfect and complete sets.

Conclusions

The quantum repeaters determine the structure and performance attributes of the quantum Internet. Here, we defined the theory of noise-scaled stability derivation of the quantum repeaters and methods of entanglement rate maximization for the quantum Internet. The framework characterized the stability conditions of entanglement swapping in quantum repeaters and the terms of non-complete, complete and perfect entanglement swapping sets in the quantum repeaters to model the status of the quantum memory of the quantum repeaters. The defined terms are evaluated as a function of the noise level of the quantum repeaters to describe the physical procedures of the quantum repeaters. We derived the conditions for an optimal entanglement swapping at a particular noise level to maximize the entanglement throughput of the quantum repeaters. The results are applicable to the experimental quantum Internet.

Ethics statement

This work did not involve any active collection of human data.

Supplemental Information.