EntangleNet: Theoretical Reestablishment of Entanglement in Quantum Networks †

Abstract

In the practical context of quantum networks, the most reliable method of transmitting quantum information is via teleportation because quantum states are highly sensitive. However, teleportation consumes a shared maximally entangled state. Two parties Alice and Bob located at separate nodes that wish to reestablish their shared entanglement will not send entangled qubits directly to achieve this goal, but rather employ a more efficient mechanism that ensures minimal time resources. In this paper, we present a quantum routing scheme that exploits entanglement swapping to reestablish consumed entanglement. It improves and generalizes previous work on the subject and reduces the entanglement distribution time by a factor of $4k$ in an arbitrary scale quantum network, where $N=4k-1$ is a required number of quantum nodes located between source and destination. In addition, k is the greatest positive integer considered by Alice or Bob, such that afterwards they choose N quantum switches.

1. Introduction

Quantum teleportation is a communication protocol introduced by Bennett et al. [1] and represents a major result in the field of quantum information. It allows perfect transmission of an unknown qubit between two spatially separated parties (whom we shall call Alice and Bob), provided that classical information is exchanged and a previously shared maximally entangled pair of particles exists between them [1,2,3]. Quantum entanglement is one of the most peculiar aspects exhibited by nature and an essential resource for teleportation. Shared maximal entanglement is required to achieve faithful teleportation; however, an inherent limitation is that this highly valuable resource is lost afterwards. In such context, shared entanglement as an informational resource is expressed in a quantitative manner as one entanglement bit or 1 ebit [2,4]. The teleportation scheme is part of a paradigm known as local operations and classical communication (LOCC), with additional shared entanglement allowed. This means that Alice and Bob share an entangled pair of particles, can manipulate their own qubits at will (LO) and can only exchange classical bits of information (CC). An important drawback of the protocol is closely related to properties of entanglement under LOCC; specifically, one shared ebit is necessary for faithful teleportation and the amount of shared entanglement cannot be increased by local operations and classical communication [2,4,5,6,7,8]. A consequence of these constraints is the consumption of one shared ebit when teleporting one qubit, thus entanglement between Alice and Bob is lost.

Alice and Bob are thought to be part of an extended quantum network infrastructure, with quantum channels providing communication links between adjacent nodes. Physical transmission of particles through these inherently noisy channels will definitely alter the encoded quantum information they wish to exchange. Teleportation proves to solve this problem by accurately transmitting a qubit from one place to another, regardless of distance and without any physical transport. However, it requires a maximally entangled pair of particles to be shared between source and destination; therefore, a crucial aspect of a future large scale quantum network is the task of reliably distributing entanglement to any two nodes in need of exchanging quantum information via teleportation.

We have chosen to devise a theoretical entanglement distribution protocol based on quantum routing that manages to resupply any two nodes Alice and Bob in a quantum network with shared entanglement. Our result is a generalization of [9] that reduces the entanglement distribution time by a factor of $4k$ relative to direct transmission of entangled qubits, considering a number of $4k-1$ specifically chosen quantum nodes between source and destination, as detailed in Section 2.2.

This paper is organized according to the following structure. In Section 2, we explore the process of entanglement distribution in quantum networks and discuss already established results. Then, we present our idea that improves and generalizes previous results, along with a resource analysis regarding the time needed to supply the end nodes with a maximally entangled pair of qubits. In Section 3, we provide an algorithmic description of the protocol and in Section 4 we conclude with final remarks and discuss future work.

2. The Idea of Restoring Entanglement

2.1. General Context

In a general case of entanglement distribution, Alice and Bob usually have quantum channels connecting them to Charlie, another node in the network. We refer to Charlie as a third party, who might actually represent a laboratory that generates maximally entangled pairs and then sends each particle to Alice and Bob, thus having successfully provided them with shared entanglement. Nevertheless, problems arise when considering practical situations of entanglement distribution. Although one ebit constitutes a perfect, noiseless transmission channel for Alice and Bob [10], the entangled pair is still distributed via noisy quantum channels, hence its purity is altered and our parties will eventually share a non-maximally entangled state (less than 1 ebit). By executing the teleportation protocol with such a resource, perfect reconstruction of the original qubit cannot be accomplished.

A major result that overcomes these limitations is the process of entanglement purification [2,10], which is possible via local operations. The purpose of purification protocols is to concentrate the entanglement of a certain number of entangled pairs to obtain a higher amount of entanglement for a smaller number of pairs. Given sufficient partially-entangled pairs shared by Alice and Bob, under LOCC, they can obtain a pair with entanglement close to 1 ebit in order to teleport a qubit with satisfactory fidelity. Entanglement concentration using nonlinear optics is presented in [11].

Even though entanglement can be concentrated, this process is successful under a minimum fidelity condition for the initial pairs, which cannot be met beyond certain distances [10,12]. It is reasonable to assume that distances between such arbitrary nodes as those represented by Alice and Bob are significant enough to make this process rather infeasible. This led to the emergence of quantum repeaters [12], devices that use entanglement swapping [13,14,15] and purification in order to propagate entanglement in shorter segments (node to node), until source and destination are linked by an almost maximally entangled pair. Thus, quantum repeaters are key elements in the framework of a quantum network and they have been considered in various entanglement distribution schemes. The phenomenon of entanglement swapping for continuous variables is discussed in [16]. A quantum key distribution scheme involving entanglement swapping is proposed in [17], while a quantum conferencing scheme for secure communication between several users is developed in [18].

An entanglement distribution scheme was recently proposed as an optimal routing protocol that ensures the greatest entanglement distribution rate between two arbitrary nodes in a quantum network [19]. It operates on a graph model of the network, while taking into account physical challenges such as the stochastic nature of entanglement generation, imperfect Bell measurement and short coherence time $T^{\mathrm{ch}}$ of memories in quantum repeaters. Given multiple possible routes between two nodes, the protocol finds the optimal one according to a route metric. The optimality of the path provides the highest average number of successfully established entangled pairs between two nodes in unit time, considering the coherence time interval $T^{\mathrm{ch}}$. Through numerical simulations, the underlying algorithm of the protocol was proven to outperform classical graph algorithms (Dijkstra, Bellman–Ford) used in conventional routing.

Two other previously proposed routing schemes are referred to as quantum relay and EPR-pair bridging [20] (maximally entangled pairs of particles are also called EPR-pairs). Considering Alice and Bob do not share entangled pairs with each other, but rather each of them does with another node Charlie, then a quantum relay method achieves teleportation of a qubit from Alice to Bob in two steps: Alice teleports first to Charlie, followed by him teleporting to Bob. By extension, an arbitrary number of intermediate nodes can exist between Alice and Bob, with entangled pairs set up between adjacent stations. This hop-by-hop “forwarding” mechanism exhibits an obvious lack of security and privacy [20], as the initial quantum information passes through all the nodes before finally reaching its intended destination. EPR-pair bridging addresses this problem by implementing a swapping scheme that provides Alice and Bob with a shared entangled pair. A Bell measurement performed by Charlie on his qubits and a subsequent transmission of classical information will establish entanglement as a particular Bell state between qubits held by Alice and Bob. Using this method based on entanglement swapping, direct teleportation is realized between source and destination. A quantum routing protocol was considered as a combination of quantum relay and EPR-pair bridging mechanisms, without necessary time synchronization between nodes, as a faster completion of operations at source or at the intermediate nodes would degenerate into the former or the latter scheme, respectively [20].

Entanglement swapping is a phenomenon of paramount importance for the entanglement distribution process between two distant nodes. In a most elementary scenario, we consider that there is a node O halfway between Alice (A) and Bob (B) that can generate entangled pairs of particles and then distribute them accordingly. This distribution scheme can be improved, as proposed in [9]. It was demonstrated that a significant speedup is exhibited when further nodes are introduced on the routes $A-O$ and $O-B$. Considering Alice and Bob are separated by a distance L and assuming entangled qubits travel at a speed v, the time required for our parties to receive their qubits generated at O is no less than $t_1=L/2v$. By placing distribution nodes C and D halfway on paths $A-O$ and $O-B$, they generate entangled pairs and simultaneously send a qubit to O and the other one to A and B, respectively. The time generated qubits require to arrive at their destination nodes is reduced to $L/4v$. Following a Bell measurement performed at O that takes $t_m$ to complete, Alice and Bob finally share entanglement. Without accounting for the time necessary for classical information associated with the measurement to be received, then A and B are supplied after an interval of $t_2=L/4v+t_m$, which is less than $t_1$, provided $t_m<L/4v$.

Having analyzed the framework of the problem and several existing protocols, we now continue with presenting our approach to how entanglement can be restored between Alice and Bob in a practical quantum network scenario, improving and generalizing previous results.

2.2. Our Proposal

Given the already existing network infrastructure and taking into account financial costs, a future large scale quantum network would most likely be mapped onto it. Therefore, optical fiber links will represent quantum channels and most nodes will likely use quantum equipment to achieve various tasks. Our solution is formulated in such a context and has at the very basis the idea described in [9], which we improve and generalize. We now define our general model of the network and the elements that are part of our scheme.

We consider a hybrid network (having both classical and quantum nodes) with a graph-like topology. Each component node is identified by an address (as an IP address), it is linked by a quantum channel to at least one other node and has a particular status, i.e., it is tasked with accomplishing a certain operation. An important class of nodes we consider is represented by quantum switches (QS), devices that are able to execute quantum routing protocols, generate entangled pairs of particles and perform various types of measurements on qubits. Our parties Alice and Bob are two nodes separated by an arbitrary distance that frequently exchange quantum information via teleportation. Thus, shared entanglement is a key resource they require to achieve their task. After each completed teleportation, their entangled pair is destroyed and another teleportation is not possible. Considering arbitrary distances between end nodes, they cannot afford to locally create entangled pairs of particles and send half of each to their partner. The idea we investigate is how they can be efficiently supplied with another entangled resource. Before discussing it, we present the assumptions based on which the scheme operates.

Assumptions:

• entanglement generation, Bell measurement (BSM) and other local quantum operations are performed perfectly in a negligible amount of time;
• transmission of entangled qubits between adjacent nodes is realized with high fidelity and does not require purification mechanisms.

These quantum operations are treated as theoretical processes that are abstract. We are not concerned with their physical nature; otherwise, we would not be able to model them as perfect and instantaneous in our scheme. Travel time between nodes can be neglected as well; however, that is not the most important aspect for our analysis. We discuss the time efficiency of the protocol in Section 2.2.2 by considering through how many hops entangled particles must pass until shared entanglement is achieved between the two parties.

We consider that Alice and Bob initially share several entangled pairs of particles described, for example, by Bell state $|{\beta }_{00}\rangle =\left(\right|00\rangle +|11\rangle )/\sqrt{2}$. After the last teleportation is performed, Alice and Bob acknowledge their resupply need and synchronize with each other in order to send an appropriate classical message to each other at the same time. We label this special message msg_NE_XY, where “NE” stands for “Need entanglement”, “X” is the sender and “Y” is the receiver. These two messages may reach their destination by different routes, as depicted in Figure 1. We denote the route taken by each message by the set of nodes it passes through:

• Alice to Bob: $\{S_{A_i}\mid i=1:m\}$

  $$A\stackrel{\mathtt{\text{msg\_NE\_AB}}}{\to }{S}_{A_1}\stackrel{\dots }{\to }\dots \stackrel{\dots }{\to }{S}_{A_m}\stackrel{\mathtt{msg}\_\mathtt{NE}\_\mathtt{AB}}{\to }B,$$
• Bob to Alice: $\{S_{B_j}\mid j=1:n\}$

  $$B\stackrel{\mathtt{msg}\_\mathtt{NE}\_\mathtt{BA}}{\to }{S}_{B_1}\stackrel{\dots }{\to }\dots \stackrel{\dots }{\to }{S}_{B_n}\stackrel{\mathtt{msg}\_\mathtt{NE}\_\mathtt{BA}}{\to }A.$$

These sets of nodes may coincide; however, this particular circumstance will rarely occur when considering that a continuous level of network activity would make some routes congested, therefore requiring a different route to be found.

Among each set of nodes, there is a subset consisting entirely of quantum switches.

$$\begin{array}{c}\exists \{a_1,a_2,\dots ,a_p\}\subseteq \{A_1,A_2,\dots ,A_m\},\mathrm{such}\mathrm{that}\end{array}$$

$${\mathcal{S}}_a=\{S_{a_i}\mid i=1:p\}\mathrm{are}\mathrm{QS},p\le m,$$

(1)

$$\exists \{b_1,b_2,\dots ,b_q\}\subseteq \{B_1,B_2,\dots ,B_n\},\mathrm{such}\mathrm{that}$$

$$\begin{array}{c}{\mathcal{S}}_b=\{S_{b_j}\mid j=1:q\}\mathrm{are}\mathrm{QS},q\le n.\end{array}$$

(2)

Each quantum switch is able to interpret the special message msg_NE_XY and subsequently make itself visible to sender X by confirming its status as a quantum node through a classical message sent back to source, msg_ACK_X:

$$\begin{array}{c}{S}_{a_i}\stackrel{\mathtt{msg}\_\mathtt{ACK}\_\mathtt{A}}{\to }A,\\ S_{b_j}\stackrel{\mathtt{msg}\_\mathtt{ACK}\_\mathtt{B}}{\to }B.\end{array}$$

Upon receiving confirmation from each quantum switch, Alice and Bob have their own list of IP addresses that describes a route between them consisting exclusively of quantum nodes:

• Route from Alice to Bob (known by Alice):
  $A\to S_{a_1}\to S_{a_2}\to \dots \to S_{a_p}\to B,$
• Route from Bob to Alice (known by Bob):
  $B\to S_{b_1}\to S_{b_2}\to \dots \to S_{b_q}\to A.$

To begin the distribution process, Alice and Bob each send an encoded classical message, as seen in

Table 1. Classical instruction messages sent by Alice to her known quantum switches and to Bob.

Encoding	Significance
msg_ACT_A = 0	Do nothing, i.e., route qubit to next node.
msg_ACT_A = 1	Generate entangled pair and send one particle to adjacent node.
msg_ACT_A = 2	Generate entangled pair and send each particle to the adjacent nodes.
msg_ACT_A = 3	Perform Bell measurement on qubits and communicate classical information to adjacent node.
msg_ACT_A = 4	Generate entangled pair and distribute one particle to adjacent node; perform Bell measurement on the other particle and the previously received one; communicate classical outcome to the same node the particle was sent to.

, to every node $S_{a_i}$ and $S_{b_j}$, respectively and also to their partner in order to instruct them on how to act further. This classical information is labeled msg_ACT_A and msg_ACT_B to suggest who it is sent from, Alice or Bob:

$$\begin{array}{c}A\stackrel{\mathtt{msg}\_\mathtt{ACT}\_\mathtt{A}}{\to }\{S_{a_i},B\},\\ B\stackrel{\mathtt{msg}\_\mathtt{ACT}\_\mathtt{B}}{\to }\{S_{b_j},A\}.\end{array}$$

Our designed scheme operates by isolating the number of active quantum switches (AQS) on a route between source and destination to $N=4k-1$, for $k\ge 1$. The protocol is symmetric; therefore, we will discuss here the case regarding Alice’s perspective.

Considering that $N\le p$, we may label the selected subset of AQS as ${\tilde{\mathcal{S}}}_a\subseteq {\mathcal{S}}_a$, with $|{\tilde{\mathcal{S}}}_a| = N$. Quantum switches that are not part of this subset will be referred to as being inactive (IQS). An important aspect must be clarified here. IQS are designated by Alice or Bob in order to restrict the number of quantum switches that actively participate during the protocol to $N=4k-1\le p$. This is how our scheme is devised and it operates on this symmetry argument given by the number N of AQS. There can be at most three IQS and they will be sent an instruction message that makes them operate as classical switches (CS).

For now, we consider that ${\tilde{\mathcal{S}}}_a={\mathcal{S}}_a$ for brevity in notation (the case when ${\tilde{\mathcal{S}}}_a\subset {\mathcal{S}}_a$ means that ${\mathcal{S}}_a$ differs from ${\tilde{\mathcal{S}}}_a$ by three maximum IQS, which can be considered as classical ones operating just for qubit routing).

According to the choice of N, there will be an odd number of such AQS. Following the labeling convention in Equations (1) and (2) and considering the common notation (see [9]), we will refer to the node situated halfway in the set ${\mathcal{S}}_a$ as $O_A\equiv S_{a_{2k}}$. There are $\lfloor \frac{N}{2}\rfloor =2k-1$ quantum switches on each of the segments $A-O_A$ and $O_A-B$. Considering $A\equiv S_{a_0}$ and $B\equiv S_{a_{4k}}$, halfway on the list of quantum switches found on paths $A-O_A$ and $O_A-B$ are nodes $S_{a_k}\equiv A^{\prime }$ and $S_{a_{3k}}\equiv B^{\prime }$, respectively. Taking into account both paths relative to the position of $O_A$, the nodes will act in the following manner:

• each node from ${\mathcal{S}}_a\backslash \{A^{\prime },B^{\prime }\}$ generates a pair of particles $(e,e^{\prime })$ in Bell state $|{\beta }_{00}\rangle$; Alice and Bob may agree on any Bell state ${\beta }_{ij},ij\in {\{0,1\}}^2$ to be shared after the completion of the protocol. To accomplish this task, they would need to exchange classical information encoding the identity of the Bell state (for example, $ij$), followed by Alice’s instructions sent to every quantum switch she discovered to prepare the appropriate state. The distribution process will then continue as before, making sure that after each BSM the necessary classical information is transmitted between nodes to reconstruct $|{\beta }_{ij}\rangle$ each time, so that Alice and Bob share this state in the end.
• particle e is kept and $e^{\prime }$ is sent to an adjacent node, according to the following rules:

• Path $A-O_A$:

  –

  A towards $A^{\prime }$

  $$\begin{array}{cc}\hfill A& \stackrel{e_0^{\prime }}{\to }{S}_{a_1},\hfill \\ \hfill S_{a_i}& \stackrel{e_i^{\prime }}{\to }{S}_{a_{i+1}},1\le i\le k-1,\hfill \end{array}$$

  (3)

  –

  $O_A$ towards $A^{\prime }$

  $$\begin{array}{cc}\hfill S_{a_{2k-1}}& \stackrel{e_{2k}^{\prime }}{\leftarrow }{O}_A,\hfill \\ \hfill S_{a_{i-1}}& \stackrel{e_i^{\prime }}{\leftarrow }{S}_{a_i},k+1\le i\le 2k-1,\hfill \end{array}$$

  (4)

• Path $O_A-B$:

  –

  $O_A$ towards $B^{\prime }$

  $$\begin{array}{cc}\hfill O_A& \stackrel{e_{2k}^{\prime }}{\to }{S}_{a_{2k+1}},\hfill \\ \hfill S_{a_i}& \stackrel{e_i^{\prime }}{\to }{S}_{a_{i+1}},3k-1\le i\le 2k+1,\hfill \end{array}$$

  (5)

  –

  B towards $B^{\prime }$

  $$\begin{array}{cc}\hfill S_{a_{4k-1}}& \stackrel{e_{4k}^{\prime }}{\leftarrow }B,\hfill \\ \hfill S_{a_{i-1}}& \stackrel{e_i^{\prime }}{\leftarrow }{S}_{a_i},3k+1\le i\le 4k-1.\hfill \end{array}$$

  (6)

We make an important remark here. According to the particle flow previously represented, Alice sends one particle of her EPR pair to her nearest node, which is a quantum one. Halfway node $O_A$ and Bob’s nearest node $S_N$ are also quantum nodes. This choice makes the notation consistent, although that node might as well be a classical switch, in which case it would just forward the qubit until it reaches a quantum switch. IQS and CS are not explicitly present in these representations, but they assist in the dynamics of the scheme.

A distribution of entanglement performed in a manner that does not imply swapping is depicted in Figure 2. Alice initially prepares her entangled pair of qubits and then sends one particle to her nearest node, which in turn forwards it to its neighbor and so on. There are $N+1=4k$ hops required during this process for Bob to receive the particle. Assuming each hop is realized in one unit of time, then Alice and Bob will share entanglement after $t_0\equiv 4k$ units of time.

Based on these distribution rules, there are four path segments from A to B as the following sets:

• $R_1=\{1,\dots ,k-1\},$
• $R_2=\{k+1,\dots ,2k-1\},$
• $R_3=\{2k+1,\dots ,3k-1\},$
• $R_4=\{3k+1,\dots ,4k-1\}.$

Then, as expressed in (3)–(6), $R_F\equiv R_1\cup R_3$ and $R_B\equiv R_2\cup R_4$ contain indices that identify active quantum switches on forward and backward distribution routes, respectively, as shown in Figure 3.

Considering that a classical switch cannot execute quantum-specific operations, it will not require a particular instruction message, since it can only route the received qubit further until it reaches a quantum switch.

The main goal of the protocol is to ensure particles reach nodes $A^{\prime }$ and $B^{\prime }$ via both upstream (from A and B towards $O_A$) and downstream (from $O_A$ towards A and B) routes. Considering each intermediate quantum switch, i.e., each node from ${\mathcal{S}}_a\backslash \{A^{\prime },O_A,B^{\prime }\}$ has successfully received the qubit from its nearest node and has itself sent one from its generated pair, then it performs a BSM on the two qubits from different pairs to accomplish entanglement swapping, thus propagating the entanglement towards middle nodes $A^{\prime }$ and $B^{\prime }$. Additional classical information resulting from the measurement is required to be provided to the destination node in order to preserve the original Bell state $|{\beta }_{00}\rangle$. This step is completed by applying an appropriate corrective operation $U\in \{I,{\sigma }_x,{\sigma }_z,{\sigma }_z{\sigma }_x\}$ to the received qubit. These two nodes $A^{\prime }$ and $B^{\prime }$ will be the last ones to possess two qubits received from upstream and downstream. A subsequent BSM performed by both of them on their qubits will then establish entanglement between Alice and Bob, therefore achieving the original task. We remark that a total of $N-1=4k-2$ Bell measurements are performed during the entire process, along with the same number of classical messages sent to assist in adjusting the received state to be the correct one. A visual representation of the the distribution process is shown in Figure 4.

As previously mentioned, the scheme we have presented takes advantage of a configuration of $N=4k-1$ quantum switches between Alice and Bob. Thus, $p-N$ quantum switches will not participate in the protocol. Since each active quantum switch must receive a qubit, be able to generate an entangled pair and then send one qubit to the next quantum switch, the inactive $p-N$ ones will act as classical switches and only route the qubit further, until another AQS is reached. Under these circumstances, there will be at most three IQS on the route from Alice to Bob:

● $p=4k-1=N$	⇒	all QS are AQS,
● $p=4k$	⇒	$p-N=1$ IQS,
● $p=4k+1$	⇒	$p-N=2$ IQS,
● $p=4k+2$	⇒	$p-N=3$ IQS,
● $p=4k+3=4(k+1)-1=4k^{\prime }-1=N^{\prime }.$

Figure 5 depicts a scenario that involves two IQS between two AQS.

After receiving Alice’s request message msg_NE_A, each QS sends an acknowledgment message back to Alice, revealing its address to her. When there is a non-zero difference between the number of QS (p) and the number of AQS (N), Alice makes a decision regarding which switches will participate in the protocol. Those $p-N$ excluded will be sent a classical message msg_ACT_A = 0 to assist those AQS just by forwarding the qubits received from them. She identifies nodes $A^{\prime }$, $O_A$ and $B^{\prime }$ in order to properly instruct the remaining ones about the distribution rules. Bob (B) will receive an instruction msg_ACT_A = 1 (the corresponding operation is also performed by Alice), while $O_A$ will receive msg_ACT_A = 2. Nodes $A^{\prime }$ and $B^{\prime }$ will receive from Alice msg_ACT_A = 3 to denote their BSM operation. The remaining AQS must generate entangled pairs and then perform a BSM, an operation which is communicated as msg_ACT_A = 4.

Alice generates her entangled pair and sends one particle to the nearest node; then, she waits for the protocol to execute and finally receives two bits of information from $A^{\prime }$ after its measurement, in order to recover the accurate Bell state. On Bob’s segment, $B^{\prime }$ also provides him with this classical information. After these last two measurements, Alice and Bob share an entangled pair in Bell state $|{\beta }_{00}\rangle$ to be used in yet another teleportation they wish to perform.

2.2.1. Exemplification

A representation of the protocol for the first and second particular cases is depicted in Figure 6 and Figure 7, respectively. It should be noted that CS and IQS are not pictured explicitly; however, their actions contribute to the functionality of the scheme. In Figure 6, we consider $k=1$, so there are three AQS between Alice and Bob. Nodes $A,O_A,B$ distribute generated entangled qubits directly to $A^{\prime }$ and $B^{\prime }$, which then perform a BSM and provide Alice and Bob with entanglement. In Figure 7, we consider $k=2$; therefore, seven AQS are present on the path from Alice to Bob. This time the distribution of particles propagates towards $A^{\prime }$ and $B^{\prime }$ by intermediate Bell measurements performed by the other AQS. Finally, $A^{\prime }$ and $B^{\prime }$ are the last ones to perform a BSM, which entangles the qubits kept by Alice and Bob.

2.2.2. Efficiency

We continue with emphasizing a feature of our proposal based on a time efficiency analysis. The general scenario involves the existence of these $N=4k-1$ active quantum switches between Alice and Bob. As depicted in Figure 2, the straightforward approach of Alice preparing an entangled pair and sending the other particle to Bob is done in $4k$ units of time, an interval we label as $t_0$. When the quantum switch $O_A$ between A and B is employed in the protocol, it prepares its entangled pair and sends each particle to them. Thus, the time required for each qubit to reach its destination is reduced to $t_1=t_0/2$, assuming the intermediate node is located halfway on the route from Alice to Bob and qubits travel at the same speed.

The first particular case of our protocol is $k=1$, for which there are $N=4k-1=3$ nodes between Alice and Bob that participate in the distribution, i.e., one additional quantum switch found halfway on the segments $A-O_A$ and $O_A-B$. According to the steps of the scheme, qubits must arrive at $A^{\prime }=S_{a_1}$ and $B^{\prime }=S_{a_3}$. A BSM is then performed at these stations, followed by $N-1=2$ (two) transmissions of classical information as part of entanglement swapping. Considering this classical information takes a time $t_{ci}$ to reach its destination and the transmissions occur in parallel, we observe that Alice and Bob will have their desired pair in an interval of $t_N=t_3=t_0/4+t_{ci}$.

As the number of quantum switches N increases, we derive the general relation that describes the time resources needed to supply Alice and Bob with entanglement,

$$t_N=\frac{t_0}{N+1}+t_{ci}=\frac{t_0}{4k}+t_{ci},k\ge 1.$$

(7)

As N becomes larger, the distance between quantum switches will be short enough to consider $t_{ci}$ negligible. Therefore, the protocol reduces the distribution time by a factor of $N+1=4k$ relative to direct transmission of qubits from Alice to Bob,

$$t_N=\frac{t_0}{N+1}=\frac{t_0}{4k},k\gg 1.$$

(8)

We make some important remarks here. Once all AQS receive Alice’s instruction messages, they begin executing their specific actions in parallel. For the overall distribution time, we do not account for the time it takes for AQS to receive their instructions. Given that entanglement swapping is the key principle of operation, the order in which it happens is not important because the entanglement propagates between nodes until it eventually reaches Alice and Bob. Therefore, Alice’s particle from her EPR pair must only go through one hop, unlike standard distribution which requires $4k$ hops.

The series of operations we have presented so far are related to the route from Alice to Bob. The protocol is symmetric, i.e., the analogous operations are performed from Bob’s perspective. Hence, Alice and Bob are actually supplied with two ebits in the time interval $t_N$, one ebit from each route.

3. EntangleNet Protocol

Following the detailed description of its functionality in the previous section, we now present an algorithmic implementation of our protocol. The EntangleNet distribution scheme is presented in Algorithm 1 and it uses functions defined in Algorithms 2 and 3.

Algorithm 1 EntangleNet protocol on route X to Y.
1: procedure EntangleNet($X,Y$)
2:  X sends msg_NE_XY to Y
3:  $i\leftarrow 1$
4:  $p\leftarrow 0$	▹ number of QS from X to Y
5:  ${\mathcal{S}}_x\leftarrow \mathsf{⌀}$	▹ set of QS
6:  while $S_{X_i}\ne Y$do	▹ until destination is reached
7:     if $S_{X_i}$ is a QS then
8:      $S_{X_i}$ sends $\mathtt{msg}\_\mathtt{ACK}\_\mathtt{X}$ to X
9:      $p\leftarrow p+1$
10:    $S_{x_p}\leftarrow S_{X_i}$	▹ identify node as QS
11:    ${\mathcal{S}}_x\leftarrow {\mathcal{S}}_x\cup S_{x_p}$	▹ append to set of QS
12:   end if
13:   $i\leftarrow i+1$
14:  end while
15:  $\mathit{iqs}\leftarrow (p+1)mod4$	▹ number of IQS
16:  $N\leftarrow p-\mathit{iqs}$	▹ number of AQS
17:  $k\leftarrow (N+1)/4$
18:  ${\tilde{\mathcal{S}}}_x\leftarrow {\mathcal{S}}_x$	▹ set of AQS
19:  if $N<p$ then
20:   ${\tilde{\mathcal{S}}}_x\leftarrow$ SelectAQS$({\mathcal{S}}_x,\mathit{iqs})$	▹ subset of AQS
21:  end if
22:  $O_X\leftarrow {\tilde{S}}_{x_{2k}}$	▹ halfway node on route X to Y
23:  $X^{\prime }\leftarrow {\tilde{S}}_{x_k}$	▹ halfway on segment $X-O_X$
24:  $Y^{\prime }\leftarrow {\tilde{S}}_{x_{3k}}$	▹ halfway on segment $O_X-Y$
25:  $R_F\leftarrow \{1,\dots ,k-1\}\cup \{2k+1,\dots ,3k-1\}$	▹ forward distribution route
26:  SendActMsg$(X,X^{\prime },3)$
27:  SendActMsg$(X,Y^{\prime },3)$
28:  SendActMsg$(X,O_X,2)$
29:  SendActMsg$(X,Y,1)$
30:  X generates entangled pair $(e_0,e_0^{\prime })$
31:  X sends particle $e_0^{\prime }$ to ${\tilde{S}}_{x_1}$
32:  $O_X$ generates entangled pair $(e_{2k}^{\prime },e_{2k}^{\prime })$
33:  $O_X$ sends particles to ${\tilde{S}}_{x_{2k-1}}$ and ${\tilde{S}}_{x_{2k+1}}$
34:  Y generates entangled pair $(e_{4k},e_{4k}^{\prime })$
35:  Y sends particle $e_{4k}^{\prime }$ to $S_{x_{4k-1}}$
36:  for $S_{x_i}\notin {\tilde{\mathcal{S}}}_x,i=1:p$ do	▹ node is IQS
37:    SendActMsg$(X,S_{x_i},0)$
38:    $S_{x_i}$ forwards received qubit to adjacent node
39:  end for
40:  for ${\tilde{S}}_{x_i}\in {\tilde{\mathcal{S}}}_x\backslash \{X^{\prime },O_X,Y^{\prime }\},i=1:N$ do
41:    SendActMsg$(X,{\tilde{S}}_{x_i},4)$
42:    ${\tilde{S}}_{x_i}$ generates entangled pair $(e_i,e_i^{\prime })$
43:    if $i\in R_F$ then
44:     ${\tilde{S}}_{x_i}$ sends qubit $e_i^{\prime }$ to $S_{x_{i+1}}$
45:     BsmOtCo$({\tilde{S}}_{x_i},e_{i-1}^{\prime },e_i,S_{x_{i+1}})$
46:    else	▹ backward route
47:     ${\tilde{S}}_{x_i}$ sends qubit $e_i^{\prime }$ to $S_{x_{i-1}}$
48:     BsmOtCo$({\tilde{S}}_{x_i},e_{i+1}^{\prime },e_i,S_{x_{i-1}})$
49:    end if
50:  end for
51:  BsmOtCo$(X^{\prime },e_{k-1}^{\prime },e_{k+1},X)$
52:  BsmOtCo$(Y^{\prime },e_{3k-1}^{\prime },e_{3k+1},Y)$
53:  X and Y share entangled pair $(e_0,e_{4k})$
54: end procedure

Algorithm 2 Instruction messages to QS and destination.

1: procedure SendActMsg($X,S,v$) 2:   X sends instruction message $\mathtt{msg}\_\mathtt{ACT}\_\mathtt{X}=v$ to S 3: end procedure

Algorithm 3 Bell measurement, transmission of outcome and correction.

1: procedure BsmOtCo($S_1,e_1,e_2,S_2$) 2:   $S_1$ performs BSM on qubits $e_1$ and $e_2$ 3:   $S_1$ sends classical outcome to $S_2$ 4:   $S_2$ applies corrective operation to his qubit 5: end procedure

The main procedure of the protocol is described in a general manner that is applicable to any nodes X and Y. Function SelectAQS$({\mathcal{S}}_x,\mathit{iqs})$ is an abstract representation of the decision made by X to extract a subset of quantum switches that will be actively involved in pair generation and measurements. The execution of the protocol for our parties Alice and Bob is given in Algorithm 4.

Algorithm 4 Supply Alice and Bob with two ebits via EntangleNet

procedure RestoreEntanglement($A,B$)   EntangleNet$(A,B)$   EntangleNet$(B,A)$ end procedure

4. Conclusions

In this paper, we have presented a theoretical approach to a routing protocol that reestablishes the entangled resource between two arbitrary nodes A and B in a quantum network in order to be used further in teleportation. When compared to [9] and to the direct transmission of qubits from A to B, our proposal benefits from a speedup in time given by a factor of $4k$, increasing with the number of $N=4k-1$ active quantum switches between the end nodes.

The protocol operates by transmission of classical instruction messages issued by Alice or Bob, distribution of entangled particles to adjacent nodes and specific operations executed at each node. The scheme takes advantage of nodes we refer to as active quantum switches, inactive quantum switches and classical switches. The first type employs entanglement swapping, while the other two mediate the flow of qubits by forwarding them to adjacent nodes, until an active quantum switch is reached. Entanglement swapping performed at each AQS eventually propagates entanglement towards Alice and Bob, who, after the completion of the protocol, get to share two ebits, one from each execution route, Alice to Bob and vice versa.

As a future development, we propose the physical implementation of this prototype of the protocol with our academic partners.

References