Zhen-Zhen Li,Zi-Chen Li,*,Xiu-Bo Chen,Zhiguo Qu,Xiaojun Wang and Haizhu Pan
1School of Information Engineering,Beijing Institute of Graphic Communication,Beijing,102600,China
2Information Security Center,State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing,100876,China
3Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology,Nanjing University of Information Science and Technology,Nanjing,210044,China
4School of Electronic Engineering,Dublin City University,Dublin,9,Ireland
5College of Computer and Control Engineering,Qiqihar University,Qiqihar,161006,China
Abstract:In many earlier works,perfect quantum state transmission over the butterfly network can be achieved via quantum network coding protocols with the assist of maximally entangled states.However, in actual quantum networks,a maximally entangled state as auxiliary resource is hard to be obtained or easily turned into a non-maximally entangled state subject to all kinds of environmental noises.Therefore, we propose a more practical quantum network coding scheme with the assist of non-maximally entangled states.In this paper,a practical quantum network coding protocol over grail network is proposed,in which the non-maximally entangled resource is assisted and even the desired quantum state can be perfectly transmitted.The achievable rate region,security and practicability of the proposed protocol are discussed and analyzed.This practical quantum network coding protocol proposed over the grail network can be regarded as a useful attempt to help move the theory of quantum network coding towards practicability.
Keywords: Quantum network coding; non-maximally entangled state;quantum grail network; practical protocol
Classical network coding (CNC) [1], with many years of development, has made significant advances in classical network communications [2-4].As a breakthrough technology, CNC can effectively improve the network communication efficiency since it can achieve the maximum flow network communication and reduce the bandwidth resource consumption.In 2007, Hayashi et al.[5] first introduced this idea into quantum networks, creating a new technology called quantum network coding (QNC).QNC has now become an important research direction related to the field of quantum communication and quantum information processes.Just like the CNC,QNC can solve the transmission congestion over quantum networks, gaining higher quantum communication efficiency [6-8] and achieving larger quantum network throughput [9-11] than the traditional technology of routing.
In Hayashi et al.foundation work [5] of QNC, it is proved that quantum states can not be perfectly transmitted through the network without the assistance of auxiliary resources.Thus, in recent years, there have been more researches on the perfect QNC assisted with auxiliary resources.In general, the representative resources introduced into the QNC schemes mainly include prior entanglement [12-14] and classical communication [15-17].For the prior entanglement, in 2007,Hayashi [18] first introduced this kind of auxiliary resources into the QNC scheme over the butterfly network.Afterwards, several different kinds of perfect QNC schemes assisted with prior entanglement were proposed in [19,20].For classical communication, in 2009, Kobayashi et al.[21]first explored the perfect QNC scheme assisted with this kind of auxiliary resources, based on the linear CNC.Subsequently, various QNC schemes assisted with classical communication have been proposed in [22,23] to achieve perfect transmission of quantum states.In 2019, Li et al.[24]proposed an efficient quantum state transmission scheme via perfect quantum network coding,in which auxiliary resources of both maximally entangled state and classical communication are assisted.Through the analysis of the amounts of the introduced auxiliary resources including prior entanglement and classical communication, the QNC scheme in [24] reached the highest level of quantum communication efficiency so far.
However, on the one hand, the network models including butterfly network and quantumk-pair network studied in [18-24] are homogeneous, since the quantumk-pair network is virtually extended from the butterfly network.On the other hand, in the QNC schemes of [18-20,24],the ideal situation was considered, where the maximally entangled state was introduced as the auxiliary entanglement resource.Hence, we have been trying to propose a more practical QNC scheme without reducing quantum communication efficiency.It is well known, as a kind of general entanglement with representation, non-maximally entangled state is more common in practice and hard to be distinguished.Therefore, it is reasonable to believe that non-maximally entangled state is contributed to improving the availability and security of the QNC.

Figure 1:Quantum grail network
This work emphasizes on the proposal of a practical QNC scheme over the quantum grail network illustrated in Fig.1 with the assist of non-maximally entangled state and classical communication.From the network model, the quantum grail network we considered is rarely studied but fairly imperative since it is another fundamental primitive network [25].From the nonmaximally entangled state, it is a kind of entanglement resource that can be more easily obtained in practice, which helps our QNC scheme better suited to applications.Besides, by the use of our proposed QNC scheme, the desired quantum states can be perfectly transmitted through the network, helping to expand the existed theory of QNC.
In [25], grail network is viewed as a fundamental primitive network for CNC like butterfly network.Also like “butterfly network,”the network is named “grail network”because the network model is shaped like a “grail.” A typical communication task for CNC over grail network can be treated as the bottleneck problem like butterfly network.Applying that analogy to quantum network, the quantum communication task for QNC over quantum grail network can be treated as the quantum bottleneck problem.The specific quantum network model is illustrated in Fig.1.It can be considered as a directed acyclic network (DAN).This DAN consists of a directed acyclic graph (DAG)G=(V,E)and the edge quantum capacity functionc:E→Z+, whereVis the set of nodes whileEis the set of edges that connect pairs of nodes inV.Herein, we discuss the practical QNC scheme over this quantum grail network ond-dimension Hilbert spaceH=Cddirectly.According to the communication task of QNC, two source nodess1,s2needs to transmit two arbitrary qudit state |x1〉, |x2〉∈Hto the sink nodest1,t2simultaneously and respectively through the network under the condition thatc(e)≡1,e∈E, i.e., each edge of the network can transmit no more than one qudit state overH.
Suppose in the quantum grail network, fori∈{1,2}, each of the source nodessipossesses one quantum registerSiwhile each of the sink nodestipossesses one quantum registerTi.Quantum registerSican be considered to be received from a virtual incoming edge andTican be considered to be transmitted to a virtual outcoming edge.Before proposing our QNC protocol, the auxiliary entanglement resources of two identical non-maximally entangled states are formed as

are pre-shared between the intermediate nodesn1andn2(n3andn4) respectively, where theβm(γn) are unequal complex numbers such thatand theN1,N2,N3,N4represent the four quantum registers introduced at the corresponding nodes.Besides, for convenience, the two arbitrary qudit states initially possessed at the two source nodes can be written as an entire quantum system formed as

where the coefficientsαx1,x2are complex numbers such thatThen, the initial state over the whole network before the transmission can be written as

Next, we will describe the specific processes of the practical QNC protocol based on the non-maximally entangled state over the quantum grail network in detail.The corresponding QNC model over the grail network is illustrated in Fig.2.

Figure 2:QNC model over quantum grail network
In this process, the object is to make the particles in the quantum registers mutually entangled in the network topological order.Here, the quantum circuit of encoding is shown in Fig.3 and the detailed steps are given below.
(S1) Fori,j∈{1,2}, quantum registersRij, each initialized to |0H〉, are introduced at each source nodesi, and then the operatoris applied to the registersSiandRii, operatoris applied to the registersSiandRij(j/=i).Here, quantum operatoris defined aswhereX|i〉=|i⊕1 modd〉 is an analogue on qudits of the unitary Pauli operatorσxon qubits [26].Quantum operatoris defined aswhereR|i〉=|i?1 modd〉is the reverse transformation ofXon qudits.Thus,the whole quantum system state becomes

Then, quantum registersRiiare sent from each nodesito the intermediate noden1, registerR21is sent to the intermediate noden3, registerR12is kept at nodes1, and registersSiare kept at nodesi.Meanwhile, ancillary registerRbinitialized to |0H〉is introduced at noden1.

Figure 3:Quantum circuit of encoding
(S2) Fori∈{1,2}, applyingon the registersRiiandN1, thenon the registersN1andRbat the intermediate noden1, we have the quantum state

(S3) At the intermediate noden2, quantum registersri (i=1,2), each initialized to |0H〉,are introduced; then the quantum operatoris applied to the registersRbandri, andis applied to the registersN2andri.Thus, the quantum state becomes

Then, quantum registerr1,r2are transmitted from the noden2to noden3and to the sink nodet2respectively, the registersRb,N2are maintained atn2.
(S4) At the intermediate noden3, quantum registersRb′ initialized to |0H〉 is introduced.Applying quantum operatoron the registersr1,R21andN3, and thenon the registersN3andRb′, we have the quantum state

(S5) At the intermediate noden4, quantum registersri′(i∈{1,2}), each initialized to |0H〉,are introduced; then the quantum operatoris applied to the registersrb′,N4andr1′.Thus, the quantum state becomes

Then, quantum registerr1′,r2′ are transmitted from the noden4to the sink nodet1andt2respectively, the registersRb′,N4are maintained atn4.
(S6) For each sink node (i∈{1,2}), the quantum registerTiinitialized to |0H〉is introduced.Remembering thatt2has received registerr2in step (S3) and registerr2′ in step (S5), the quantum operatoris applied tor2andT2,is applied tor2′ andT2at the sink nodet2.Simultaneously, the quantum operatoris applied tor1′ andT1at the sink nodet1.
Hence, the resulting state becomes

In this process, the object is to remove all the entangled particles in the network topological order.Here, the quantum circuit of decoding is shown in Fig.4 and the detailed steps are given as below.
(T1) Considering the owned registersRb′,N4, the intermediate noden4performs the quantum operationfollowed by the Bell measurement on the two qudits, providing the measurement resultu1u2.Here, it is worth mentioning that in the quantum systemH=Cd, the Bell states are represented as follows:


Figure 4:Quantum circuit of decoding
Then, the basis states {|φ(u1,u2)〉}u1,u2∈Zdare called the Bell basis, and the quantum measurement in the Bell basis is called the Bell measurement.
Hence after the Bell measurement, we obtain the quantum state

Then, classical informationu1u2are transmitted from the noden4ton3through the bottleneck channel.
(T2) Upon receiving the informationu1u2, the noden3applies the quantum unitary operator on its registerN3, mapping the state |x〉 toe2πιu1x/d|x?u2〉 for eachx∈Zd.Thus, the phase resulting from the Bell measurement in (T1) is corrected.Next, quantum Fourier measurement is performed onN3, providing the measurement resultl.Here, it is worth mentioning that in the quantum systemH= Cd, quantum Fourier transformFis a unitary transformation that transforms the computing basis states {|k〉}k∈Zdto the Fourier basis as follows:

Thus the basis states {|wk〉}k∈Zdare called the quantum Fourier basis, and the quantum measurement in the Fourier basis is called the quantum Fourier measurement.Hence after the quantum Fourier measurement, we obtain the quantum state

Then, the phase introduced is corrected as followings:the noden3applies the unitary operator on its registersr1andR21, mapping the state |x1⊕x2,?x2〉to the statee2πιlx1/d|x1⊕x2,?x2〉for anyx1,x2∈Zd.Consequently, the state then becomes

(T3) The intermediate noden2performs the quantum operationfollowed by the Bell measurement on the two qudits, providing the measurement resultu1′u2′.Thus, we obtain the quantum state

Then, classical informationu1′u2′ are transmitted from the noden2ton1through the bottleneck channel.
(T4) Once receiving the informationu1′u2′, noden1applies the quantum unitary operator on its registerN1, mapping the state |x〉toe2πιu1′x/d|x?u2′〉for eachx∈Zd.Then, quantum Fourier measurement is performed on registers andN1, producing the measurement resultl′.Hereafter,The phase introduced is corrected as followings:the noden1applies the unitary operator on its registersRii (i=1,2), mapping the state |x1,x2〉to the statee2πι(x1⊕x2)l′/d|x1,x2〉.Then, the resulting state becomes

(T5) At the source nodes1, first the quantum Fourier measurement is applied to registerR12, and then the phase introduced is corrected at the registerS1.Afterwards, quantum Fourier measurements are simultaneously applied to the registersSi (i=1,2), returning the measurement resultshi.As result, the whole quantum state becomes

Then,hiare transmitted from the nodesiton1respectively.
(T6) Upon receivinghi, the intermediate noden1corrects the phase by performing the quantum unitary operator mapping on its registerRii, wherein the state |xi〉is mapped toe2πιhixi/d|xi〉for eachxi∈Zd.Hereafter, quantum Fourier measurements are applied to the registersRiirespectively, thereby producing the measurement resultsgi.Thus the state then becomes

Then,giare transmitted from the noden1ton3pastn2respectively.
(T7) At the intermediate noden3, to correct the phase produced by the measurements, it applies the unitary operator on its registerr1andR21, mapping the state |x1⊕x2,?x2〉 to the statee2πι[g1(x1⊕x2)?(g1?g2)x2]/d|x1⊕x2,?x2〉.Hereafter, quantum Fourier measurements are applied to the registersr1andR21respectively, then after the measurement results’transmission, the sink nodet2correct the introduced phase.Afterwards, the sink nodet1andt2applies quantum Fourier measurements on the registersr1′andr2,r2′respectively.Finally, the introduced phases are corrected at the two sink node.Thus, the final quantum state becomes the desired state, as follows:

That is, the state of the quantum system over every source node is perfectly transmitted to the corresponding sink node through the quantum grail network.
The correctness of the proposed QNC protocol can be verified by the specific encoding and decoding steps.From Section 2, in the encoding process, the particles at every network node are entangled to the whole quantum system by applying relevant quantum operators on them.The resulting quantum state after the entanglement of each time is presented in the ending of every encoding steps.In the decoding process, by applying relevant quantum measurements, all the unnecessary particles are disentangled from the whole quantum system and leave alone the certain particles on the two sink nodes.The resulting quantum state after the disentanglement of each time is presented in the ending of every decoding steps.Thus, after all the encoding and decoding steps, the final quantum state at the two sink nodes formedis exactly equal to the initial source stateat the two source nodes.Therefore, according to all the calculating procedure and numerical results, the correctness of the proposed QNC protocol is verified.
It is known that the communication rate [25] betweensiandtiinnnetwork uses is defined aswhereHidenotes the Hilbert space of the transmitted quantum state owned bysi, and |·|denotes the dimension of the Hilbert space.Also, an edge capacity constraint [27],i.e.,log|H(u,v)|≤n·c((u,v)), exists when the quantum state is transmitted with the fidelity of one over the edge(u,v)∈Einnuses.
Accordingly, in our protocol presented above, the perfect transmission of the quantum state over the quantum grail network can be achieved in one use of the network, which means that the 1-flow [25] value reaches

under the condition that the capacityc((u,v))of each edge(u,v)always remains equal to 1 according to the quantum grail network model.In fact, the 1-max flow is the supremum of 1-flow over all achievable rate.Hence, 1-max flow of value 2 is achievable through our PQNC protocol,and then the achievable rate region [25,28] can be written as {(r1,r2)|r1+r2≤2}.
As is well known, the non-maximally entangled state is a kind of generalized entangled state,and is hard to be distinguished [29-31].In the actual quantum communications, it is difficult for adversaries to launch attacks by forging the non-maximally entangled state.Therefore, the non-maximally entangled states which are pre-shared over the network can effectively improve the security of the whole quantum network communications.
In terms of the network model, the quantum grail network we considered is rarely studied but fairly imperative since it is also a fundamental primitive network [25] like butterfly network.And the proposed protocol over quantum grail network can also be applied to the butterfly network.Thus, it is applicable to the communication scenarios of practically complex quantum networks.On the other hand, in terms of the non-maximally entangled state, it is a kind of entanglement resource that can be more easily obtained in practice, which helps our QNC scheme better suited to applications.
In this section, our proposed QNC protocol is compared with the existed QNC protocols [18,19,24,25] from the network model, the entanglement resource type, the amount of entanglement resource, and the success probability.The comparison result is shown in Tab.1 as below.
From the comparison result, it can be seen that for butterfly network, Hayashi’s protocol [18]and Li et al.[24] protocol show that maximally entangled states can be used as the assisted resource to obtain the perfect quantum state transmission with success probability 1.Ma et al.[19]protocol shows the success probability of which assisted by non-maximally entangled states is less than 1.For grail network, Akibue et al.[25] protocol shows that maximally entangled states also can be assisted to obtain the perfect quantum state transmission with success probability 1 but consumed more.However, our protocol shows that non-maximally entangled states can also be assisted to obtain the perfect quantum state transmission with success probability 1, and even the resource consumption is lower.Therefore, compared with the existed protocols, our protocol expresses a certain advantage.

Table 1:Comparison result of different QNC protocols
In this paper, we propose a practical QNC scheme with the assist of the non-maximally entangled state over the grail network.Firstly, in terms of the network model, the grail network is another fundamental primitive network [25].The research on the QNC scheme over grail network can effectively enrich the existing theory of QNC.Secondly, our proposed QNC scheme with the assist of non-maximally entangled state can also achieve the perfect quantum state transmission and 1-max flow quantum communications.Moreover, due to the security and practicability of the non-maximally entangled state, our QNC scheme is more applicable for actual quantum network communications.
Acknowledgement:We express our heartfelt thanks to the Beijing Institute of Graphic Communication for funding this study, as well as to the State Key Laboratory of Networking and Switching Technology for offering technical support.
Funding Statement:This work is supported by the National Natural Science Foundation of China (Grant Nos.61671087, 92046001, 61962009, 61003287, 61370188, 61373131), the Scientific Research Common Program of Beijing Municipal Commission of Education (KM202010015009,KM201610015002),the Joint Funding Project of Beijing Municipal Commission of Education and Beijing Natural Science Fund Committee (KZ201710015010), the Initial Funding for the Doctoral Program of BIGC (27170120003/020), the Fok Ying Tung Education Foundation (Grant No.131067), the Fundamental Research Funds for the Central Universities (Grant No.2019XD-A02),the Fundamental Research Funds in Heilongjiang Provincial Universities (135509116), the Major Scientific and Technological Special Project of Guizhou Province (20183001), Huawei Technologies Co.Ltd.(No.YBN2020085019), PAPD and CICAEET funds.
Conflicts of Interest:The authors declare that they have no conflicts of interest to report regarding the present study.
Computers Materials&Continua2021年8期