Int J Theor Phys

DOI 10.1007/s10773-015-2537-y

An Efficient Scheme of Quantum Wireless Multi-hop

Communication using Coefficient Matrix

Bei Zhao · Xin-Wei Zha · Ya-Jun Duan · Xin-Mei Sun

Received: 16 June 2014 / Accepted: 13 January 2015

© Springer Science+Business Media New York 2015

Abstract By defining the coefficient matrix, a new quantum teleportation scheme in

quantum wireless multi-hop network is proposed. With the help of intermediate nodes,
an unknown qubit state can be teleported between two distant nodes which do not share
entanglement in advance. Arbitrary Bell pairs and entanglement swapping are utilized for
establishing quantum channel among intermediate nodes. Using collapsed matrix, the initial
quantum state can be perfectly recovered at the destination.

Keywords Quantum wireless communication · Quantum communication networks ·

Quantum teleportation · Coefficient matrix

1 Introduction

The wireless multi-hop network (WMN) consisted of distributed nodes but without a central
control node, such as the ad hoc network and mesh network. Because of its flexibility and
wide applications, this kind of network has drawn more and more attentions in the decade.
Due to the lack of a fixed infrastructure and all nodes sharing the open wireless channel, the
distributed wireless network can be easily attacked [1, 2]. Security is an important issue for
the distributed wireless network.
The combination of quantum physics with information technology has created a funda-
mentally new mode of communication–quantum communication ,which guarantees abso-
lutely secure communication. Thus, an novel network called quantum wireless multi-hop
network (QWMN) has been proposed.
Quantum entanglement is an important characteristic of quantum physics and is con-
sidered to be an important resource for applications of quantum information, such
as quantum teleportation [3–11], quantum key distribution [12–20], quantum secret

B. Zhao () · X.-W. Zha · Y.-J. Duan · X.-M. Sun

School of Science, Xi’an University of Posts and Telecommunications,
Xi’an, 710121, People’s Republic of China
e-mail: zhao pei1985@163.com
 Int J Theor Phys

sharing [21–28],quantum secure direct communication [29–45], deterministic secure quan-

tum communication (DSQC) [46–54], quantum dialogue [55–57] and so on. One of the
most important applications in quantum information science is the quantum teleportation.
It is used to transfer a quantum state from one node to another via entangled particles. How-
ever, there are lots of challenges in putting the quantum teleportation into use in the area
of wireless communication [58, 59]. One of the main challenges is how to deliver quantum
information from one site to a remote site even when the two sites do not share EPR pairs
mutually.
In 2005, Cheng et al. [60] first attempted to address the issue of wireless communica-
tion in the quantum domain and proposed a quantum routing mechanism in a hierarchical
network architecture to teleport a quantum state from one node to another even though they
do not share Bell pairs mutually. Bacinoglu T et al. proposed two heuristic algorithms to
generate a constant fidelity entanglement flow in quantum communication networks [61].
Then Yu et al. proposed a routing protocol for a wireless ad hoc quantum communica-
tion network and a distributed wireless network [62]. Recently, Wang et al. [63] propose a
scheme for faithful quantum communication in quantum wireless multi-hop networks, by
performing quantum teleportation based on arbitrary Bell state between two distant nodes
which do not initially share entanglement with each other.
In this paper, we present a scheme of quantum wireless multi-hop communication to tele-
port quantum state between two nodes which do not initially share entanglement. Arbitrary
Bell pairs and entanglement swapping are utilized for establishing quantum channel among
intermediate nodes. Quantum teleportation is used to transmit the unknown quantum state
from the sender to the receiver at a distant location. Through defining a series of coefficient
matrix [64], the recovery algorithm can be quickly determine in destination node. Compare
with the sequential entanglement swapping scheme commonly used in quantum repeaters,
our scheme employs simultaneous Bell measurements in all intermediate nodes in which
the measurement results and the Bell pair types are send to the destination node indepen-
dently. while in the sequential entanglement swapping scheme, the Bell measurement results
are sent to the upstream node and thus each intermediate node has to wait for the classi-
cal information transmission before performing entanglement swapping. These sequential
operations introduce large delay to the whole quantum state communication process and,
furthermore, the neighbor nodes have to build communication channels to exchange clas-
sical information. By contrast, our scheme employs simultaneous Bell measurements in
all intermediate nodes which can reduce the end-to-end communication delay. Each nodes
send their measurement results and the Bell pair types to the destination node indepen-
dently that makes the classical communication channels more flexible and are not obbligato
between neighbor nodes. And the local operations to recover the initial quantum state are
only required at the destination node.
The remainder of this paper is organized as follows. In Section 2, the network model
and characteristics of the QWMN are presented. In Section 3, an efficient scheme using
coefficient matrix is presented. The teleportation in this scheme is discussed. More gen-
eral cases of teleportation are deduced. Finally, a conclusion of this paper is given in
Section 4.

2 Model of QWMN

The model of quantum wireless multi-hop network (QWMN) is shown in Fig. 1. It has a
distributed topology and the net nodes are mobile quantum devices with both wireless and
Int J Theor Phys

Fig. 1 The model of quantum wireless multi-hop network

quantum communication capability. There are two kinds of channel between nodes: quan-
tum channel and classical channel. As shown in Fig. 1, the dashed line presents the quantum
channel and the solid line expresses the classical wireless channel. The nodes transmit
the data mainly through a quantum channel with the classical channel as a supplementary
one. The data transmitted in quantum channel is quantum bits (qubits) which is the unit of
quantum information and the one in classical channel is classical bits (c-bits). The datas
transmitted in QWMN are mostly qubits instead of c-bits.
The quantum channels take charge of transmitting the quantum information. And the
classical ones are in charge of transmitting measurement outcomes and Bell pair types
to the destination node which are necessary for recovering the initial quantum state. So
we can say that quantum information can be transferred if and only if both quantum and
classical channels, direct or hop by hop, exist simultaneously. Quantum route is com-
posed of quantum channels and classical route is composed of classical wireless channels.
It is worth noting that the two kinds of route can be different. For instance, in Fig. 1,
assume node F wants to communicate with node G. However, there is no direct quan-
tum channel between them. So we bring C and E in the communication. So, quantum
channel between F and G is F-C-E-G. While the classical channel is the direct one,
F-G.
In quantum networks, the quantum state is propagated by means of quantum tele-
portation, applying the property of EPR pairs. Four types of EPR pairs in quantum
communication are defined as [65].
1 1
|ϕ 1  = √ (|00 + |11), |ϕ 2  = √ (|00 − |11)
2 2
1 1
|ϕ  = √ (|01 + |10), |ϕ 4  =
3
√ (|01 − |10) (1)
2 2
Entangled pairs can be regarded as a uniquely quantum resource, because they will be
consumed in every process of teleportation. When the net is large enough, it is impossible
for one node to share entanglement with every node in the network. So, if there is no direct
EPR pairs between the source node and the destination node, entangle swapping [66, 67]
can be used to form EPR pairs between them.
Routing mechanism is needed to choose one routing path from source node to destina-
tion node before quantum teleportation starts. Here, we discuss quantum state transmission
rather than the routing. So we assume that the routing path has been selected appropriately
to form one line of multi-hop nodes [68–71].
 Int J Theor Phys

3 Multi-hop Quantum Teleportation in QWMN using Coefficient Matrix

When there is no derict channel between the source and destination node in QWMN, it is
more practical to teleport quantum state in multi-hop way. So, we bring intermediate nodes
in the communication process.

3.1 One-hop Case

The process of one-hop teleportation in QWMN is as same as the standard quantum tele-
portation. We first review the process of it. Let us assume that the sender Alice intends to
teleport a quantum state|y = α|1 + β|0, where α and β are complex number satisfying
|α|2 +|β|2 = 1 and the quantum channel between Alice and Bob is |ϕ 1 , which has the form
as |ϕ 1  = √1 (|00 + |11)A2 B1 . The suffixes (e.g. A2 B1 etc.) stand for the ordinal number
2
at the owners side. For example, the state with the A2 represents Alice’s second qubit. The
system state can be expressed as:

|γ s = |yA1 ⊗ |ϕ1 A2 B1 = (α|000 + α|011 + β|100 + β|111)A1 A2 B1 , (2)

Then Alice performs a Bell measurement on her two qubits and send the measurement
outcomes to Bob via classical channel. Hence (2) can be rewritten as:

|γ s = |ϕ 1 A1 A2 (α|0 + β|1)B1 + |ϕ 3 A1 A2 (α|0 − β|1)B1

+ |ϕ 2 A1 A2 (α|1 + β|0)B1 + |ϕ 4 A1 A2 (α|1 − β|0)B1
= |ϕ 1 A1 A2 |yB1 + |ϕ 3 A1 A2 Z|yB1
+ |ϕ 2 A1 A2 X|yB1 + |ϕ 4 A1 A2 Y |yB1 (3)

Therefore, according to Alice’s measurement outcome, Bob can perform local unitary
operations on his qubit to recover the original qubit state. For example, if the outcome of
Alice is |ϕ 4 A1 A2 ,Y operation are needed. As shown in Table 1, when the Bell state shared
between the source and the destination changes, the relation between Bob’s possible qubit
state and the measurement outcomes will change together. For example, if |ϕ 2  is shared and
the measurement outcome is |ϕ 4 , Bob needed to apply Z operation to recover the original
state.
As the size of network increasing, more and more intermediate nodes will involve in
the communication process. All shared Bell pairs among them are not guaranteed to be of
the same type. And the entanglement shared in every hop has an obvious affection on the
teleportation results. Consequently, not only the measurement outcomes but also the Bell
pair types should be sent to the destination node as the classical information. Therefore,
after the source node and intermediate nodes carrying out measurement simultaneously, four
c-bits classical information should be reported independently from each node on path: two
c-bits measurement outcomes and two c-bits Bell pair types.

3.2 Two-hop Case

Let us assume that Alice wants to teleport a quantum state |y to Bob. But there are no direct
quantum channels between them. So we add intermediate node Candy on the routing path.
Candy shares EPR-pair with Alice and Bob. It can be seen from Fig. 2 that Alice’s second
Int J Theor Phys

Table 1 Relation among shared EPR pair, Alice’s measurement outcomes and possible qubit state of Bob in
one-hop communication

The shared entangled state Alice’s result Bob’s qubit state

|ϕ 1  |ϕ 1  |y
|ϕ 2  X|y
|ϕ 3  Z|y
|ϕ 4  Y |y

|ϕ 1  |ϕ 2  X|y
|ϕ 2  |y
|ϕ 3  Y |y
|ϕ 4  Z|y

|ϕ 1  |ϕ 3  Z|y
|ϕ 2  Y |y
|ϕ 3  |y
|ϕ 4  X|y

|ϕ 1  |ϕ 4  Y |y
|ϕ 2  Z|y
|ϕ 3  X|y
|ϕ 4  |y

qubit and Candy’s first qubit shared the EPR-pair as |ϕ3  = √1 (|00 − |11)A C
2 1 and EPR-
2
pair |ϕ4  = − |10)C2 B1 is shared between Candy’s second qubit and Bob’s first
√1 (|01
2
qubit.
The quantum channel can be expressed as

1
|ν = |ϕ3 A2 C1 ⊗ |ϕ4 C2 B1 = (|0001 − |0010) − |1101 + |1110A2 C1 C2 B1 (4)
2
In order to realize quantum state swapping, Candy performs a Bell measurement on her
two qubits and transmits the measurement outcomes to Bob through classical channel. This
will transform (4) to the result:

1 1
|ν = (|00 + |11)C1 C2 (|01 + |10)A2 B1
2 2
1 1
+ (|00 − |11)C1 C2 (|01 − |10)A2 B1
2 2
1 1
− (|01 + |10)C1 C2 (|00 + |11)A2 B1
2 2
1 1
− (|01 − |10)C1 C2 (|00 − |11)A2 B1 (5)
2 2
After this operation, the second qubit of Alice and Bob’s first qubit begins to entangle
with each other. With the entanglement, they can perform quantum teleportation as normal.
 Int J Theor Phys

Fig. 2 Quantum circuit for two-hop communication. The wavy lines represent the classical channels, the
dashed lines represent the quantum channels and the dashed boxes represent Bell measurement which is
applied on the qubits in the box

Then Alice also carries out a Bell measurement on her two qubits and transmits the measure-
ment outcomes to Bob through classical channel. The entire system state can be expressed
as

4 
4
|γ s = |ϕ i A1 A2 |ϕ j C1 C2 |ϕ ij B1 (6)
i=1 j =1

where |ϕ i A1 A2 is the measurement result of Alice, |ϕ j C1 C2 is the measurement result of
Candy and |ϕ ij B1 is the corresponding Bob’s qubit sate. From Table 2, it can be seen
that Bob would have the information of his qubit state once he is informed of Alice’s and
Candy’s measurement outcome. For example, when Alice’s outcome is |ϕ 1  and candy’s
outcome is |ϕ 3 , Bob’s state should be α|1 − β|0.
The measurement basis of Alice(Candy) can be wrote as

|ϕ r A1 A2 (C1 C2 ) = r
Mk,l |kA1 (C1 ) ⊗ |lA2 (C2 ) , k, l = 0, 1; r = 1, 2, 3, 4. (7)
k,l

Where M is a constants. Now we employ the idea of coefficient matrix. According to

(7), a basis matrix associated to the measurement basis is defined by
r
M2,2 (|ϕ r A1 A2 (C1 C2 ) ) = (Mk,l
r
)2×2 (8)

For example, when Alice’s measurement basis is |ϕ 1  = √1 (|00 + |11), the basis
  2
1 0
matrix can be written as M2,2 (|ϕ ) = √
1 r 1
. For simplicity, in the following paper,
2 0 1
we ignore the constant ahead of the unitary matrix when we refer the measurement
  matrix
1 (|ϕ r ) = 1 0
because it has no affections on the teleportation results. So M2,2 . Similarly,
0 1
Int J Theor Phys

Table 2 Relation among Alice’s measurement outcomes, Candy’s measurement outcomes and Bob’s qubit
state in two-hop communication

Alice’s result |ϕ i A1 A2 Candy’s result |ϕ j C1 C2 Bob’s qubit state |ϕ ij B1

|ϕ 1  |ϕ 1  α|1 + β|0
|ϕ 2  α|0 + β|1
|ϕ 3  α|1 − β|0
|ϕ 4  α|0 − β|1

|ϕ 1  |ϕ 2  α|0 + β|1
|ϕ 2  α|1 + β|0
|ϕ 3  α|0 − β|1
|ϕ 4  α|1 − β|0

|ϕ 1  |ϕ 3  α|1 − β|0
|ϕ 2  α|0 − β|1
|ϕ 3  α|1 + β|0
|ϕ 4  α|0 + β|1

|ϕ 1  |ϕ 4  α|0 − β|1
|ϕ 2  α|1 − β|0
|ϕ 3  α|0 + β|1
|ϕ 4  α|1 + β|0

the basis matrix corresponding to the measurement basis |ϕ 2 , |ϕ 3 , |ϕ 4  is M2,2 2 (|ϕ 2 ) =

     
0 1 3 (|ϕ 3 ) = 1 0 4 (|ϕ 4 ) = 0 1
, M2,2 , M2,2 respectively.
1 0 0 −1 −1 0
According to this, when we multiply Alice’s basis matrix by Candy’s, we found that the
results are classified into four typesleading  Bob’s qubit to four possible states. For instance,
0 1
if the multiplication result is M = (i.e. Alice’s and Candy’s outcomes are |ϕ 1 , |ϕ 2 )
1 0
 
0 1
it leads Bob’s qubit to α|0 + β|1. If the result is M = (i.e. Alice’s and Candy’s
−1 0
 
1 0
outcomes are |ϕ 4 , |ϕ 1 ) it leads Bob’s qubit to α|0−β|1. If the result is M = (i.e.
0 1
Alice’s and Candy’s
 outcomes
 are |ϕ 3 , |ϕ 3 ) it leads Bob’s qubit to α|1 + β|0. If the
1 0
result is M = (i.e. Alice’s and Candy’s outcomes are |ϕ 4 , |ϕ 2  it leads Bob’s
0 −1
qubit to α|1 − β|0. The matrix M is named as measurement matrix. It can be seen that one
measurement matrix is only corresponding to one possible qubit state of Bob.
The EPR pairs |ϕ r T1 T2 which are used to form the quantum channel can be represented
as:

|ϕ r T1 T2 = Ci,j |iT1 ⊗ |j T2 , i, j = 0, 1; r = 1, 2, 3, 4. (9)
i,j
 Int J Theor Phys

A coefficient matrix associates to the state |ϕ r T1 T2 is defined by

C(|ϕ r T1 T2 ) = (Ci,j )2×2 (10)
which is called channel matrix.
In n-hop case, n quantum channels compose the quantum route. Namely, n EPR pairs
are used for establishing the quantum route. So the channel matrix of n-hop communication
can be wrote as
 
C= C n (|ϕ r ) = (Ci,j )2×2 (11)
n n

For example, in one-hop communication, assume the shared EPR pair is |ϕ 2 . It can be 
0 1
written as |ϕ 2  = √1 (0·|00+1·|01+1·|10+0·|11). Then we have C(|ϕ 2 ) = .
2 1 0
In two-hop case, if shared EPR pairs group is |ϕ 2 , |ϕ 3 , the channel matrix can be obtained
as

2  
0 1
C= C n (|ϕ r ) = C 1 (|ϕ 2 ) · C 2 (|ϕ 3 ) = − (12)
−1 0
n=1
We should note that the minus sign in the channel matrix is global phases which have no
affections to the teleportation results. Hence, in the following paper, we ignore them when
we refer coefficient matrix.
Then we define a coefficient matrix called collapsed matrix by
σB = CM (13)
with which Bob can recover his state to the original state.
Let us reconsider the two-hop case shown in Fig. 2, where the EPR pair shared by Alice
and Candy is |ϕ3 , and the EPR pair shared by Candy and Bob is |ϕ 4 . The channel matrix
can be wrote as
 
0 1
C = C (|ϕ ) · C (|ϕ ) =
1 3 2 4
(14)
1 0
Assume the measurement outcome of Alice and candy is |ϕ1 , |ϕ4 respectively.
 The mea-
0 1
surement matrix can be obtain as M = M2,2 1 (|ϕ 1 ) · M 4 (|ϕ 4 ) = . According to
2,2 −1 0
Table 2, the qubit state of particle B1 turns into α|0 − β|1. Then we have
 
1 0
σB = CM = (15)
0 −1
We can see that the collapsed matrix is a Z operation. The corresponding collapsed state
of particle B1 turns into α|0 + β|1, when we perform the Z operation on Bob’s qubit. Thus
the two-hop quantum teleportation between Alice and Bob is realized.

3.3 More General Case

The process of one-hop and two-hop cases can be generalize to multi-hop quantum tele-
portation straightforwardly. Assume Alice intends to send |y to Bob, but they do not share
EPR pair in advance. So, n-1 nodes are added on the routing path. Here we consider a prac-
tical case that the shared EPR pairs between these nodes are not of the same type. The four
types of Bell pairs are shared repeatedly among these nodes. Therefore, Bell pair types and
Int J Theor Phys

corresponding numbers would be crucial for determining the corresponding unitary opera-
tions to recover the final qubit state. So the system state with n Bell pairs can be expressed
as:
|γ s = |yA1 ⊗ |ϕ 1 ⊗a ⊗ |ϕ 2 ⊗b ⊗ |ϕ 3 ⊗c ⊗ |ϕ 4 ⊗d (16)
Where a, b, c and d denote the numbers of the four types of Bell pairs shared on quantum
paths and their sum is equal to quantum hop count n. Then Bob’s qubit state can be recovered
to the original state by applying the following operation:
| = σB |y  B1 (17)
Where the collapsed
 matrix can still be written as σB = CM, the channel matrix can be
represented as C = C n (|ϕ r ) = (Ci,j )2×2 , the measurement matrix can be represented
 n n
as M = M n (|ϕ r ).
n
For example, in a three-hop quantum teleportation case, assuming the sender A wants to
transmit a qubit sate |y = α|0 + β|1 to the receiver H. The Bell pairs |ϕ 2 , |ϕ 3 , |ϕ 4  are
shared between adjacent nodes as shown in Fig. 3. Thus, the number of the four types of
Bell pairs is a = 0, b = c = d = 1 respectively. Assume the basis matix of the source node
4 (|ϕ 4 ), M 2 (|ϕ 2 ) and M 1 (|ϕ 1 ).
and the two intermediate nodes are M2,2 2,2  2,2
1 0
So the measurement matrix can be calculated as M = . The channel matrix
0 −1
 
 1 2 1 0
can be calculated as C = C (|ϕ ) · C 2 (|ϕ 3 ) · C 3 (|ϕ 4 ) = . According to the
n=3 0 1
measurement outcomes, Bob’s qubit state should be |y  B1 = α|0−β|1. Then substituting
these indexes into (14), we obtain
| = C · M|y  B1
 
1 0
= (α|0 − β|1)B1
0 −1
= (α|0 + β|1)B1 (18)
Hence, the original state has been teleported to the destination successfully.

3.4 Description of the Whole Scheme

Now, let us describe briefly about the whole scheme for communication in multihop
networks based on coefficient matrix and teleportation.

Fig. 3 Example of multi-hop communication

 Int J Theor Phys

First, every node involved in the communication except the destination node performs
measurements on its two qubits independently. The measurements do not depend on any
information from other nodes and can be carried out immediately after the nodes are selected
on quantum paths.Then, each of these nodes sends the measurement outcomes and the Bell
pair types shared with its upstream node to the destination node. The paths of classical
information can be different from quantum paths. Finally, when the destination node has
gathered all classical information reported, it would do the following three steps.

(1) Using the Bell pair type of each node shared with its upstream node to calculate the
channel matrix C.
(2) Using the measurement outcomes of each node to calculate the measurement matrix
M.
(3) Via C and M determine the collapsed matrix and the corresponding unitary operation.
(4) Perform the unitary operation on Bob’s qubit to reconstruct the original state.
The above four steps at the destination node can be seen as a black box, the input of which
are measurement outcomes and Bell pair types, and the output of which is the original state.

4 Discussion and Conclusion

In summary, we have proposed a quantum multi-hop communication scheme, which enables

a quantum mobile device to teleport a quantum state to a remote site even if they do not
share EPR pairs mutually. By defining the coefficient matrix, the initial quantum state can
be perfectly recovered at the destination.
We employ a simultaneous and independent entanglement swapping method in our
scheme. The source and intermediate nodes perform measurements do not depend on any
specific sequence. As we referred to in Section 1, the sequential entanglement swapping
scheme which is commonly used in quantum repeaters perform entanglement swapping
sequentially. It is entirely different from our scheme. In the sequential entanglement swap-
ping scheme, the measurements and wireless communication are performed in sequence.
The intermediate node depends on the two c-bits information from its downstream node and
only performs measurements for entanglement swapping after receiving this information.
So, the communication is carried out step by step, with a time sequence from the source
to the destination. Therefore, the total communication delay is the sum of the measure-
ment and transmission time of every node. In our scheme, the measurements are performed
without dependence on any measurement sequence. The wireless communication delay is
equal to the time needed for one packet transmitted from the farthest node to the destination
node, because when the farthest node sends its classical information, the other intermediate
nodes can send theirs simultaneously without any mutual interference. So, the total com-
munication delay is the sum of the measurement time and the transmission time cost by
the farthest node transmitting his information to the destination. Obviously, our scheme has
shorter delay in general.
Now Let us briefly consider the feasibility of our scheme in experiment. It is found that
the necessary local unitary operation in the scheme is single-qubit operation, the employed
measurement is Bell state measurement. It is well known that Bell-state measurements can
be decomposed into an ordering combination of a single-qubit Hadmard operation and a
two-qubit CNOT operation. Up to now, the progress of Bell-state measurements and the
single-qubit unitary operations in experiment in various quantum system [4, 5, 7] has been
Int J Theor Phys

reported. In addition, the Bell states can already be prepared out by experiment. In theory,
our scheme is feasible in the experiment. And In a practical application, noise should be
taken into account. It maybe leads to distortions in quantum channel. Some uantum tech-
niques, such as entanglement purification [72–81] and entanglement concentration [82–89]
should be adopted to depress the influence of the noise.
The proposed scheme can preserve the merits in the original schemes [60–63] while
providing a more flexible transmission. First, in our scheme, the Bell pairs shared between
the intermediate nodes are not required to be the same types. This enhances the flexibility
of network greatly. Second, since the Bell measurements of the source and intermediate
nodes are carried out independently, our scheme does not require the presence of classical
channel between neighbor nodes. What we need is just a classical channel between each
intermediate node to the destination node. This means that the Classical information does
not need to be transmitted step by step. In a certain sense, it can reduce the occupation of
system resources. Third, by using the coefficient matrix, the recovering algorithm can be
directly obtained through the calculation in destination node. Finally, our scheme can also
be used in the wired and hybrid quantum network. We hope this scheme may open a new
perspective for the field of wireless quantum communication.

Acknowledgments This work is supported by Shaanxi Natural Science Foundation under Contract
No.2013JM1009 and the Innovation Fund of graduate school of Xi’an University of Posts and Telecommu-
nications under Contract No. ZL 2013-33.

References

1. Bloch, M., Rodrigues, M.R.D., McLaughlin, S.W., Barros, J.: Wireless information-theoretic security.
IEEE Trans. Inf. Theory 54, 2515 (2008)
2. Kannhavong, B., Nakayama, H., Nemoto, Y., Kato, N., Jamalipour, A.: A survey of routing attacks in
mobile ad hoc networks. IEEE Wiresss Comm. 14, 85 (2007)
3. Bennett, C.H., Brassard, G., Crepeau, C., Jozsa, R., Peres, A., Wootters, W.K.: Teleporting an unknown
quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev.Lett. 70, 1895–1899
(1993)
4. Bouwmeester, D., Pan, J.W., Mattle, K., Eibl, M., Weinfurter, M., Zeilinger, A.: Experimental quantum
teleportation. Nature 390, 575–579 (1997)
5. Boschi, D., Branca, S., Martini, F.D., Hardy, L., Popescu, S.: Experimental realization of teleporting an
unknown pure quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett
80, 1121 (1998)
6. Yang, C.P., Chu, S.I., Han, S.: Efficient many-party controlled teleportation of multiqubit quantum
information via entanglement. Phys. Rev. A 70, 022329 (2004)
7. Barrett, M.D., Chiaverini, J., Schaetz, T., et al.: Deterministic quantum teleportation of atomic qubits.
Nature 429, 737–739 (2004)
8. Zhang, Z.J.: Controlled teleportation of an arbitrary n-qubit quantum information using quantum secret
sharing of classical message. Phys. Lett. A 352, 55–58 (2006)
9. Deng, F.G., Li, C.Y., Li, Y.S., Zhou, H.Y., Wang, Y.: Symmetric multiparty-controlled teleportation of
an arbitrary two-particle entanglement. Phys. Rev. A 72, 022338 (2005)
10. Gao, T., Yan, F.L., Wang, Z.X.: Controlled quantum teleportation and secure direct communication.
Chinese Phys. 14, 893 (2005)
11. Zha, X.W., Zou, Z.C., Qi, J.X., Song, H.Y.: Bidirectional Quantum Controlled Teleportation via Five-
Qubit Cluster State. Int. J. Theor.Phys. 52, 1740–1744 (2012)
12. Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. In: Pro-
ceedings of IEEE International Conference on Computers, Systems and Signal Processing, Bangalore,
India, p. 175. IEEE Press, New York (1984)
13. Ekert, A.K.: Quantum cryptography based on Bells theorem. Phys. Rev. Lett. 67, 661–663 (1991)
 Int J Theor Phys

14. Bennett, C.H., Brassard, G., Mermin, N.D.: Quantum cryptography without Bell’s theorem. Phys. Rev.
Lett. 68, 557–559 (1992)
15. Deng, F.G., Long, G.L.: Controlled order rearrangement encryption for quantum key distribution. Phys.
Rev. A 68, 042315 (2003)
16. Deng, F.G., Long, G.L.: Bidirectional quantum key distribution protocol with practical faint laser pulses.
Phys. Rev. A 70, 012311 (2004)
17. Hwang, W.Y.: Quantum key distribution with high loss: toward global secure communication. Phys. Rev.
Lett. 91, 057901 (2003)
18. Wang, X.B.: Beating the photon-number-splitting attack in practical quantum cryptography. Phys. Rev.
Lett. 94, 230503 (2005)
19. Lo, H.K., Ma, X.F., Chen, K.: Decoy state quantum key distribution. Phys. Rev. Lett. 94, 230504 (2005)
20. Li, X.H., Deng, F.G., Zhou, H.Y.: Efficient quantum key distribution over a collective noise channel.
Phys. Rev. A 78, 022321 (2008)
21. Hillery, M., Buzek, V., Berthiaume, A.: Quantum secret sharing. Phys. Rev. A 59, 1829 (1999)
22. Cleve, R., Gottesman, D., Lo, H.K.: How to Share a Quantum Secret. Phys. Rev. Lett. 83, 648–651
(1999)
23. Lance, A.M., Symul, T., Bowen, W.P., Sanders, B.C., Lam, P.K.: Tripartite Quantum State Sharing. Phys.
Rev. Lett. 92, 177903 (2004)
24. Deng, F.G., Li, X.H., Li, C.Y., Zhou, P., Zhou, H.Y.: Multiparty quantum-state sharing of an arbitrary
two-particle state with Einstein-Podolsky-Rosen pairs. Phys. Rev. A 72, 044301 (2005)
25. Gordon G., Rigolin, G.: Generalized quantum-state sharing. Phys. Rev. A 73, 062316 (2006)
26. Gaertner, S., Kurtsiefer, C., Bourennane, M., Weinfurter, H.: Experimental demonstration of four-party
quantum secret sharing. Phys. Rev. Lett. 98, 020503 (2007)
27. Schmid, C., Trojek, P., Bourennane, M., Kurtsiefer, C., Zukowski, M., Weinfurter, H.: Experimental
Single Qubit Quantum Secret Sharing. Phys. Rev. Lett 95, 230505 (2005)
28. Zhou, N.Y., Song, H.C., Gong, L.H.: Continuous Variable Quantum Secret Sharing via Quantum
Teleportation. Int. J. Theor.Phys. 52, 4174–4184 (2013)
29. Long, G.L., Liu, X.S.: Theoretically efficient high-capacity quantum-key-distribution scheme. Phys.
Rev. A 65, 032302 (2002)
30. Wang, C., et al.: Quantum secure direct communication with high-dimension quantum superdense
coding. Phys. Rev. A 71, 044305 (2005)
31. Deng, F.G., Long, G.L., Liu, X.S.: Two-step quantum direct communication protocol using the Einstein-
Podolsky-Rosen pair block. Phys. Rev. A 68, 042317 (2003)
32. Wang, C., et al.: Multi-step quantum secure direct communication using multi-particle Green-Horne-
Zeilinger state. Opt. Commun. 253, 15–20 (2005)
33. Li, X.H., et al.: Quantum secure direct communication with quantum encryption based on pure entangled
states. Chin. Phys. 16, 2149–2153 (2007)
34. Deng, F.G., Long, G.L.: Secure direct communication with a quantum one-time pad. Phys. Rev. A 69,
052319 (2004)
35. Wang, T.J., Li, T., Du, F.F., Deng, F.G.: High-capacity quantum secure direct communication based on
quantum hyperdense coding with hyperentanglement. Chin. Phys. Lett. 28, 040305 (2011)
36. Gu, B., et al.: Robust quantum secure direct communication with a quantum one-time pad over a
collective-noise channel. Sci. China:Phys. Mech. Astron. 54, 942–947 (2011)
37. Shi, J., Gong, Y.X., Xu, P., Zhu, S.N., Zhan, Y.B.: Quantum Secure Direct Communication by Using
Three-Dimensional Hyperentanglement. Commun. Theor. Phys. 56, 831 (2011)
38. Wu, Y.H., Zhai, W.D., Cao, W.Z., Li, C.: Quantum Secure Direct Communication by Using General
Entangled States. Int. J. Theor.Phys. 50, 325–331 (2011)
39. Gao, G., Fang, M., Yang, R.M.: Quantum Secure Direct Communication by Swapping Entanglements
of 33-Dimensional Bell States. Int. J. Theor. Phys. 50, 882–887 (2011)
40. Liu, D., Chen, J.L., Jiang, W.: High-Capacity Quantum Secure Direct Communication with Single Pho-
tons in Both Polarization and Spatial-Mode Degrees of Freedom. Int. J. Theor. Phys. 51, 2923–2929
(2012)
41. Sun, Z.W., Du, R.G., Long, D.Y.: Quantum Secure Direct Communication with Two-Photon Four-Qubit
Cluster States. Int. J. Theor. Phys 51, 1946–1952 (2012)
42. Ren, B.C., et al.: Photonic spatial Bell-state analysis for robust quantum secure direct communication
using quantum dot-cavity systems. Eur. Phys. J. D 67, 30 (2013)
43. Gu, B., et al.: Robust Quantum Secure Communication with Spatial Quantum States of Single Photons.
Int. J. Theor. Phys 52, 4461–4469 (2013)
44. Zhang, Q.N., Li, C.C., Li, Y.H., Nie, Y.Y.: Quantum Secure Direct Communication Based on Four-Qubit
Cluster States. Int. J. Theor.Phys. 52, 22–27 (2013)
Int J Theor Phys

45. Chang, Y., Xu, C.X., Zhang, S.B., Yan, L.L.: Quantum secure direct communication and authentication
protocol with single photons. Chin. Sci. Bulletin 58, 4571–4576 (2013)
46. Yan, F.L., Zhang, X.: A scheme for secure direct communication using EPR pairs and teleportation.
Euro. Phys. J. B 41, 75 (2004)
47. Gao, T., Yan, F.L., Wang, Z.X.: Deterministic secure direct communication using GHZ states and
swapping quantum entanglement. J. Phys. A 38, 5761 (2005)
48. Man, Z.X., Zhang, Z.J., Li, Y.: Deterministic Secure Direct Communication by Using Swapping
Quantum Entanglement and Local Unitary Operations. Chin. Phys. Lett. 22, 18 (2005)
49. Zhu, A.D., Xia, Y.Q., Fan, B., Zhang, S.: Secure direct communication based on secret transmitting order
of particles. Phys. Rev. A 73, 022338 (2006)
50. Li, X.H., Deng, F.G., Zhou, H.Y.: Improving the security of secure direct communication based on the
secret transmitting order of particles. Phys. Rev. A 74, 054302 (2006)
51. Lee, H., Lim, J., Yang, H.: Quantum direct communication with authentication. Phys. Rev. A 73, 042305
(2006)
52. Wang, J., Zhang, Q., Tang, C.J.: Quantum secure direct communication based on order rearrangement of
single photons. Phys. Lett. A 358, 256 (2006)
53. Li, X.H., Deng, F.G., Li, C.Y., Liang, Y.J., Zhou, P., Zhou, H.Y.: Deterministic secure quantum
communication without maximally entangled states. J. Korean Phys. Soc. 49, 1354 (2006)
54. Wang, J., Zhang, Q., Tang, C.J.: Quantum secure direct communication without a pre-established secure
quantum channel. Int. J. Quantum Inform. 4, 925 (2006)
55. Nguyen, B.A.: Quantum dialogue. Phys. Lett. A 328, 6 (2004)
56. Man, Z.X., Zhang, Z.J., Li, Y.: Quantum Dialogue Revisited. Chin. Phys. Lett. 22, 22 (2005)
57. Ji, X., Zhang, S.: Secure quantum dialogue based on single-photon. Chin. Phys. 15(07), 1418-03
(2006)
58. Agrawal, D.P., Zeng, Q.A.: Introduction to Wireless and Mobile Systems. CA: Brooks Cole, Pacific
Grove (2002)
59. Rappaport, T.S.: Wireless Communications Principles And Practice. NJ. Prentice-Hall, Englewood Cliffs
(2001)
60. Cheng, S.T., Wang, C.Y., Tao, M.H.: Quantum communication for wireless wide-area networks. IEEE J.
Sel. Area Comm. 23, 1424–1432 (2005)
61. Bacinoglu, T., Gulbahar, B., Akan, O.B.: Constant fidelity entanglement flow in quantum commu-
nication networks. 2010 Proceedings of IEEE Global Telecommunications Conference, Miami USA,
December 6-10, 1-5 (2010)
62. Yu, X.T., Xu, J., Zhang, Z.C.: Routing protocol for wireless ad hoc quantum communication network
based on quantum teleportation. Acta Phys. Sin. 61, 220303 (2012). in Chinese
63. Wang, K., Yu, X.T., Lu, S.L., Gong, Y.X.: Quantum wireless multihop communication based on arbitrary
Bell pairs and teleportation. Phys. Rev. A 89, 022329 (2014)
64. Zha, X.W., Qi, J.X., Song, H.Y.: Channel matrix, measurement matrix and collapsed matrix in
teleportation. arXiv:1402.1240
65. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University
Press, Cambridge (2010)
66. Sheng, Y.B., Zhou, L., Cheng, W.W., Gong, L.Y., Zhao, S.M., Zheng, B.Y.: Efficient entanglement
purification in quantum repeaters. Chin. Phys. B 21, 030307 (2012)
67. Yao, X.C., Wang, T.X., Xu, P., Lu, H., Pan, G.S., Bao, X.H., Peng, C.Z., Lu, C.Y., Chen, Y.A., Pan, J.W.:
Observation of eight-photon entanglement. Natrue Photonics 6, 225–228 (2012)
68. Perkins, C.E., Royer, E.M.: Ad-hoc on-demand distance vector routing. In: Proceedings of the Second
IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100 (1999)
69. Pemberton-Ross, P.J., Kay, A.: Perfect quantum routing in regular spin networks. Phys. Rev. Lett. 106,
020503 (2011)
70. Fowler, A.G., Wang, D.S., Hill, C.D., Ladd, T.D., Meter, R.V., Hollenberg, L.C.L.: Surface code
quantum communication. Phys. Rev. Lett. 104, 180503 (2010)
71. Meter, R.V., Satoh, T., Ladd, T.D., Munro, W.J., Nemoto, K.: Path selection for quantum repeater
networks. Networking Sci. 3, 82–95 (2013)
72. Bennett, C.H., Brassard, G., Popescu, S., Schumacher, B., Smolin, J.A., Wootters, W.K.: Purification of
noisy entanglement and faithful teleportation via noisy channels. Phys. Rev. Lett. 76, 722–725 (1996)
73. Deutsch, D., Ekert, A., Jozsa, R., Macchiavello, C., Popescu, S., Sanpera, A.: Quantum privacy ampli-
fication and the security of quantum cryptography over noisy channels. Phys. Rev. Lett. 77, 2818–2821
(1996)
74. Pan, J.W., Simon, C., Zellinger, A.: Entanglement purification for quantum communication. Nature 410,
1067–1070 (2001)
 Int J Theor Phys

75. Simon C., Pan, J.W.: Polarization entanglement purification using spatial entanglement. Phys. Rev. Lett.
89, 257901 (2002)
76. Sheng, Y.B., Deng, F.G.: Deterministic entanglement purification and complete nonlocal Bell-state
analysis with hyperentanglement. Phys. Rev. A 81, 032307 (2010)
77. Li, X.H.: Deterministic polarization-entanglement purification using spatial entanglement. Phys. Rev. A
82, 044304 (2010)
78. Deng, F.G.: Efficient multipartite entanglement purification with the entanglement link from a subspace.
Phys. Rev. A 84, 052312 (2011)
79. Ren, B.C., Deng, F.G.: Hyperentanglement purification and concentration assisted by diamond NV
centers inside photonic crystal cavities. Laser Phys. Lett. 10, 115201 (2013)
80. Murao, M., Plenio, M.B., Popescu, S., Vedral, V., Knight, P.L.: Multiparticle entanglement purification
protocols. Phys. Rev. A 57, R4075 (1998)
81. Cheong, Y.W., Lee, S.W., Lee, J., Lee, H.W.: Entanglement purification for high-dimensional multipar-
tite systems. Phys. Rev. A 76, 042314 (2007)
82. Bennett, C.H., Bernstein, H.J., Popescu, S., Schumacher, B.: Concentrating partial entanglement by local
operations. Phys. Rev. A 53, 2046–2052 (1996)
83. Yamamoto, T., Koashi, M., Imoto, N.: Concentration and purification scheme for two partially entangled
photon pairs. Phys. Rev. A 64, 012304 (2001)
84. Zhao, Z., Pan, J.W., Zhan, M.S.: Practical scheme for entanglement concentration. Phys. Rev. A 64,
014301 (2001)
85. Sheng, Y.B., Deng, F.G., Zhou, H.Y.: Single-photon entanglement concentration for long-distance
quantum communication. Quantum Inf. Comput. 10, 0272–0281 (2010)
86. Deng, F.G.: Optimal nonlocal multipartite entanglement concentration based on projection measure-
ments. Phys. Rev. A 85, 022311 (2012)
87. Sheng, Y.B., Zhou, L., Zhao, S.M.: Efficient two-step entanglement concentration for arbitrary W states.
Phys. Rev. A 85, 042302 (2012)
88. Ren, B.C., Long, G.L.: General hyperentanglement concentration for photon systems assisted by
quantum-dot spins inside optical microcavities. Opt. Express 22, 6547 (2014)
89. Gu, B.: Single-photon-assisted entanglement concentration of partially entangled multiphoton W states
with linear optics. J. Opt. Soc. Am. B 29, 1685–1689 (2012)