Loading web-font TeX/Main/Regular
Teleportation of an Unknown Four-Qubit Cluster State Based on Cluster States With Minimum Resource | IEEE Journals & Magazine | IEEE Xplore

Teleportation of an Unknown Four-Qubit Cluster State Based on Cluster States With Minimum Resource


We present a scheme for multi-hop teleportation of an unknown four-qubit cluster state based on cluster states. In this scheme, adjacent nodes are linked by a partially e...

Abstract:

In this paper, we first present a scheme for teleporting an unknown four-qubit cluster state via a cluster state chain between two distant nodes, which do not share entan...Show More

Abstract:

In this paper, we first present a scheme for teleporting an unknown four-qubit cluster state via a cluster state chain between two distant nodes, which do not share entanglement pairs directly. Adjacent nodes are linked by a partially entangled four-qubit cluster state with each other. In our scheme, we deduce the relationship between the coefficients of the entangled cluster states and the success probability of teleportation. Moreover, we derive the unitary matrixes for establishing direct channel between two distant nodes, which reduce the computational complexity and resource consumption significantly. By performing entanglement swapping simultaneously, our scheme is more flexible and efficient than most existing schemes.
We present a scheme for multi-hop teleportation of an unknown four-qubit cluster state based on cluster states. In this scheme, adjacent nodes are linked by a partially e...
Published in: IEEE Access ( Volume: 8)
Page(s): 81447 - 81457
Date of Publication: 28 April 2020
Electronic ISSN: 2169-3536

Funding Agency:


CCBY - IEEE is not the copyright holder of this material. Please follow the instructions via https://creativecommons.org/licenses/by/4.0/ to obtain full-text articles and stipulations in the API documentation.
SECTION I.

Introduction

Quantum teleportation is one of the most important branches in quantum communication and may have wide applications in quantum repeaters [1], [2], quantum dense coding [3], [4] and quantum networks [5]–​[12]. In 1993, Bennett et al. [13] first proposed quantum teleportation with a Bell pair, which was later demonstrated in an experiment by Bouwmeester et al. [14]. Quantum teleportation has been developed rapidly both theoretically [15]–​[26] and experimentally [14], [27]–​[33]. To satisfy a variety of different quantum communication scenarios, a series of protocols for quantum teleportation have been proposed involving different quantum channels such as Bell states [15]–​[18], GHZ states [19], [20], W states [21]–​[23], etc. Several theoretical predictions were realized by various experiments with linear optical systems [27], cavity QED [28] and other kinds of physical systems [14], [29]–​[33].

Long-distance quantum communication between a sender and a receiver can be divided into multiple sections of short distance. In order to transmit quantum information between nodes that do not share direct entanglement, intermediate nodes are usually introduced where quantum channels are built through entanglement shared between adjacent nodes. In most existing quantum teleportation protocols, maximally entangled Bell pairs are used as the quantum channels between the nodes. However, in practical applications, due to the decoherence from the environment, the maximally entangled channel suffers distortion and readily evolves into non-maximally entangled states, leading to the loss of information. In order to achieve long distance and high-fidelity communication, several schemes have been proposed based on the quantum error rejection, the entanglement swapping, the entanglement purification and concentration [23], [34]–​[55].

Quantum error rejection is a useful technique to faithfully transmit quantum states over large-scale quantum channels. In 2005, Kalamidas et al. [34] presented two linear-optical single-photon schemes to reject and correct arbitrary qubit errors without additional qubits. In 2007, Li et al. [35] proposed a setup for a single-photon qubit against collective noise without ancillary qubits, in which the success probability could be improved to 100%. In 2017, Jiang et al. [36] presented an original self-error-rejecting photonic qubit transmission scheme for both polarization and the spatial states of photon systems transmitted over collective noise channels. In 2019, Gao et al. [37] realized a faithful single-photon qubit transmission against the channel noise with error-rejecting coding. In recent studies, Guo et al. [38] reviewed the development of quantum error rejection and introduced several typical schemes for error-rejection transmission.

In long-distance quantum communication, entanglement purification is introduced to reduce the affect arisen from the noise. In 1996, Bennett et al. [39] firstly proposed the concept of the entanglement purification protocol based on the quantum CNOT logic operations. Subsequently, Deutsch et al. [40] reinvestigated and improved Bennett’s protocols. In 2010, Sheng and Deng [41] presented a deterministic entanglement purification protocol with hyper-entanglement, which corrected the bit-flip error and the phase-flip error in quantum communication. In 2017, Zhou and Sheng [42] presented the first polarization entanglement purification protocol for concatenated GHZ state, resorting to the photon-atom interaction in low-quality cavity. In their study, Wang and Long [43] proposed an entanglement purification protocol for an entangled nitrogen-vacancy center pair based on the nondestructive parity-check detector.

Compared with entanglement purification, entanglement concentration is the method which distills less entangled pure states into maximally entangled states. In 1996, Bennett et al. [44] proposed the first entanglement concentration protocol, which was known as the Schmidt projection method. In 2001, Yamamoto et al. [45] and Zhao et al. [46] proposed two entanglement concentration protocols based on polarization beam splitters independently. In 2008, Sheng et al. [47] presented a nonlocal entanglement concentration scheme based on cross-Kerr nonlinearities to distinguish the parity of two polarization photons. Later in 2017, Du and Long [48] reported an entanglement concentration protocol for an unknown four-electron-spin cluster state by exploring the optical selection rules derived from the quantum-dot spins in one-sided optical microcavities. In their study, Wang et al. [49] proposed a hyper-entanglement concentration protocol for nonlocal two-photon six-qubit partially hyper-entangled Bell states with the parameter-splitting method.

On the other hand, multi-hop teleportation protocols provide a way to transmit qubits from source to destination via entanglement swapping and recovering operations. In 2015, Shi et al. [51] reported a quantum wireless multi-hop network in which the unknown information was teleported hop by hop via Werner states. To improve the transmission efficiency, Zou et al. [52] proposed a multi-hop teleportation protocol to implement the quantum teleportation of an unknown two-qubit state via the composite GHZ-Bell channel. Later in 2018, Zhou et al. [23] proposed an improved multi-hop teleportation scheme for an unknown state via W states.

Cluster state is one of the most important multi-particle entangled states discovered by Briegel and Raussendorf [56] in 2001. It is worth noting that cluster states have the properties of both GHZ and W states [57] and they have been proved that they are harder to be destroyed by local operations and less susceptible to decoherence than GHZ states [56], [58], which means that cluster states have the maximum connectivity and persistent entanglement. Due to these advantages, various quantum teleportation schemes have been put forward with cluster states [59]–​[67]. For instance, in 2016 Li et al. [63] put forward a scheme for teleporting a four-qubit state via a six-qubit cluster state. In 2018, Zhao et al. [65] demonstrated that a eight-qubit cluster state could be teleported by a six-qubit cluster state. Subsequently, Sisodia and Pathak [66] reinvestigated and improved Zhao’s protocol. In their protocol only two Bell states (not a six-qubit cluster state as in [65]) were utilized as the quantum channel. However, it is impossible to generate or maintain the maximally entangled state at one’s disposal due to the inevitable influence of environmental noise.

To solve this problem, we present a scheme for teleporting an unknown four-qubit cluster state via partially entangled cluster states in a multi-hop teleportation network, where two distant nodes, the sender and the receiver, do not share the entanglement pairs directly. In our scheme, the required cluster states are distributed between adjacent nodes. All the intermediate nodes help these two distant nodes establish an entangled channel via entanglement swapping. In addition, we deduce the general unitary matrixes in the multi-hop scenario. The matrix relies only on the Bell state measurement results, so that both the computational complexity and the resource consumption are reduced significantly.

The rest of this paper is organized as follows. In Sect.II, we introduce the one-hop quantum teleportation of an unknown four-qubit cluster state via a non-maximally entangled cluster states. In Sect.III, we generalize the scheme described in Sect.II to a multi-hop scenario. The performance of our proposed scheme is discussed in Sect.IV. Conclusion is given in Sect.V.

SECTION II.

One-Hop Quantum Teleportation of an Unknown Four-Qubit Cluster State via Partially Entangled Cluster State

Suppose that the sender Alice intends to transmit an unknown four-qubit cluster state to the receiver Bob. The unknown four-qubit cluster state can be expressed as follows:\begin{align*}{\left |{ \chi }\right \rangle _ {1234}} \!= \!{(\alpha \left |{ {0000} }\right \rangle \!+\! \beta \left |{ {0011} }\right \rangle \!+\! \mu \left |{ {1100} }\right \rangle \!-\! \nu \left |{ {1111} }\right \rangle )_ {1234}}. \\ {}\tag{1}\end{align*}

View SourceRight-click on figure for MathML and additional features. Here \alpha , \beta , \mu and \nu are unknown parameters that satisfy the relationship: {\left |{ \alpha }\right | ^{2}}\!+\!{\left |{ \beta }\right | ^{2}}\!+\!{\left |{ \mu }\right | ^{2}}\!+\!{\left |{ \nu }\right | ^{2}}\!=\!1 .

Assume the quantum channel shared by Alice and Bob is \begin{align*}&\hspace {-.5pc}{\left |{ C }\right \rangle _ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^ {(1)}}} \\&= {\left ({ {a\left |{ {0000} }\right \rangle \!+ \!b\left |{ {0011} }\right \rangle \!+\! c\left |{ {1100} }\right \rangle - d\left |{ {1111} }\right \rangle } }\right )_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^ {(1)}}}. \\ {}\tag{2}\end{align*}

View SourceRight-click on figure for MathML and additional features. Here the coefficients {a, b, c, d } are real and satisfy the normalization condition {a^{2}}\!+\!{b^{2}}\!+\!{c^{2}}\!+\!{d^{2}}\!=\!1 ( a \leqslant b \leqslant c \leqslant d ) . Alice possesses qubits 1, 2, 3, 4, A_ {1}^{(1)} and A_ {2}^{(1)} . Bob possesses qubits B_ {1}^{(1)} and B_ {2}^{(1)} , as schematically shown in Fig. 1.

FIGURE 1. - A diagram shows that Alice and Bob share a four-qubit entangled cluster state.
FIGURE 1.

A diagram shows that Alice and Bob share a four-qubit entangled cluster state.

Now, the initial state that consists of qubits 1,2,3,4,A_ {1}^{(1)}, B_ {1}^{(1)},A_ {2}^{(1)} and B_ {2}^{(1)} can then be written as:\begin{equation*}{\left |{ \varphi }\right \rangle _ {1234}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} = {\left |{ \chi }\right \rangle _ {1234}} \otimes {\left |{ C }\right \rangle _ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^ {(1)}}}.\tag{3}\end{equation*}

View SourceRight-click on figure for MathML and additional features.

In order to realize the teleportation of the unknown state described in Eq. (1), Alice and Bob perform the following operations, as shown in Fig. 2.

FIGURE 2. - Quantum circuit for teleportation of an unknown four-qubit cluster state via partially entangled cluster states.
FIGURE 2.

Quantum circuit for teleportation of an unknown four-qubit cluster state via partially entangled cluster states.

Step 1, Alice performs two CNOT operations on the selective qubit pairs {1, 2}and {3, 4}, which can be expressed as:\begin{align*} CNOT = \left [{ {\begin{array}{cccc} 1& 0& 0& 0 \\ 0& 1& 0& 0 \\ 0& 0& 0& 1 \\ _{0}& 0& 1& 0\, \end{array}} }\right ].\tag{4}\end{align*}

View SourceRight-click on figure for MathML and additional features. The state of the whole system become:\begin{align*}&\hspace{-1.2pc}{\left |{ \varphi }\right \rangle _ {1234}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^ {(1)}B_ {2}^{(1)}} \\=&CNO{T_ {{{3}}4}}CNO{T_ {1{{2}}}} \\&\times \,\Biggl ({ {{{\Biggl ({ {\alpha \left |{ {0000} }\right \rangle + \beta \left |{ {0011} }\right \rangle + \mu \left |{ {1100} }\right \rangle }}}}}} \\&{{{{{{ -\, \nu \left |{ {1111} }\right \rangle } }\Biggr )}_{1234}} \otimes {\left |{ C }\right \rangle _ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^ {(1)}}}} }\Biggr ) \\=&{\left ({ {\alpha \left |{ {00} }\right \rangle + \beta \left |{ {01} }\right \rangle + \mu \left |{ {10} }\right \rangle - \nu \left |{ {11} }\right \rangle } }\right )_ {13}}{\left |{ {00} }\right \rangle _ {24}} \\&\otimes \, {\left |{ C }\right \rangle _ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}}}.\tag{5}\end{align*}
View SourceRight-click on figure for MathML and additional features.
It is obvious from Eq. (5) that Alice transfers the information of the initial unknown four-qubit cluster state described in Eq. (1) to qubits 1 and 3, which is expressed as \alpha \left |{ {00} }\right \rangle + \beta \left |{ {01} }\right \rangle + \mu \left |{ {10} }\right \rangle - \nu \left |{ {11} }\right \rangle . Now we just consider the state of qubits 1, 3, A_ {1}^{(1)} , A_{2}^{(2)} , B_ {1}^{(1)} and B_ {2}^{(1)} . The state can be expressed as:\begin{equation*}{\left |{ \varphi }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} = {\left |{ \chi }\right \rangle _ {13}} \otimes {\left |{ C }\right \rangle _ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^ {(1)}}}.\tag{6}\end{equation*}
View SourceRight-click on figure for MathML and additional features.

Step 2, Alice performs two Bell state measurements on particle pairs (1, A_ {1}^{(1)}) and (3, A_ {2}^{(1)}) with the basis of \{ \left |{ {\phi _ {00}} }\right \rangle , \left |{ {\phi _ {01}} }\right \rangle , \left |{ {\phi _ {10}} }\right \rangle , \left |{ {\phi _ {11}} }\right \rangle \} . Here \left |{ {\phi _ {00}} }\right \rangle , \left |{ {\phi _ {01}} }\right \rangle , \left |{ {\phi _ {10}} }\right \rangle and \left |{ {\phi _ {11}} }\right \rangle are determined as:\begin{align*} \left |{ {\phi _ {00}} }\right \rangle=&\frac {1}{\sqrt {2} }\left ({ {\left |{ {00} }\right \rangle \!+\!\left |{ {11} }\right \rangle } }\right ),\left |{ {\phi _ {01}} }\right \rangle = \frac {1}{\sqrt {2} }\left ({ {\left |{ {01} }\right \rangle \!+\!\left |{ {10} }\right \rangle } }\right ), \\ \left |{ {\phi _ {10}} }\right \rangle=&\frac {1}{\sqrt {2} }\left ({ {\left |{ {00} }\right \rangle - \left |{ {11} }\right \rangle } }\right ),\left |{ {\phi _ {11}} }\right \rangle = \frac {1}{\sqrt {2} }\left ({ {\left |{ {01} }\right \rangle - \left |{ {10} }\right \rangle } }\right ).\tag{7}\end{align*}

View SourceRight-click on figure for MathML and additional features.

When these two Bell state measurements are performed, there are sixteen possible collapsed states possessed by Bob, as follows:\begin{align*}&\hspace{-1.2pc}{}_ {3A_ {2}^{(1)}}\left \langle{ {\phi _ {00}} }\right | {}_ {1A_ {1}^ {(1)}}{\left \langle{ {{\phi _ {00}}} \mathrel {\left |{ {\vphantom {{\phi _ {00}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} \\=&\frac {1}{2}{\left ({ {\alpha a\left |{ {00} }\right \rangle + \beta b\left |{ {01} }\right \rangle + \mu c\left |{ {10} }\right \rangle + \nu d\left |{ {11} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.2pc} {}_ {3A_ {2}^{(1)}}\left \langle{ {\phi _ {10}} }\right | {}_ {1A_ {1}^ {(1)}}{\left \langle{ {{\phi _ {00}}} \mathrel {\left |{ {\vphantom {{\phi _ {00}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} \\=&\frac {1}{2}{\left ({ {\alpha a\left |{ {00} }\right \rangle - \beta b\left |{ {01} }\right \rangle + \mu c\left |{ {10} }\right \rangle - \nu d\left |{ {11} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.2pc}{}_ {3A_ {2}^ {(1)}}\left \langle{ {\phi _ {01}} }\right | {}_ {1A_ {1}^{(1)}}{\left \langle{ {{\phi _ {00}}} \mathrel {\left |{ {\vphantom {{\phi _ {00}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} \\=&\frac {1}{2}{\left ({ {\alpha b\left |{ {01} }\right \rangle \!+\!\beta a\left |{ {00} }\right \rangle - \mu d\left |{ {11} }\right \rangle - \nu c\left |{ {10} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.2pc} {}_ {3A_ {2}^{(1)}}\left \langle{ {\phi _ {11}} }\right | {}_ {1A_ {1}^{(1)}}{\left \langle{ {{\phi _ {00}}} \mathrel {\left |{ {\vphantom {{\phi _ {00}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^ {(1)}} \\=&\frac {1}{2}{\left ({ {\alpha b\left |{ {01} }\right \rangle - \beta a\left |{ {00} }\right \rangle - \mu d\left |{ {11} }\right \rangle + \nu c\left |{ {10} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.2pc} {}_ {3A_ {2}^{(1)}}\left \langle{ {\phi _ {00}} }\right | {}_ {1A_ {1}^ {(1)}}{\left \langle{ {{\phi _ {10}}} \mathrel {\left |{ {\vphantom {{\phi _ {10}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} \\=&\frac {1}{2}{\left ({ {\alpha a\left |{ {00} }\right \rangle + \beta b\left |{ {01} }\right \rangle - \mu c\left |{ {10} }\right \rangle - \nu d\left |{ {11} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.2pc}{}_ {3A_ {2}^ {(1)}}\left \langle{ {\phi _ {10}} }\right | {}_ {1A_ {1}^{(1)}}{\left \langle{ {{\phi _ {10}}} \mathrel {\left |{ {\vphantom {{\phi _ {10}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} \\=&\frac {1}{2}{\left ({ {\alpha a\left |{ {00} }\right \rangle - \beta b\left |{ {01} }\right \rangle - \mu c\left |{ {10} }\right \rangle + \nu d\left |{ {11} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.2pc} {}_ {3A_ {2}^{(1)}}\left \langle{ {\phi _ {01}} }\right | {}_ {1A_ {1}^{(1)}}{\left \langle{ {{\phi _ {10}}} \mathrel {\left |{ {\vphantom {{\phi _ {10}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} \\=&\frac {1}{2}{\left ({ {\alpha b\left |{ {01} }\right \rangle \!+\!\beta a\left |{ {00} }\right \rangle + \mu d\left |{ {11} }\right \rangle + \nu c\left |{ {10} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.0pc} {}_ {3A_ {2}^{(1)}}\left \langle{ {\phi _ {11}} }\right | {}_ {1A_ {1}^ {(1)}}{\left \langle{ {{\phi _ {10}}} \mathrel {\left |{ {\vphantom {{\phi _ {10}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} \\=&\frac {1}{2}{\left ({ {\alpha b\left |{ {01} }\right \rangle - \beta a\left |{ {00} }\right \rangle + \mu d\left |{ {11} }\right \rangle - \nu c\left |{ {10} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.2pc} {}_ {3A_ {2}^ {(1)}}\left \langle{ {\phi _ {00}} }\right | {}_ {1A_ {1}^{(1)}}{\left \langle{ {{\phi _ {01}}} \mathrel {\left |{ {\vphantom {{\phi _ {01}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} \\=&\frac {1}{2}{\left ({ {\alpha c\left |{ {10} }\right \rangle - \beta d\left |{ {11} }\right \rangle + \mu a\left |{ {00} }\right \rangle - \nu b\left |{ {01} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.4pc} {}_ {3A_ {2}^{(1)}}\left \langle{ {\phi _ {10}} }\right | {}_ {1A_ {1}^{(1)}}{\left \langle{ {{\phi _ {01}}} \mathrel {\left |{ {\vphantom {{\phi _ {01}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}}\end{align*}

View SourceRight-click on figure for MathML and additional features.\begin{align*}=&\frac {1}{2}{\left ({ {\alpha c\left |{ {10} }\right \rangle + \beta d\left |{ {11} }\right \rangle + \mu a\left |{ {00} }\right \rangle + \nu b\left |{ {01} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-0.0pc} {}_ {3A_ {2}^{(1)}}\left \langle{ {\phi _ {01}} }\right | {}_ {1A_ {1}^ {(1)}}{\left \langle{ {{\phi _ {01}}} \mathrel {\left |{ {\vphantom {{\phi _ {01}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} \\=&\frac {1}{2}{\left ({ { - \alpha d\left |{ {11} }\right \rangle \!+\!\beta c\left |{ {10} }\right \rangle + \mu b\left |{ {01} }\right \rangle - \nu a\left |{ {00} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.0pc} {}_ {3A_ {2}^{(1)}}\left \langle{ {\phi _ {11}} }\right | {}_ {1A_ {1}^{(1)}}{\left \langle{ {{\phi _ {01}}} \mathrel {\left |{ {\vphantom {{\phi _ {01}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} \\=&\frac {1}{2}{\left ({ { - \alpha d\left |{ {11} }\right \rangle - \beta c\left |{ {10} }\right \rangle + \mu b\left |{ {01} }\right \rangle + \nu a\left |{ {00} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.2pc} {}_ {3A_ {2}^{(1)}}\left \langle{ {\phi _ {00}} }\right | {}_ {1A_ {1}^{(1)}}{\left \langle{ {{\phi _ {11}}} \mathrel {\left |{ {\vphantom {{\phi _ {11}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} \\=&\frac {1}{2}{\left ({ {\alpha c\left |{ {10} }\right \rangle - \beta d\left |{ {11} }\right \rangle - \mu a\left |{ {00} }\right \rangle + \nu b\left |{ {01} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.2pc}{}_ {3A_ {2}^ {(1)}}\left \langle{ {\phi _ {10}} }\right | {}_ {1A_ {1}^{(1)}}{\left \langle{ {{\phi _ {11}}} \mathrel {\left |{ {\vphantom {{\phi _ {11}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} \\=&\frac {1}{2}{\left ({ {\alpha c\left |{ {10} }\right \rangle + \beta d\left |{ {11} }\right \rangle - \mu a\left |{ {00} }\right \rangle - \nu b\left |{ {01} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.2pc} {}_ {3A_ {2}^{(1)}}\left \langle{ {\phi _ {01}} }\right | {}_ {1A_ {1}^{(1)}}{\left \langle{ {{\phi _ {11}}} \mathrel {\left |{ {\vphantom {{\phi _ {11}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^{(1)}} \\=&\frac {1}{2}{\left ({ { - \alpha d\left |{ {11} }\right \rangle \!+\!\beta c\left |{ {10} }\right \rangle - \mu b\left |{ {01} }\right \rangle + \nu a\left |{ {00} }\right \rangle } }\right )_ {B_ {1}^ {(1)}B_ {2}^{(1)}}}, \\&\hspace{-1.2pc} {}_ {3A_ {2}^{(1)}}\left \langle{ {\phi _ {11}} }\right | {}_ {1A_ {1}^ {(1)}}{\left \langle{ {{\phi _ {11}}} \mathrel {\left |{ {\vphantom {{\phi _ {11}} \varphi }} }\right . } {\varphi } }\right \rangle _ {13}}_ {A_ {1}^{(1)}B_ {1}^{(1)}A_ {2}^{(1)}B_ {2}^ {(1)}} \\=&\frac {1}{2}{\left ({ { - \alpha d\left |{ {11} }\right \rangle - \beta c\left |{ {10} }\right \rangle - \mu b\left |{ {01} }\right \rangle - \nu a\left |{ {00} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}.\tag{8}\end{align*}
View SourceRight-click on figure for MathML and additional features.

Next, Alice tells her measurement outcomes to Bob via classical communication. According to Alice’s measurement results, Bob performs corresponding unitary operations on his qubits B_ {1}^{(1)} and B_ {2}^{(1)} . The unitary operations {U_ {B_ {1}^{(1)}B_ {2}^{(1)}}} can be represented by Pauli matrices:\begin{align*}X=\left [{ {\begin{array}{cc} 0& 1 \\ _{1}& 0\, \end{array}} }\right ],\quad Y = \left [{ {\begin{array}{cc} 0& { - i} \\ _{i}& 0\, \end{array}} }\right ],~Z = \left [{ {\begin{array}{cc} 1& 0 \\ _{0}& {\, -\, 1}\, \end{array}} }\right ]\end{align*}

View SourceRight-click on figure for MathML and additional features.,and \begin{align*}I = \left [{ {\begin{array}{cc} 1& 0 \\ _{0}& 1\, \end{array}} }\right ].\end{align*}
View SourceRight-click on figure for MathML and additional features.
The detailed relationship between the measurement outcomes {\left |{ {\phi _ {m_ {1}{m_ {2}}}} }\right \rangle _ {1A_ {1}^{(1)}}}, \left |{ {\phi _ {n_ {1}{n_ {2}}}} }\right \rangle {}_ {3A_ {2}^{(1)}} \left ({ {m_ {1},{m_ {2}},{n_ {1}},{n_ {2}} \in \left [{ {0,1} }\right ]} }\right ) and the corresponding unitary operations is given in Table 1.

TABLE 1 The Relationship Between the Measurements Outcomes of Alice and the Unitary Operation Performed by Bob
Table 1- 
The Relationship Between the Measurements Outcomes of Alice and the Unitary Operation Performed by Bob

According to the unitary operations mentioned above, Bob’s qubits \left |{ {\varphi _ {m}} }\right \rangle (m = 0,1,2,3) collapse into one of the following states:\begin{align*}\left |{ {\varphi _ {0}} }\right \rangle \! =\!\frac {1}{\sqrt {p_ {0}} }{\left ({ {\alpha a\left |{ {00} }\right \rangle \!+\! \beta b\left |{ {01} }\right \rangle \!+ \!\mu c\left |{ {10} }\right \rangle \!+ \!\nu d\left |{ {11} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\ {}\tag{9}\end{align*}

View SourceRight-click on figure for MathML and additional features. with the probability {p_ {0}}\!=\!{\left |{ {\alpha a} }\right | ^{2}}\!+\!{\left |{ {\beta b} }\right | ^ {2}}\!+\!{\left |{ {\mu c} }\right | ^{2}}\!+\!{\left |{ {\nu d} }\right | ^{2}} or \begin{align*}\left |{ {\varphi _ {1}} }\right \rangle \! =\! \frac {1}{\sqrt {p_ {1}} }{\left ({ {\alpha b\left |{ {00} }\right \rangle \!+\!\beta a\left |{ {01} }\right \rangle \!+\!\mu d\left |{ {10} }\right \rangle + \nu c\left |{ {11} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\ {}\tag{10}\end{align*}
View SourceRight-click on figure for MathML and additional features.
with the probability {p_ {1}}\!=\!{\left |{ {\alpha b} }\right | ^{2}}\!+\!{\left |{ {\beta a} }\right | ^ {2}}\!+\!{\left |{ {\mu d} }\right | ^{2}}\!+\!{\left |{ {\nu c} }\right | ^{2}} or \begin{align*}\left |{ {\varphi _ {2}} }\right \rangle \!=\!\frac {1}{\sqrt {p_ {2}} }{\left ({ {\alpha c\left |{ {00} }\right \rangle \!+\!\beta d\left |{ {01} }\right \rangle \!+\! \mu a\left |{ {10} }\right \rangle \!+\!\nu b\left |{ {11} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}, \\ {}\tag{11}\end{align*}
View SourceRight-click on figure for MathML and additional features.
with the probability {p_ {2}}\!=\!{\left |{ {\alpha c} }\right | ^{2}}\!+\!{\left |{ {\beta d} }\right | ^ {2}}\!+\!{\left |{ {\mu a} }\right | ^{2}}\!+\!{\left |{ {\nu b} }\right | ^{2}} or \begin{align*}\left |{ {\varphi _ {3}} }\right \rangle \! =\!\frac {1}{\sqrt {p_ {3}} }{\left ({ {\alpha d\left |{ {00} }\right \rangle \!+\!\beta c\left |{ {01} }\right \rangle \! + \!\mu b\left |{ {10} }\right \rangle \!+\! \nu a\left |{ {11} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}. \\ {}\tag{12}\end{align*}
View SourceRight-click on figure for MathML and additional features.
with the probability {p_ {3}}\!=\!{\left |{ {\alpha d} }\right | ^{2}}\!+\!{\left |{ {\beta c} }\right | ^ {2}}\!+\!{\left |{ {\mu b} }\right | ^{2}}\!+\!{\left |{ {\nu a} }\right | ^{2}} .

Step 3, Bob performs the generalized measurement given by Kraus operators [55] for \left |{ {\varphi _ {m}} }\right \rangle ~(m = 0,1,2,3) \begin{align*}{E_ {Sm}}=&\sum \limits _ {i,j = 0}^{1} {b_ {ij}} \left |{ {ij} }\right \rangle \left \langle{ {ij} }\right |, \tag{13a}\\ {E_ {Fm}}=&\sum \limits _ {i,j = 0}^{1} {\sqrt {1 - {b_ {ij}}^{2}} } \left |{ {ij} }\right \rangle \left \langle{ {ij} }\right |.\tag{13b}\end{align*}

View SourceRight-click on figure for MathML and additional features.

The relationship between all the possible states of qubits B_ {1}^{(1)}, B_ {2}^{(1)} and {b_ {ij}} (i,j = 0,1) for the Kraus operators is given in Table 2.

TABLE 2 The Relationship Between All the Possible State of Qubits B_ {1}^{(1)} , B_ {2}^{(1)} and the Coefficients {b_ {ij}} (i,j = 0,1) for the Kraus Operators
Table 2- 
The Relationship Between All the Possible State of Qubits 
$B_ {1}^{(1)}$
, 
$B_ {2}^{(1)}$
 and the Coefficients 
${b_ {ij}} (i,j = 0,1)$
 for the Kraus Operators

For example, if Bob’s qubits collapse into the state \left |{ {\varphi _ {0}} }\right \rangle , when {E_ {S0}} is obtained, the state of qubits B_ {1}^{(1)} and B_ {2}^{(1)} will collapse into:\begin{equation*}{\left |{ \varphi }\right \rangle _ {B_ {1}^{(1)}B_ {2}^{(1)}}}\!=\!a{\left ({ {\alpha \left |{ {00} }\right \rangle \!+\! \beta \left |{ {01} }\right \rangle \!+\! \mu \left |{ {10} }\right \rangle \!+\! \nu \left |{ {11} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}.\tag{14}\end{equation*}

View SourceRight-click on figure for MathML and additional features.

The success probability can be calculated as p = {p_ {0}}\left \langle{ {\varphi _ {0}} }\right | E_ {S0}^\dagger {E_ {S0}}\left |{ {\varphi _ {0}} }\right \rangle = {\left |{ a }\right | ^{2}}. To obtain the initial four-qubit cluster state described in Eq. (1), Bob introduces another two ancillary qubits {B_ {3}} and {B_ {4}} with the initial state {\left |{ {00} }\right \rangle _ {B_ {3}{B_ {4}}}} and then executes two CNOT operations on the selective qubit pairs \{B_ {1}^{(1)},\;{B_ {3}} \} and \{B_ {2}^{(1)},\;{B_ {4}} \} .\begin{align*}&\hspace{-1.2pc}{\left |{ {\varphi ^{(1)}} }\right \rangle _ {B_ {1}^{(1)}{B_ {3}}B_ {2}^{(1)}{B_ {4}}}} \\=&CNO{T_ {B_ {2}^{(1)}{B_ {4}}}}CNO{T_ {B_ {1}^{(1)}{B_ {3}}}} \\&\times \,{\left ({ {\alpha \left |{ {00} }\right \rangle + \beta \left |{ {01} }\right \rangle \!+ \!\mu \left |{ {10} }\right \rangle + \nu \left |{ {11} }\right \rangle } }\right )_ {B_ {1}^{(1)}B_ {2}^{(1)}}}{\left |{ {00} }\right \rangle _ {B_ {3}{B_ {4}}}}\; \\=&{\left ({ {\alpha \left |{ {0000} }\right \rangle \!+\! \beta \left |{ {0011} }\right \rangle + \mu \left |{ {1100} }\right \rangle + \nu \left |{ {1111} }\right \rangle } }\right )_ {B_ {1}^{(1)}{B_ {3}}B_ {2}^ {(1)}{B_ {4}}}}. \\ {}\tag{15}\end{align*}

View SourceRight-click on figure for MathML and additional features.

Finally, Bob applies a CZ gate on qubits B_ {1}^{(1)} and B_ {2}^{(1)} , as follows:\begin{align*}CZ = \left [{ {\begin{array}{cccc} 1& 0& 0& 0 \\ 0& 1& 0& 0 \\ 0& 0& 1& 0 \\ _{0}& 0& 0& {\, -\, 1}\, \end{array}} }\right ].\tag{16}\end{align*}

View SourceRight-click on figure for MathML and additional features. We obtain the following state:\begin{align*}&\hspace{-1.2pc}{\left |{ {\varphi ^{\left ({ 2 }\right )}} }\right \rangle _ {B_ {1}^{(1)}{B_ {3}}B_ {2}^{(1)}{B_ {4}}}} \\=&C{Z_ {B_ {1}^{(1)}{B_ {2}}^{(1)}}}{\Bigg ({ {\alpha \left |{ {0000} }\right \rangle + \beta \left |{ {0011} }\right \rangle + \mu \left |{ {1100} }\right \rangle }}} \\&{{{+\, \nu \left |{ {1111} }\right \rangle } }\Bigg )_ {B_ {1}^ {(1)}{B_ {3}}B_ {2}^{(1)}{B_ {4}}}} \\=&{\left ({ {\alpha \left |{ {0000} }\right \rangle + \beta \left |{ {0011} }\right \rangle \!+ \!\mu \left |{ {1100} }\right \rangle \!- \!\nu \left |{ {1111} }\right \rangle } }\right )_ {B_ {1}^ {(1)}{B_ {3}}B_ {2}^{(1)}{B_ {4}}}}. \\ {}\tag{17}\end{align*}
View SourceRight-click on figure for MathML and additional features.
In this way, the unknown four-qubit cluster state shown in Eq. (1) is teleported to the remote receiver Bob successfully.

Similarly, combining all the situations shown in Eq. (9)–​Eq. (12) and Table 2, Bob can obtain the teleported state with a certain probability. The total success probability of the teleportation can be calculated as:\begin{equation*} {P_ {total}} = \sum \limits _ {m = 0}^{3} {p_ {m}\left \langle{ {\varphi _ {m}} }\right | } E_ {Sm}^\dagger {E_ {Sm}}\left |{ {\varphi _ {m}} }\right \rangle = 4{\left |{ a }\right | ^{2}}.\tag{18}\end{equation*}

View SourceRight-click on figure for MathML and additional features.

Note that if we use maximally entangled quantum channel, i.e. , \left |{ a }\right | \!=\!\left |{ b }\right | \!=\!\left |{ c }\right | \!=\!\left |{ d }\right | \!=\!\frac {1}{2} , the total success probability reaches maximum 100%.

SECTION III.

Multi-Hop Quantum Teleportation of an Unknown Four-Qubit Cluster State via Partially Entangled Cluster State

The above scheme can be generalized to a multi-hop scenario via non-maximally entangled cluster states, in which there is no direct channel between the sender Alice and the receiver Bob. In detail, we suppose there are totally T~(T \geqslant 1) intermediate nodes between Alice and Bob. As shown in Fig. 3, all the participants are linked by one channel with its neighboring nodes, which can be expressed as:\begin{align*}&\hspace{-1.2pc}{\left |{ C }\right \rangle _ {{\text {A}}_ {1}^{(i)}{\text {B}}_ {1}^ {(i)}{\text {A}}_ {2}^{(i)}{\text {B}}_ {2}^{(i)}}} \\=&(a_ {00}^{(i)}| 0000\rangle + a_ {01}^{(i)}| 0011\rangle + a_ {10}^{(i)}| 1100\rangle \\&-\, a_ {11}^{(i)}| 1111\rangle )_ {{{\text {A}}_ {1}^{(i)}{\text {B}}_ {1}^ {(i)}{\text {A}}_ {2}^{(i)}{\text {B}}_ {2}^{(i)}}}.\tag{19}\end{align*}

View SourceRight-click on figure for MathML and additional features. Here the coefficients a_ {00}^{(i)},\;a_ {01}^{(i)},\;a_ {10}^{(i)},\;a_ {11}^{(i)}\;(i = 1,\;2,\; \cdots ,\;T\!+\!1) satisfy the normalization condition a_ {00}^{(i)} \leqslant a_ {01}^{(i)} \leqslant a_ {10}^{(i)} \leqslant a_ {11}^ {(i)} and {\left ({ {a_ {00}^{(i)}} }\right )^{2}}\!+\!{\left ({ {a_ {01}^{(i)}} }\right )^ {2}}\!+\!{\left ({ {a_ {10}^{(i)}} }\right )^{2}}\!+\!{\left ({ {a_ {11}^{(i)}} }\right )^{2}}\!=\!1 .

FIGURE 3. - 
${T} +1$
 cluster states are shared between Alice, Bob and the intermediate nodes. 
${T}$
 is the number of the intermediate node.
FIGURE 3.

{T} +1 cluster states are shared between Alice, Bob and the intermediate nodes. {T} is the number of the intermediate node.

Step 1, Alice and all the intermediate nodes perform CZ gates on their own qubit pair \{ A_ {1}^{(i)} , A_ {2}^{(i)} \} (i= 1 , 2, 3, {\dots } , T+1 ) to preprocess the channel, where qubit A_ {1}^{(i)} works as the controlling qubit and qubit A_ {2}^{(i)} works as the target qubit. Now the state of the entire system can be decomposed as (20), as shown at the bottom of the previous page.

Step 2, T intermediate nodes perform two Bell state measurements on particle pairs \{ B_ {1}^{(i)}, A_ {1}^{(i + 1)}\} and { B_ {2}^{(i)} , A_ {2}^{(i + 1)} }( i= 1,2,3, {\dots }, T) with the basis of \{ \left |{ {\phi _ {00}} }\right \rangle , \left |{ {\phi _ {01}} }\right \rangle , \left |{ {\phi _ {10}} }\right \rangle , \left |{ {\phi _ {11}} }\right \rangle \} , respectively, as shown in Fig. 4.

FIGURE 4. - Quantum circuit for multi-hop teleportation of an unknown four-qubit cluster state via non- maximally entangled cluster states.
FIGURE 4.

Quantum circuit for multi-hop teleportation of an unknown four-qubit cluster state via non- maximally entangled cluster states.

Now the entire state can be written as (21), shown at the bottom of the next page.

Here, the unitary matrixes {U1} and {U2} can be expressed by:\begin{align*} {U_ {1}}=&[L_ {00}^{1},L_ {01}^{1},L_ {10}^{1},L_ {11}^{1}] \cdot [{I_ {A_ {1}^{(1)}}},{X_ {A_ {1}^ {(1)}}},{Z_ {A_ {1}^{(1)}}},{Z_ {A_ {1}^{(1)}}}{X_ {A_ {1}^{(1)}}}]', \\ {U_ {2}}=&[L_ {00}^{2},L_ {01}^ {2},L_ {10}^{2},L_ {11}^{2}] \cdot [{I_ {A_ {2}^{(1)}}},{X_ {A_ {2}^{(1)}}},{Z_ {A_ {2}^{(1)}}},{Z_ {A_ {2}^{(1)}}}{X_ {A_ {2}^ {(1)}}}]'. \\ {}\tag{22}\end{align*}

View SourceRight-click on figure for MathML and additional features.with \begin{align*} L_ {00}^{1}=&\overline { \oplus _ {i = 1}^{T}m_ {1}^{(i)}} \cdot \overline { \oplus _ {i = 1}^{T}n_ {1}^{(i)}},\quad L_ {01}^{1}\!=\!\overline { \oplus _ {i = 1}^{T}m_ {1}^{(i)}} \cdot \oplus _ {i = 1}^ {T}n_ {1}^{(i)}, \\ L_ {10}^{1}=&\oplus _ {i = 1}^{T}m_ {1}^{(i)} \cdot \overline { \oplus _ {i = 1}^{T}n_ {1}^{(i)}},\quad L_ {11}^{1}\!=\! \oplus _ {i = 1}^{T}m_ {1}^{(i)} \cdot \oplus _ {i = 1}^{T}n_ {1}^{(i)}. \\ \tag{23}\\ L_ {00}^{2}=&\overline { \oplus _ {i = 1}^{T}m_ {2}^{(i)}} \cdot \overline { \oplus _ {i = 1}^{T}n_ {2}^ {(i)}},\quad L_ {01}^{2}\!=\!\overline { \oplus _ {i = 2}^{T}m_ {2}^{(i)}} \cdot \oplus _ {i = 2}^{T}n_ {2}^{(i)}, \\ L_ {10}^{2}=&\oplus _ {i = 1}^{T}m_ {2}^{(i)} \cdot \overline { \oplus _ {i = 1}^{T}n_ {2}^{(i)}},\quad L_ {11}^{2}\!=\! \oplus _ {i = 1}^{T}m_ {2}^{(i)} \cdot \oplus _ {i = 1}^{T}n_ {2}^{(i)}. \\ {}\tag{24}\end{align*}
View SourceRight-click on figure for MathML and additional features.
Here, m_ {1}^{(i)},\;n_ {1}^{(i)},\;m_ {2}^{(i)},\;n_ {2}^{(i)}\;(i = 1,\;2,\;3,\; \cdots ,\;T) are used to denote the Bell state measurement results 0 or 1. The symbols “ \oplus ”, “ \cdot ” and “-” represent logic XOR, AND and negation, respectively.

According to the unitary operations mentioned above, a desired entangled channel between the source node Alice and the destination node Bob is established successfully. The state of qubits A_ {1}^{(1)},\;A_ {2}^{(1)},\;B_ {1}^{(T + 1)},\;B_ {2}^{(T + 1)} collapses into the following state:\begin{align*}&\hspace{-1.2pc}{\left |{ \varphi }\right \rangle _ {A_ {1}^{(1)}B_ {1}^{(T + 1)}A_ {2}^{(1)}B_ {2}^{(T + 1)}}} \\=&\frac {1}{\sqrt {{p_ {n_ {1}^{(1)}, \ldots ,n_ {1}^{(T)},n_ {2}^{(1)}, \ldots ,n_ {2}^{(T)}}}} }(a_ {00}^{T + 1}a_ {n_ {1}^{(T)},n_ {2}^{(T)}}^{T}a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)},n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)}}^{T - 1} \\&\cdots \, \;a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)} \oplus \cdots \oplus n_ {1}^{(1)},n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)} \oplus \cdots \oplus n_ {2}^{(1)}}^{1}\left |{ {0000} }\right \rangle \\&+\, a_ {01}^{T + 1}a_ {n_ {1}^{(T)},n_ {2}^{(T)} \oplus 1}^{T}a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)},n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)} \oplus 1}^{T - 1} \\&\cdots \, a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)} \oplus \cdots \oplus n_ {1}^{(1)},n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)} \oplus \cdots \oplus n_ {2}^{(1)} \oplus 1}^{1}\left |{ {0011} }\right \rangle \\&+ a_ {10}^{T + 1}a_ {n_ {1}^{(T)} \oplus 1,n_ {2}^{(T)}}^{T}a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)} \oplus 1,n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)}}^{T - 1} \\&\cdots \, \;a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)} \oplus \cdots \oplus n_ {1}^{(1)} \oplus 1,n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)} \oplus \cdots \oplus n_ {2}^{(1)}}^ {1}\left |{ {1100} }\right \rangle \\&+ a_ {11}^{T + 1}a_ {n_ {1}^{(T)} \oplus 1,n_ {2}^{(T)} \oplus 1}^{T}a_ {n_ {1}^ {(T)} \oplus n_ {1}^{(T - 1)} \oplus 1,n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)} \oplus 1}^{T - 1} \\&\cdots \, a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)} \oplus \cdots \oplus n_ {1}^{(1)} \oplus 1,n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)} \oplus \cdots \oplus n_ {2}^{(1)} \oplus 1}^{1}\left |{ {1111} }\right \rangle ). \\ {}\tag{25}\end{align*}

View SourceRight-click on figure for MathML and additional features.

For simplicity, we redefine the coefficients as follows:\begin{align*} {\kappa _ {00}}=&a_ {00}^{T + 1}a_ {n_ {1}^{(T)},n_ {2}^{(T)}}^{T}a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)},n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)}}^{T - 1} \\&\cdots \, \;a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)} \oplus \cdots \oplus n_ {1}^{(1)},n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)} \oplus \cdots \oplus n_ {2}^{(1)}}^{1}, \\ {\kappa _ {01}}=&a_ {01}^{T + 1}a_ {n_ {1}^{(T)},n_ {2}^{(T)} \oplus 1}^{T}a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)},n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)} \oplus 1}^{T - 1} \\&\cdots \,a_ {n_ {1}^{(T)} \oplus n_ {1}^ {(T - 1)} \oplus \cdots \oplus n_ {1}^{(1)},n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)} \oplus \cdots \oplus n_ {2}^{(1)} \oplus 1}^{1}, \\ {\kappa _ {10}}=&a_ {10}^{T + 1}a_ {n_ {1}^{(T)} \oplus 1,n_ {2}^{(T)}}^{T}a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)} \oplus 1,n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)}}^{T - 1} \\&\cdots \, \;a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)} \oplus \cdots \oplus n_ {1}^{(1)} \oplus 1,n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)} \oplus \cdots \oplus n_ {2}^{(1)}}^{1}, \\ {\kappa _ {11}}=&a_ {11}^{T + 1}a_ {n_ {1}^{(T)} \oplus 1,n_ {2}^{(T)} \oplus 1}^{T}a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)} \oplus 1,n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)} \oplus 1}^{T - 1} \\&\cdots \, a_ {n_ {1}^{(T)} \oplus n_ {1}^{(T - 1)} \oplus \cdots \oplus n_ {1}^{(1)} \oplus 1,n_ {2}^{(T)} \oplus n_ {2}^{(T - 1)} \oplus \cdots \oplus n_ {2}^{(1)} \oplus 1}^{1}.\tag{26}\end{align*}

View SourceRight-click on figure for MathML and additional features.

The probability of state given by Eq. (25) can be calculated as:\begin{equation*}{p_ {n_ {1}^{(1)}, \ldots ,n_ {1}^{(T)},n_ {2}^{(1)}, \ldots ,n_ {2}^{(T)}}} \!= \!{\left |{ {\kappa _ {00}} }\right | ^{2}}\!+\!{\left |{ {\kappa _ {01}} }\right | ^{2}} \!+\! {\left |{ {\kappa _ {10}} }\right | ^{2}} \!+\! {\left |{ {\kappa _ {11}} }\right | ^{2}}.\tag{27}\end{equation*}

View SourceRight-click on figure for MathML and additional features.

Step 3, Alice performs a CZ gate operation on qubit pair \{ A_ {1}^{(1)} , A_ {2}^{(1)} \} . Then the state will become (28), shown at the bottom of the next page.

For example, suppose the Bell state measurement outcomes of all the intermediate nodes are {\left |{ {\phi _ {00}} }\right \rangle _ {B_ {1}^{(i)}A_ {1}^{(i + 1)}}} and {\left |{ {\phi _ {00}} }\right \rangle _ {B_ {2}^{(i)}A_ {2}^{(i\!+\!1)}}}(i = 1,\;2,\;3,\; \cdots ,\;T) . The state of qubits A_ {1}^{(1)},\;A_ {2}^{(1)},\;B_ {1}^{(T + 1)},\;B_ {2}^{(T + 1)} collapses into:\begin{align*}&\hspace{-1.2pc}{\left |{ \varphi }\right \rangle _ {13A_ {1}^{(1)}B_ {1}^{(T + 1)}A_ {2}^{(1)}B_ {2}^{(T + 1)}}} \\=&{\left |{ \chi }\right \rangle _ {13}} \otimes (a_ {00}^{T + 1}a_ {00}^{T}a_ {00}^{T - 1} \cdots a_ {00}^{1}\left |{ {0000} }\right \rangle \\&+\, a_ {01}^{T + 1}a_ {01}^{T}a_ {01}^{T - 1} \cdots a_ {01}^{1}\left |{ {0011} }\right \rangle \\&+\, a_ {10}^{T + 1}a_ {10}^{T}a_ {10}^{T - 1} \cdots a_ {10}^{1}\left |{ {1100} }\right \rangle \\&-\, a_ {11}^{T + 1}a_ {11}^{T}a_ {11}^{T - 1} \cdots a_ {11}^{1}\left |{ {1111} }\right \rangle )_ {{A_ {1}^{(1)}B_ {1}^ {(T + 1)}A_ {2}^{(1)}B_ {2}^{(T + 1)}}}.\tag{29}\end{align*}

View SourceRight-click on figure for MathML and additional features.

According to Eq. (26), we redefine the coefficients as follows:\begin{align*}{\kappa _ {00}}=&a_ {00}^{T + 1}a_ {00}^{T}a_ {00}^{T - 1} \cdots a_ {00}^ {1} \\ {\kappa _ {01}}=&a_ {01}^{T + 1}a_ {01}^{T}a_ {01}^{T - 1} \cdots a_ {01}^{1}, \\ {\kappa _ {10}}=&a_ {10}^{T + 1}a_ {10}^{T}a_ {10}^{T - 1} \cdots a_ {10}^{1} \\ {\kappa _ {11}}=&a_ {11}^{T + 1}a_ {11}^{T}a_ {11}^{T - 1} \cdots a_ {11}^ {1}.\tag{30}\end{align*}

View SourceRight-click on figure for MathML and additional features.

Step 4, Alice performs two Bell state measurements. The state \left |{ {\varphi _ {m}} }\right \rangle (m = 0,1,2,3) obtained by Bob collapses into one of the following states:\begin{align*}\left |{ {\varphi _ {0}} }\right \rangle \!\!=\!\!\frac {1}{\sqrt {p_ {0}} }\left ({ {\alpha {\kappa _ {00}}\left |{ {00} }\right \rangle \!\!+\!\! \beta {\kappa _ {01}}\left |{ {01} }\right \rangle \!\!+\!\! \mu {\kappa _ {10}}\left |{ {10} }\right \rangle \!\!+\!\! \nu {\kappa _ {11}}\left |{ {11} }\right \rangle } }\right ), \\ {}\tag{31}\end{align*}

View SourceRight-click on figure for MathML and additional features. with the probability {p_ {0}}\!=\!\frac {{{\left |{ {\alpha {\kappa _ {00}}} }\right | }^{2}}\!+\!{{\left |{ {\beta {\kappa _ {01}}} }\right | }^{2}}\!+\!{{\left |{ {\mu {\kappa _ {10}}} }\right | }^{2}}\!+\!{{\left |{ {\nu {\kappa _ {11}}} }\right | }^{2}}}{{p_ {n_ {1}^{(1)}, \ldots ,n_ {1}^{(T)},n_ {2}^{(1)}, \ldots ,n_ {2}^ {(T)}}}} or \begin{align*}\left |{ {\varphi _ {1}} }\right \rangle \!\!=\!\!\frac {1}{\sqrt {p_ {1}} }\left ({ {\alpha {\kappa _ {01}}\left |{ {00} }\right \rangle \!+\!\beta {\kappa _ {00}}\left |{ {01} }\right \rangle \!\!+\!\!\mu {\kappa _ {11}}\left |{ {10} }\right \rangle \!+\! \nu {\kappa _ {10}}\left |{ {11} }\right \rangle } }\right ), \\ {}\tag{32}\end{align*}
View SourceRight-click on figure for MathML and additional features.
with the probability {p_ {1}}\!=\!\frac {{{\left |{ {\alpha {\kappa _ {01}}} }\right | }^{2}}\!+\!{{\left |{ {\beta {\kappa _ {00}}} }\right | }^{2}}\!+\!{{\left |{ {\mu {\kappa _ {11}}} }\right | }^{2}}\!+\!{{\left |{ {\nu {\kappa _ {10}}} }\right | }^{2}}}{{p_ {n_ {1}^{(1)}, \ldots ,n_ {1}^{(T)},n_ {2}^{(1)}, \ldots ,n_ {2}^ {(T)}}}} or \begin{align*}\left |{ {\varphi _ {2}} }\right \rangle \!\!=\!\!\frac {1}{\sqrt {p_ {2}} }\left ({ {\alpha {\kappa _ {10}}\left |{ {00} }\right \rangle \!+\!\beta {\kappa _ {11}}\left |{ {01} }\right \rangle \!+\! \mu {\kappa _ {00}}\left |{ {10} }\right \rangle \!\!+\!\!\nu {\kappa _ {01}}\left |{ {11} }\right \rangle } }\right ), \\ {}\tag{33}\end{align*}
View SourceRight-click on figure for MathML and additional features.
with the probability {p_ {2}}\!=\!\frac {{{\left |{ {\alpha {\kappa _ {10}}} }\right | }^{2}}\!+\!{{\left |{ {\beta {\kappa _ {11}}} }\right | }^{2}}\!+\!{{\left |{ {\mu {\kappa _ {00}}} }\right | }^{2}}\!+\!{{\left |{ {\nu {\kappa _ {01}}} }\right | }^{2}}}{{p_ {n_ {1}^{(1)}, \ldots ,n_ {1}^{(T)},n_ {2}^{(1)}, \ldots ,n_ {2}^ {(T)}}}} or \begin{align*}\left |{ {\varphi _ {3}} }\right \rangle \!\!=\!\!\frac {1}{\sqrt {p_ {3}} }\left ({ {\alpha {\kappa _ {11}}\left |{ {00} }\right \rangle \!\!+\!\!\beta {\kappa _ {10}}\left |{ {01} }\right \rangle \!+\!\mu {\kappa _ {01}}\left |{ {10} }\right \rangle \!\!+\!\! \nu {\kappa _ {00}}\left |{ {11} }\right \rangle } }\right ). \\ {}\tag{34}\end{align*}
View SourceRight-click on figure for MathML and additional features.
with the probability {p_ {3}}\!=\!\frac {{{\left |{ {\alpha {\kappa _ {11}}} }\right | }^{2}}\!+\!{{\left |{ {\beta {\kappa _ {10}}} }\right | }^{2}}\!+\!{{\left |{ {\mu {\kappa _ {01}}} }\right | }^{2}}\!+\!{{\left |{ {\nu {\kappa _ {00}}} }\right | }^{2}}}{{p_ {n_ {1}^{(1)}, \ldots ,n_ {1}^{(T)},n_ {2}^{(1)}, \ldots ,n_ {2}^ {(T)}}}} .

In the multi-hop scenario, the operators performed by Bob can be expressed as:\begin{align*}{E_ {S\left ({ {n_ {1}^{(1)},\, \ldots ,\,n_ {1}^{(T)},\,n_ {2}^{(1)},\, \ldots ,\,n_ {2}^{(T)}} }\right )}}=&\sum \limits _ {i,j = 0}^{1} {b_ {ij}} \left |{ {ij} }\right \rangle \left \langle{ {ij} }\right |,\tag{35a}\\ {E_ {F\left ({ {n_ {1}^{(1)}, \ldots ,n_ {1}^{(T)},n_ {2}^{(1)}, \ldots ,n_ {2}^{(T)}} }\right )}}=&\sum \limits _ {i,j = 0}^{1} {\sqrt {1 - {b_ {ij}}^{2}} } \left |{ {ij} }\right \rangle \left \langle{ {ij} }\right |.\tag{35b}\end{align*}

View SourceRight-click on figure for MathML and additional features.

The relationship between all the possible states of qubit B_ {1}^{(T + 1)} , B_ {2}^{(T + 1)} and {b_ {ij}}(i,j = 0,1) for the Kraus operators is given in Table 3.

TABLE 3 The Relationship Between All the Possible State of Qubits B_ {1}^{(T + 1)} , B_ {2}^{(T + 1)} and the Coefficients {b_ {ij}}(i,j = 0,1) for the Kraus Operators
Table 3- 
The Relationship Between All the Possible State of Qubits 
$B_ {1}^{(T + 1)}$
, 
$B_ {2}^{(T + 1)}$
 and the Coefficients 
${b_ {ij}}(i,j = 0,1)$
 for the Kraus Operators

Here {\kappa _ {\min }} = \min {\kappa _ {ij}},(i,j = 0,1) .

When {E_ {S\left ({ {n_ {1}^{(1)},\, \ldots ,\,n_ {1}^{(T)},\,n_ {2}^{(1)},\, \ldots ,\,n_ {2}^{(T)}} }\right )}} is obtained, Bob performs the same operations as that shown in Sec.II to obtain the initial four-qubit cluster state. The total probability of successfully recovering the original state is (36), shown at the bottom of the previous page.

Obviously, if we use the maximally entangled quantum channel, i.e. , \left |{ {a_ {00}^{(i)}} }\right | \!=\!\left |{ {a_ {01}^{(i)}} }\right | \!=\!\left |{ {a_ {10}^{(i)}} }\right | \!=\!\left |{ {a_ {11}^ {(i)}} }\right | \!=\!\frac {1}{2}\;(i = 1,2, \cdots , T\!+\!1) , the total success probability is:\begin{equation*} P\!=\!4 * {2^{2T}} * \frac {1}{{{\left ({ {{2^{T + 1}}} }\right )}^{2}}} = 1.\tag{37}\end{equation*}

View SourceRight-click on figure for MathML and additional features.

SECTION IV.

Efficiency Analysis

In quantum teleportation scheme, classical communication cost and quantum communication delay are usually used to evaluate the efficiency of the protocol.

First, we discuss the usage of classical information in our scheme. Here, the classical communication cost is defined as the number of data transmission required. In our scheme, each intermediate node needs to perform two Bell state measurements and then send measurement outcomes via classical communication. Moreover, after establishing the quantum entangled channel between source node and destination node successfully, Alice needs to publish two Bell state measurement outcomes to Bob. Therefore, the total classical information cost can be expressed as:\begin{equation*}C = 4 * \left ({ {T + 1} }\right ).\tag{38}\end{equation*}

View SourceRight-click on figure for MathML and additional features.

Second, we discuss the quantum communication delay in our scheme. Quantum communication delay usually occurs in quantum measurements, unitary operations and measurement outcomes transmission. In our scheme, all intermediate nodes perform Bell state measurement independently and transmit measurement results simultaneously, which introduces the delay of Bell measurement {d_ {meas}} and measurement outcomes transmission delay {d_ {trans}} . After that, Alice performs a series of unitary operations to adjust the entangled quantum channel, and executes Bell state measurements and transmits measurement outcomes to Bob, which introduces the delay of unitary operation {d_ {oper}} , Bell measurement {d_ {meas}} , and measurement outcomes transmission delay {d_ {trans}} . Finally, Bob performs a series of the unitary operations to recover the target four-qubit cluster state, which introduces unitary operation delay {d_ {oper}} . Therefore, the total quantum communication delay can be expressed as:\begin{equation*}{d_ {tatol}}= 2({d_ {meas}} + {d_ {trans}} + {d_ {oper}}).\tag{39}\end{equation*}

View SourceRight-click on figure for MathML and additional features.

If we take use of the hop-by-hop transmission [51], [55], the measurement and outcome transmission are performed one by one. The total communication delay in the hop-by-hop quantum teleportation can be written as:\begin{equation*}{d_ {tatol}}= (T + 1)({d_ {meas}} + {d_ {trans}} + {d_ {oper}}).\tag{40}\end{equation*}

View SourceRight-click on figure for MathML and additional features.

It is obvious from Eq. (39) and Eq. (40) that the delay of our multi-hop protocol is much less than the hop-by-hop case, especially when the amount of intermediate nodes is huge.

In Table 4, we discuss the efficiency of our scheme with T intermediate nodes and compare with other quantum teleportation schemes in the following aspects; the quantum resource consumption, the classical resource consumption, the complexity of necessary operation and the quantum state to be teleported.

TABLE 4 Comparisons Between Four Quantum Teleportation Protocols
Table 4- 
Comparisons Between Four Quantum Teleportation Protocols

It is clear from Table 4 that our scheme has several merits. First, our aim is to transfer a four-qubit state while only two-qubit state is prepared in schemes given in [52], [53]. Second, if we utilize Choudhury’s scheme to transfer an unknown four-qubit state, it needs at least 4(T+ 1 ) Bell states as quantum channels. Only T+ 1 four-qubit cluster states are required in our scheme, indicating the quantum resources used in our scheme are more effective. Third, in terms of classical resource consumption, our scheme only needs T+1 bit classical resources to teleport each qubit. It is noteworthy that our scheme did not consider the influence of noise during the transmission. In real systems, the quantum noise is unavoidable which reduces the fidelity of quantum states. Therefore, we hope the scheme can be improved later by considering the noise effect on multi-hop teleportation network.

SECTION V.

Conclusion

In summary, we propose a novel scheme for multi-hop teleportation of an arbitrary four-qubit cluster state between two distant nodes. These two nodes have no entanglement pairs shared directly. First, we make detailed calculations on one-hop teleportation of an arbitrary four-qubit cluster state and then generalized the scheme to the multi-hop case. Moreover, we deduce the relationship between the coefficients of the entangled cluster states and the probability of the successful teleportation. The success probability and the fidelity of our scheme can reach 100% when the maximally entangled channel is applied. Finally, we compare our scheme with other schemes on quantum and classical resource consumption, the complexity of necessary operation and the quantum state to be teleported. We believe our scheme is efficient. We hope our findings will stimulate more investigations on the development of quantum teleportation.

References

References is not available for this document.