†Corresponding author. E-mail: masongya0829@126.com
*Project supported by the National Natural Science Foundation of China (Grant Nos. 61201253, 61303039, 61572246, and 61502147) and the Fundamental Research Fund for the Central Universities of China (Grant No. 2682014CX095).
Novel schemes are put forward to execute the joint remote preparation of an arbitrary two-qubit state with a passive receiver via EPR pairs as the entangled channel. Compared with the previous protocols, the required multi-particle measurement is simplified and the classical communication cost is reduced. When the number of senders increases, the advantage is more evident. It means that the proposed schemes are more efficient in practice.
The transmission of a quantum state is a primarily important task in quantum information processing. However, the state itself should not be directly sent because any enemy can easily replace it by a fake one without recognition of the authorized parties. The first intriguing protocol for such kind of task is quantum teleportation (QT) which can transmit an unknown qubit between spatially separated parties by utilizing a prior shared entanglement and some classical communication.[1] The QT demonstrates the interchangeability of different types of resources and has made considerable progress.[2– 5] In case the sender does not own the particle itself but owns all the classical information of the state to be prepared for the remote receiver, Lo proposed another intriguing method called remote state preparation (RSP) to transmit a pure known quantum state.[6] It has been shown that for some special ensembles of states, RSP protocols are more economical than QT due to the sender’ s prior knowledge of the original state.[7] Bennett et al. studied the trade-off between the classical communication cost (CCC) and the required entanglement in RSP distinctly.[8] So far, various theoretical protocols for the generalization of RSP have been addressed, [9– 16] such as RSP via noisy channel, the low-entanglement RSP, the optimal RSP, RSP of the continuous variable, RSP of mixed states, and so on. Some RSP schemes have been experimentally implemented by using linear optical elements and nuclear magnetic resonance technology.[17, 18]
Compared with the traditional RSP with two parties, the multi-party RSP plays an important role in the general quantum network communication and quantum distributed computation. One type of these multi-party RSP schemes is the controlled RSP, in which the controlling party (similar to the trusted center in classical secure protocols) determines whether the quantum information is constructed for the receiver or not. Moreover, the controlling party has no classical information of the quantum state during the preparation procedure. The other is named as joint remote state preparation (JRSP). Different from RSP that all the secret information is provided by one sender, JRSP deals with the situation that the complete classical knowledge of the quantum state is independently shared among numbers of senders who have to cooperatively complete the task. JRSP can be viewed as jointly reconstructing the quantum state (which may be a secret for the receiver) at a remote site, which is somewhat reverse to quantum secret sharing (QSS).[19] In QSS, the secret is divided into several different pieces and then distributed to multiple receivers from one sender. From this point of view, JRSP may be useful for such a secure communication task. Furthermore, in the distributed quantum computation, each party should cooperate with other parties for one quantum task such as Shor’ s algorithm. In this case, JRSP is only one special distributed quantum task.
Since the first appearance of JRSP, [20] various JRSP schemes using different types of quantum entanglement have been presented.[21– 36] Most existing JRSP protocols are probabilistic. Also, a new direction named deterministic JRSP has been put forward to get the unit success probability.[28– 36] Recently, Xia et al. proposed a deterministic JRSP scheme of an arbitrary three-qubit state with a passive receiver.[33] They use the simplest kind of entanglement resource EPR pairs as the quantum channel since the EPR pair can be more easily produced and distributed than the GHZ ones. Moreover, the receiver only needs to apply proper recovery operators at the end instead of carrying out some measurements or controlled-NOT gates and classical communication at the beginning. Following the ideas of Ref. [33], Chen et al. investigated flexible deterministic JRSP of an arbitrary two-qubit state with a passive receiver.[34] In their protocol with two senders, four EPR pairs are used as the shared quantum resource. The senders Alice and Bob need to perform a four-particle and a two-particle projective measurement, respectively. Moreover, the protocol is extended to the case of M > 2 senders. However, the multi-particle measurement is too large in their protocols, which makes it harder to realize in practice.
In this paper, we re-investigate the JRSP of an arbitrary two-qubit state with a passive receiver under the assumption of using the same entangled resources and preserving the merits in the original schemes.[34] In Section 2, we consider the case of two senders. New sets of measurement basis are constructed which plays a key role in our scheme. It is shown that the state can be prepared with the unit success probability if each sender performs a three-particle projective measurement under the basis and the receiver adopts some appropriate unitary transformations. Comparing with the previous protocol, [34] the proposed one has the following advantages. (i) Our solution balances the workload of the two senders. Each sender needs to carry out a three-particle projective measurement. (ii) Our scheme is more operable. In the previous scheme, one sender needs to perform a four-particle projective measurement. As we know, the realization of a protocol always depends on the most difficult operation and four-particle projective measurement is much harder to realize than three-particle measurement in practice. (iii) The CCC is reduced. These advantages are well reflected even in the situation of M > 2 senders which is discussed in Section 3. While some discussion and conclusions are given in the last section.
Suppose that two senders Alice and Bob want to help the receiver Charlie remotely prepare an arbitrary two-qubit state
where xj, j = 0, … , 3 are complex numbers and satisfy
To achieve the JRSP of an arbitrary two-qubit state with complex coefficients xj deterministically, one cannot use the general information splitting method[22] that each sender knows both the partial phase information and amplitude information. The reason is that there does not exist the necessary joint system operations for general complex coefficients. Therefore, similar to previous deterministic JRSP protocols, [28– 36] the classical information {xj = rjeiθ j} of prepared state is split into phase information {rj} and amplitude information {θ j} respectively in this paper. In detail, the state in Eq. (1) can be rewritten as
where rj eiθ j = xj, real coefficients rj ≥ 0 satisfy the normalization condition
Assume that two senders and the receiver share four EPR pairs
as the quantum channel. The particles (A1, A2, A3) belong to the sender Alice, (B1, B2, B3) belong to the sender Bob, while (C1, C2) belong to the receiver Charlie. The distribution of the shared EPR pairs is shown in Fig. 1.
Hence, the initial state of the whole system can be written as
In order to realize the JRSP successfully, each sender should measure her (his) qubits under the proper measurement basis that depends on the secret parameters rj, (θ j), j = 0, … , 3 of the prepared state. The construction of the measurement basis are essential to our scheme. Now we demonstrate the process of our scheme as follows.
Step 1 The sender Alice performs a three-particle projective measurement on her particles (A1, A2, A3) under the basis {| ζ 0〉 , … , | ζ 7〉 }, which is determined by the subset S1
where
Obviously, | ζ 0〉 , … , | ζ 7〉 form a complete orthogonal basis in the 8-dimensional Hilbert space as U4 is a unitary matrix. After the measurement, Alice broadcasts the classical message m to Bob and Charlie if the measurement result is | ζ m〉 , m ∈ {0, … , 7}.
After the measurement, the entangled channel in Eq. (4) can be expanded in terms of the measurement basis | ζ 0〉 , … , | ζ 7〉
Here for convenience, we use the following short notation:
Step 2 The sender Bob does not perform the projective measurement immediately but performs a unitary operation Um on his particles (B1, B2, B3) conditioned on the received classical message m, m ∈ {0, … , 7}. Here
with I being the identity operation, and X being the Pauli operation. Then Bob measures his particles (B1, B2, B3) under the complete orthogonal basis {| η 0〉 , … , | η 7〉 } which are determined by the subset S2
where the unitary matrix
In fact, the transition matrix V4 can be rewritten as H D, where
is a 4 × 4 Hadamard matrix and
is the diagonal matrix of phase factors. Clearly, Bob will obtain a state | η n〉 (n = 0, … , 7) with an equal probability 1/8. He needs also to announce the classical information n to the receiver Charlie.
Step 3 The receiver Charlie performs unitary operations conditioned on the two senders’ measurement results m and n and gets the goal state. Charlie’ s recovery operations are listed in Table 1.
To see how our protocol works, without loss of generality, assume Alice’ s measurement result is | ζ 1〉 A1A2A3. Then the particles collapse into
In this situation, the sender Bob first performs the unitary operation U1 = I ⊗ X ⊗ X on his particles (B1, B2, B3) and obtains
Then Bob performs a three-particle projective measurement on his particles (B1, B2, B3) under the basis {| η 0〉 , … , | η 7〉 } defined by Eq. (10). The state in Eq. (15) can be rewritten as
where the short notation
From Eq. (16), one can see whatever Bob’ s measurement outcome is, Charlie can get the prepared state by performing appropriate unitary operation on his collapsed particles. As for the other seven cases corresponding to Alice’ s measurement results, similar analysis process can be made. Here we do not depict them one by one. Charlie’ s recovery unitary operations conditioned on the senders’ measurement results | ζ m〉 A1A2A3, | η n〉 B1B2B3 (m, n = 0, … , 7) are summarized in Table 1.
Therefore, the total success probability for jointly preparing an arbitrary two-qubit state is unit.
The more senders that participate, the higher level of security can be made. In this section, we consider the situation of M > 2 senders. Suppose Alice, Bob, Bob1, … , BobM– 2 are the senders.
However, the execution with an arbitrary M senders is more complicated. Fortunately, the general outline goes as that of the case of M = 3 senders. Thus, for simplicity we just take M = 3 for an explicit demonstration. In this case, the data subset S2 = {θ j} is divided into two pieces
The quantum channel is served as six EPR pairs
As shown in Fig. 2, qubits (A1, A2, A3, A4) belong to the sender Alice, qubits (B1, B2, B3, B4) to the sender Bob, qubits (b1, b2) to the sender Bob1, and qubits (C1, C2) to the receiver Charlie.
Hence, the initial state of the whole system can be written as
The process of our protocol for M = 3 senders is described as follows:
Step 1 The sender Alice performs a four-particle projective measurement on her particles (A1, A2, A3, A4) under the complete orthogonal basis {| ξ 0〉 , … , | ξ 15〉 }, which has the following relationship to the computation basis: {| 0000〉 , … , | 1111〉 }:
where the unitary matrix U4 is defined by Eq. (6). Alice broadcasts classical information m to Bob and Charlie if the measurement outcome is | ξ m〉 , m ∈ {0, … , 15}.
For simplicity, without loss of generality, we describe the proposal under the assumption that Alice’ s measurement result is | ξ 1〉 A1A2A3A4 in the following.
Step 2 The sender Bob first performs a unitary operation U1 = I ⊗ X ⊗ I ⊗ X on his particles (B1, B2, B3, B4) conditioned on Alice’ s measurement result | ξ 1〉 A1A2A3A4. Then Bob performs a four-particle projective measurement on his particles (B1, B2, B3, B4) under the complete orthogonal basis {| τ 0〉 , … , | τ 15〉 } which are defined by
Bob broadcasts classical message n to Bob1 and Charlie if his measurement outcome is | τ n〉 , n ∈ {0, … , 15}.
Step 3 Bob1 performs Ib1Xb2 on his particles if Bob’ s measurement result lies in | τ n〉 B1B2B3B4, n ∈ {0, … , 7}. Otherwise, he performs Ib1Ib2. Then Bob1 performs a two-particle projective measurement on his particles (b1, b2) under the complete orthogonal basis {| η 0〉 , … , | η 3〉 } which are defined by
Here the transition matrices in Eqs. (21) and (22) are defined as
After the measurement, Bob1 publishes the classical information n1 to the receiver Charlie if the measurement outcome is | η n1〉 , n1 ∈ {0, … , 3}.
Step 4 Depending on the received classical message n, n1, the receiver Charlie performs the unitary operation shown in Table 2 on his qubits (C1, C2) to recover the prepared state.
To see how our protocol works, let us express the quantum channel in terms of the measurement basis | ξ 0〉 , … , | ξ 15〉 . The state in Eq. (19) can be expanded as
Here short notation
If Alice’ s measurement result is | ξ 1〉 A1A2A3A4, the particles collapse into
In this situation, Bob performs the unitary operation U1 = IB1XB2IB3XB4 and obtains
Then Bob performs a four-particle projective measurement on his particles (B1, … , B4) under the basis {| τ 0〉 , … , | τ 15〉 } defined by Eq. (21) and broadcasts his measurement result n to Bob1 and Charlie. The state in Eq. (27) can be rewritten as
where
For example, if Bob’ s measurement result is | τ 1〉 B1B2B3B4, Bob1 performs Ib1Xb2 on his particles. The collapsed state turns into
Here h(u0, u1, u2, u3) = u0| 00〉 + u1| 01〉 + u2| 10〉 + u3| 11〉 .
From the above equation, one can see in this situation Charlie can get the prepared state by performing appropriate unitary operations on his collapsed particles. In summary, when Alice’ s measurement result is | ξ 1〉 A1A2A3A4, Charlie’ s recovery unitary operations conditioned on Bob and Bob1’ s measurement results | τ n〉 B1B2B3B4, | η n1〉 b1b2, (n = 0, … , 15, n1 = 0, … , 3) are summarized in Table 2. Similar discussion can be made for other possible measurement outcomes.
Therefore, the receiver Charlie can reestablish the prepared state deterministically.
Considering the protocol for deterministic JRSP of an arbitrary two-qubit with two senders, [34] it uses four EPR pairs as the shared quantum resource. The two senders perform a four-particle and a two-particle projective measurement, respectively. The total CCC is 10 cbits. In fact, the sender Alice needs to broadcast 4 cbits to the sender Bob and the receiver Charlie, and Bob need to send 2 cbits to Charlie. Moreover, this protocol is extended to the general case of M senders.
In this paper, our concern is to realize the deterministic JRSP more efficiently under the promise of using the same entanglement resource. To achieve this target, we make improvements on the existing proposal and present new protocols. It is shown that the proposed protocols are not only easier to be carried out but also spend less CCC. We first investigate the case with two senders. A novel three-particle measurement basis is constructed with the aid of 4 × 4 unitary matrice as the diagonal sub-block of the 8 × 8 transition matrix. It is worth mentioning that construction of the measurement basis plays a key role. In our protocol, three-qubit projective measurement is needed instead of four-qubit measurement. In reality, the difficulty of performing projective measurement increases geometrically as the number of particles increases. In other words, three-particle projective measurement is much easier to be carried out than four-particle measurement, which makes our scheme easier to be realized. As far as the CCC is concerned, the sender Alice broadcasts to Bob and Charlie 3 cubits, and Bob sends Charlie 3 cubits. Thus, 9 cubits are required in the whole process. Moreover, we adopt the strategy that Bob performs unitary operations before performing measurement to avoid choosing different measurement basis depending on Alice’ s measurement result. As for arbitrary M senders, the sender Alice must perform a 2M-particle projective measurement, and other senders perform two-particle projective measurement in the previous scheme. It means that the more senders, the more complicated projective measurements are needed to be carried out by the sender Alice. While in the proposed scheme, it is the most complex to measure (M + 1) particle. It implies that our protocol is more applicable when M becomes larger. In conclusion, we have presented efficient JRSP protocols of an arbitrary two-qubit state by using the same EPR pairs as the quantum channel. Compared with the existing protocol, the most important advantage is that the projective measurement operation is simplified, which means the proposed protocol is more practical.
1 |
|
2 |
|
3 |
|
4 |
|
5 |
|
6 |
|
7 |
|
8 |
|
9 |
|
10 |
|
11 |
|
12 |
|
13 |
|
14 |
|
15 |
|
16 |
|
17 |
|
18 |
|
19 |
|
20 |
|
21 |
|
22 |
|
23 |
|
24 |
|
25 |
|
26 |
|
27 |
|
28 |
|
29 |
|
30 |
|
31 |
|
32 |
|
33 |
|
34 |
|
35 |
|
36 |
|