Next Article in Journal
A Neural Network-Based Interval Pattern Matcher
Previous Article in Journal
A Class of New Metrics Based on Triangular Discrimination
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Controlled Remote State Preparation via General Pure Three-Qubit State

1
School of Electronic Engineering, University of Electronic Science and Technology of China, 2006 Xiyuan Road, Gaoxin Western District, Chengdu 611731, China
2
Department of Mathematics, Faculty of Science, JiangSu University, 301 Xuefu Road, Jingkou District, Zhenjiang 212013, China
*
Author to whom correspondence should be addressed.
Submission received: 13 June 2015 / Revised: 4 July 2015 / Accepted: 15 July 2015 / Published: 17 July 2015
(This article belongs to the Section Information and Communications Technology)

Abstract

:
The protocols for controlled remote state preparation of a single qubit and a general two-qubit state are presented in this paper. The general pure three-qubit states are chosen as shared quantum channel, which are not Local operations and classical communication (LOCC) equivalent to the mostly used GHz state. This is the first time that general pure three-qubit states have been introduced to complete remote state preparation. The probability of successful preparation is presented. Moreover, in some special cases, the successful probability could reach a unit value.

1. Introduction

Quantum teleportation (QT for short) is the first quantum information processing protocol presented by Bennett [1] to achieve the transmission of information contained in quantum state determinately. Many theoretical schemes have been proposed since then [2,3,4,5,6]. It has also been realized experimentally [7,8,9,10,11,12,13,14]. To save resources needed in the process of information transmission, Lo put forward a scheme for remote preparation of quantum state (RSP for short) [15]. Compared with QT, in RSP the sender does not own the particle itself but owns all the classical information of the state he or she wants to prepare for the receiver, who is located separately from the sender. The resource consumption is reduced greatly in RSP, as the sender do not need to prepare the state beforehand. The RSP has already attracted much attention. A number of RSP protocols were presented, such as RSP with or without oblivious conditions, optimal RSP, RSP using noisy channel, low-entanglement RSP, continuous variable RSP, and so on [16,17,18,19,20,21,22,23,24,25,26]. Experimental realization was also proved [27,28].
Besides the usual RSP, sometimes controllers are introduced to the process of remote state preparation, which is the so called controlled remote state preparation (CRSP for short), and it has drawn the attention of many researchers. In contrast to the usual RSP, the CRSP needs to incorporate a controller. The information could be transmitted if and only if both the sender and receiver cooperate with the controller or supervisor. CRSP for an arbitrary qubit has been presented in a network via many agents [29]. A two-qubit state CRSP with multi-controllers using two non-maximally GHz states as a shared channel is shown in [30]. CRSP with two receivers via asymmetric channel [31], using POVM are presented [32,33]. The five-qubit Brown state as quantum channel to realize the CRSP of three-qubit state is elaborated in [34]. Recently, the joint CRSP [37] and CRSP with partially entangled quantum channel [38] are also presented. Most of the existing schemes chose to use the GHz-type state, W-type state, Bell state or the composite of these states as the shared quantum channel. However in this paper, we choose the general pure three-qubit state as quantum channel, which is not LOCC equivalent to the GHz state. For some special cases, the probability for successful CRSP can reach a unit value.
In [35], the authors proved that for any pure three-qubit state, there exists a local base, which allows one to express a pure three-qubit state in a unique form using a set of five orthogonal state. It is the called generalised Schmidt-Decomposition for three-qubit state. Using the generalised Schmidt-Decomposition, Gao et al. [36] proposed a controlled teleportation protocol for an unknown qubit and gave analytic expressions for the maximal successful probabilities. They also gave an explicit expression for the pure three-qubit state with unit probability of controlled teleportation [36]. Motivated by the ideas of the two papers, we try to investigate the controlled remote state preparation using the general pure three-qubit states and their generalised Schmidt-Decomposition.
The paper is arranged as follows. In Section 2, the CRSP for an arbitrary qubit is elucidated in detail. We find that the successful probability is the same as that of controlled teleportation for qubits with real coefficients. In Section 3, the CRSP for a general two-qubit state is expounded. For a two-qubit state with four real coefficients, the corresponding successful probability is the same as that of controlled teleportation of a qubit. In Section 4, we conclude the paper.

2. CRSP for an Arbitrary Qubit

Suppose that three separated parties Alice, Bob and Charlie share a general pure three-qubit state | Φ c a b , the particle a belongs to Alice, b to Bob and c to Charlie, respectively. The distribution of the three particles are sketched in Figure 1.
In Figure 1, the small circles represent the particles, the solid line between two circles means that the corresponding two particles are related to each other by quantum correlation. According to [35], the general pure three qubit state has a unique generalised Schmidt-Decomposition in the form
| Φ c a b = ( a 0 | 000 + a 1 e i μ | 100 + a 2 | 101 + a 3 | 110 + a 4 | 111 ) c a b
where a i 0 for i = 0 , , 4 , 0 μ π , i = 0 4 a i 2 = 1 . The a i and μ in Equation (1) are decided uniquely with respect to a chosen general pure three qubit state.
Now Alice wants to send the information of a general qubit
| φ = α | 0 + β | 1 , | α | 2 + | β | 2 = 1
to the remote receiver Bob under the control of Charlie. Alice possesses the classical information of this qubit, i.e., the information of α and β, but does not have the particle itself. Next, we make three steps to complete the CRSP for | φ = α | 0 + β | 1 .
Figure 1. The diagram of scanning radar for aircraft landing.
Figure 1. The diagram of scanning radar for aircraft landing.
Information 06 00375 g001
Step 1: The controller Charlie firstly makes a single qubit measurement under the base
| ε c 0 = cos θ 2 | 0 + e i η sin θ 2 | 1 , | ε c 1 = sin θ 2 | 0 - e i η cos θ 2 | 1
where θ [ 0 , π ] , η [ 0 , 2 π ] . The choice of θ and η could be flexible according to the need of the controller. If θ = π and η = 0 , | ε c 0 and | ε c 1 will be the | ± = ( | 0 ± | 1 ) / 2 base. Then Charlie broadcasts his measurement outcomes publicly to Alice and Bob using one classical bit. Using Equation (3), the quantum channel can be rewritten as
| Φ c a b = p 0 | ε c 0 | Ω 0 a b + p 1 | ε c 1 | Ω 1 a b
where
p 0 = sin 2 θ 2 + a 0 2 cos θ + a 0 a 1 cos ( μ - η ) sin θ
p 1 = cos 2 θ 2 - a 0 2 cos θ - a 0 a 1 cos ( μ - η ) sin θ
| Ω 0 a b = 1 p 0 [ a 0 cos θ 2 + a 1 e i ( μ - η ) sin θ 2 ] | 00 + e - i η sin θ 2 [ a 2 | 01 + a 3 | 10 + a 4 | 11 ] a b
| Ω 1 a b = 1 p 1 [ a 0 sin θ 2 - a 1 e i ( μ - η ) cos θ 2 ] | 00 - e - i η cos θ 2 [ a 2 | 01 + a 3 | 10 + a 4 | 11 ] a b
If the result of Charlie’s measurement is 0, the composite system of Alice and Bob is | Ω 0 a b with probability p 0 and | Ω 1 a b with probability p 1 for result 1. To ensure that the particle c entangles with the whole system, we assume that a 0 > 0 and a 2 , a 3 , a 4 are not equal to 0 at the same time. This is equivalent to p 0 > 0 and p 1 > 0 at the same time.
Note that Step 1 is actually similar to that of controlled teleportation in [36]. We arrange it here to keep the integrity of the paper. More detailed calculation can be found in [36].
Step 2: Without loss of generality, we assume that the result of Charlie’s measurement is 0. Then the composite system of Alice and Bob is | Ω 0 a b . Using Schmidt-Decomposition of two-qubit system, there exists bases { | 0 , | 1 } a and { | 0 , | 1 } b for particle a and b respectively, such that | Ω 0 a b can be expressed as
| Ω 0 a b = ( λ 00 | 0 0 + λ 01 | 1 1 ) a b
where λ 00 = ( 1 - 1 - C 0 2 ) / 2 , λ 01 = ( 1 + 1 - C 1 2 ) / 2 in [36]. On receiving the result of Charlie’s measurement, the sender Alice prepares a projective measurement utilizing the classical information of | φ in the following form:
| μ 0 | μ 1 a = α β β * - α * | 0 | 1 a
Then | Ω 0 a b could be reexpressed as
| Ω 0 a b = | μ 0 a ( λ 00 α * | 0 + λ 01 β * | 1 ) b + | μ 1 a ( λ 00 β | 0 - λ 01 α | 1 ) b
Next we first discuss the case for real coefficients, i.e., α , β are real. Then Equation (11) will be
| Ω 0 a b = | μ 0 a ( λ 00 α | 0 + λ 01 β | 1 ) b + | μ 1 a ( λ 00 β | 0 - λ 01 α | 1 ) b
Alice measures her qubit under base { | μ 0 , | μ 1 } a and gets the outcome 0 and 1 with probability λ 00 α 2 + λ 01 β 2 and λ 00 β 2 + λ 01 α 2 respectively. And Alice sends her measurement result to Bob by 1 classical bit. The receiver Bob’s system will collapse to
| ξ 0 b = 1 λ 00 α 2 + λ 01 β 2 ( λ 00 α | 0 + λ 01 β | 1 ) b
and
| ξ 1 b = 1 λ 00 β 2 + λ 01 α 2 ( λ 00 β | 0 - λ 01 α | 1 ) b
respectively.
Step 3: We assume that Alice’s measurement result is 0. Now according to Charlie and Alice’s results, Bob wants to recovery the state | φ on his side. Bob needs to introduce an auxiliary particle in initial state | 0 b , then he makes a unitary operation U b b 0 on his particle b and the auxiliary particle b , and his state changes to | ω 0 b b , where
U b b 0 = 1 0 0 0 0 1 0 0 0 0 λ 00 λ 01 1 - λ 00 λ 01 0 0 - 1 - λ 00 λ 01 λ 00 λ 01
| ω 0 b b = U b b 0 | ξ 0 b | 0 b = 1 λ 00 α 2 + λ 01 β 2 λ 00 ( α | 0 0 + β | 1 0 ) + λ 01 - λ 00 β | 1 1 b b
After the unitary operation, Bob makes a measurement on his auxiliary particle b under the base { | 0 , | 1 } b . The probability for Bob to get measurement result 0 is λ 00 / ( λ 00 α 2 + λ 01 β 2 ) , and he can recovery state | φ successfully. But if the result is 1, the scheme fails.
Similarly, if Alice’s measurement result is 1, Bob also introduces an auxiliary particle in initial state | 0 b . But the unitary operation is U b b 1 , and the system after the unitary operation is | ω 1 b b , where
U b b 1 = 0 0 1 0 0 1 0 0 - λ 00 λ 01 0 0 1 - λ 00 λ 01 1 - λ 00 λ 01 0 0 λ 00 λ 01
| ω 1 b b = U b b 1 | ξ 1 b | 0 b = 1 λ 00 β 2 + λ 01 α 2 λ 00 ( α | 0 0 + β | 1 0 ) - λ 01 - λ 00 α | 1 1 b b
The probability for Bob to successfully reconstruct the state | φ is λ 00 / ( λ 00 β 2 + λ 01 α 2 ) .
Combining the process of Step 1 and Step 2, when the controller Charlie’s measurement result is 0, the receiver Bob can reconstruct the qubit | φ with probability
p 0 ( λ 00 α 2 + λ 01 β 2 ) λ 00 λ 00 α 2 + λ 01 β 2 + p 0 ( λ 00 β 2 + λ 01 α 2 ) λ 00 λ 00 β 2 + λ 01 α 2 = 2 p 0 λ 00
Similarly, if Charlie’s measurement result is 1 with probability p 1 , the whole system collapses to | Ω 1 a b . And there are bases { | 0 ¯ , | 1 ¯ } a and { | 0 ¯ , | 1 ¯ } b for Alice and Bob’s systems (Ref. [36]), so that the Schmidt-Decomposition for | Ω 1 a b is
| Ω 1 a b = ( λ 10 | 0 ¯ 0 ¯ + λ 11 | 1 ¯ 1 ¯ ) a b
Then continuing to use the last 2 steps as those in which Charlie’s measurement result is 0, we can get that the successful probability for Bob to produce the desired state is 2 p 1 λ 10 .
As a result, for the real case, Alice can prepare the qubit | φ at Bob’s position under the control of Charlie with probability 2 ( p 0 λ 00 + p 1 λ 10 ) , which is the same as that of controlled teleportation in [36]. But the consumption of classical bits in CRSP is reduced to 2 cbits for the whole process, and there is no need to prepare the qubit beforehand, which could save much quantum resource.
Next we discuss the case for complex coefficients. Step 1 is the same as that of real case. In Step 2, if Alice’s measurement result is 0, referring to Equation (11), the remote state preparation fails. When Alice gets the result 1 with probability λ 00 | β | 2 + λ 01 | α | 2 , the whole system collapses to
1 λ 00 | β | 2 + λ 01 | α | 2 ( λ 00 β | 0 - λ 01 α | 1 )
Then Step 3 is the same as that of the real case. The whole successful probability is
p 0 ( λ 00 | β | 2 + λ 01 | α | 2 ) λ 00 λ 00 | β | 2 + λ 01 | α | 2 + p 1 ( λ 10 | β | 2 + λ 11 | α | 2 ) λ 10 λ 10 | β | 2 + λ 11 | α | 2 = p 0 λ 00 + p 1 λ 10
which is half of the real case.
According to the discussion of [36], the maximally probability for controlled teleportation will reach unit if and only if the shared channel is
a 0 | 000 + a 1 | 100 + 1 2 | 111 , a 0 > 0 , a 1 0 , a 0 2 + a 1 2 = 1 2
As for the controlled remote state preparation for a qubit using the above channel, the successful probability can also reach one for the real case, and 1 / 2 for the complex case.

3. CRSP for a Two-Qubit State

In the CRSP for a two-qubit state, there are also three parties Alice, Bob and Charlie. They share a quantum channel which is the composite of | Φ c a b and the Bell state, the distribution of particles in the shared quantum channel is displayed in Figure 2, the meaning of symbols is the same as in Figure 1.
| Φ c a b | ϕ + a b = ( a 0 | 000 + a 1 e i μ | 100 + a 2 | 101 + a 3 | 110 + a 4 | 111 ) c a b 1 2 ( | 00 + | 11 ) a b
the particle c belongs to Charlie, a , a to Alice and b , b to Bob. Now the sender Alice possesses the classical information of a general two-qubit state | φ ,
| φ = α | 00 + β | 01 + γ | 10 + δ | 11 , | α | 2 + | β | 2 + | γ | 2 + | δ | 2 = 1
she wants to prepare the state at the position of a distant receiver Bob with the help of a controller Charlie. Like CRSP in Section 2, there are three steps to complete this task.
Figure 2. Particle distribution in two-qubit CRSP.
Figure 2. Particle distribution in two-qubit CRSP.
Information 06 00375 g002
Step 1: This step is the same as that of Step 1 in Section 2. Charlie makes a projective measurement { | ε c 0 , | ε c 1 } on his particle c, and gets the measurement result 0 and 1 with probability p 0 and p 1 , respectively. The corresponding composite system of Alice and Bob is | Ω 0 a b | ϕ + a b and | Ω 1 a b | ϕ + a b , respectively. He broadcasts his measurement result using 1 cbit.
Step 2: We assume Charlie’s measurement result is 0 in Step 1. Then the system state after his measurement is | Ω 0 a b | ϕ + a b . Utilizing Schmidt-Decomposition of a two component quantum system, there exists bases { | 0 , | 1 } a and { | 0 , | 1 } b such that
| Ω 0 a b | ϕ + a b = 1 2 ( λ 00 | 0 0 + λ 01 | 1 1 ) a b ( | 00 + | 11 ) a b = 1 2 λ 00 | 0 00 0 + λ 00 | 0 10 1 + λ 01 | 1 01 0 + λ 01 | 1 11 1 a a b b
Next we first discuss the case in which all the coefficients are real. According to her knowledge of the two-qubit state | φ , Alice constructs the measurement basis { | μ 0 , | μ 1 , | μ 2 , | μ 3 } a a ,
| μ 0 | μ 1 | μ 2 | μ 3 a a = α β γ δ β - α - δ γ γ δ - α - β δ - γ β - α | 0 0 | 0 1 | 1 0 | 1 1 a a
Then the system for Alice and Bob can be rewritten as
| Ω 0 a b | ϕ + a b = 1 2 { | μ 0 [ λ 00 ( α | 0 0 + β | 0 1 ) + λ 01 ( γ | 1 0 + δ | 1 1 ) ] + | μ 1 [ λ 00 ( β | 0 0 - α | 0 1 ) - λ 01 ( δ | 1 0 - γ | 1 1 ) ] + | μ 2 [ λ 00 ( γ | 0 0 + δ | 0 1 ) - λ 01 ( α | 1 0 + β | 1 1 ) ] + | μ 3 [ λ 00 ( δ | 0 0 - γ | 0 1 ) + λ 01 ( β | 1 0 - α | 1 1 ) ] } a a b b
Thus Alice can get result 0 and 1 with probability [ λ 00 ( α 2 + β 2 ) + λ 01 ( γ 2 + δ 2 ) ] / 2 , respectively, and result 2 or 3 with probability [ λ 00 ( γ 2 + δ 2 ) + λ 01 ( α 2 + β 2 ) ) ] / 2 . The system state of Bob after Alice’s measurement is
| ξ 0 b b = λ 00 ( α | 0 0 + β | 0 1 ) + λ 01 ( γ | 1 0 + δ | 1 1 ) λ 00 ( α 2 + β 2 ) + λ 01 ( γ 2 + δ 2 )
| ξ 1 b b = λ 00 ( β | 0 0 - α | 0 1 ) - λ 01 ( δ | 1 0 - γ | 1 1 ) λ 00 ( α 2 + β 2 ) + λ 01 ( γ 2 + δ 2 )
| ξ 2 b b = λ 00 ( γ | 0 0 + δ | 0 1 ) - λ 01 ( α | 1 0 + β | 1 1 ) λ 00 ( γ 2 + δ 2 ) + λ 01 ( α 2 + β 2 )
| ξ 3 b b = λ 00 ( δ | 0 0 - γ | 0 1 ) + λ 01 ( β | 1 0 + α | 1 1 ) λ 00 ( γ 2 + δ 2 ) + λ 01 ( α 2 + β 2 )
with respective to the result 0 , 1 , 2 , 3 . Alice then broadcasts her measurement result to Bob using 2 cbits.
Step 3: Assume that the measurement result of Alice is 0 in Step 2. Then according to the result, Bob introduces an auxiliary particle b a in the initial state | 0 b a , and makes unitary operation U b b b a 0 on his particles, where
U b b b a 0 = I 4 0 0 U 0
Here I 4 is the 4 × 4 identity matrix and
U 0 = λ 00 λ 01 0 0 1 - λ 00 λ 01 0 - λ 00 λ 01 1 - λ 00 λ 01 0 0 1 - λ 00 λ 01 λ 00 λ 01 0 1 - λ 00 λ 01 0 0 - λ 00 λ 01
The state after Bob performing the unitary operation is
U b b b a 0 | ξ 0 b b | 0 b a = λ 00 ( α | 0 0 + β | 0 1 + γ | 1 0 + δ | 1 1 ) b b | 0 b a + λ 01 - λ 00 ( γ | 1 0 + δ | 1 1 ) b b | 1 b a λ 00 ( α 2 + β 2 ) + λ 01 ( γ 2 + δ 2 )
Thereafter, Bob makes a projective measurement on his auxiliary particles under basis { | 0 , | 1 } b a . He can get result 0 with probabilities λ 00 / ( λ 00 ( α 2 + β 2 ) + λ 01 ( γ 2 + δ 2 ) ) . As for the other three cases, Bob can successfully reconstruct the desired two-qubit state with probabilities λ 00 / ( λ 00 ( α 2 + β 2 ) + λ 01 ( γ 2 + δ 2 ) ) , λ 00 / ( λ 00 ( γ 2 + δ 2 ) + λ 01 ( α 2 + β 2 ) ) , and λ 00 / ( λ 00 ( γ 2 + δ 2 ) + λ 01 ( α 2 + β 2 ) ) .
Similarly, in the real case, if Charlie’s measurement result is 1 with probability p 1 , then the system state after his measurement is | Ω 1 a b | ϕ + a b . Using Schmidt-Decomposition of a two component quantum system, we get
| Ω 1 a b | ϕ + a b = 1 2 ( λ 10 | 0 ¯ 0 ¯ + λ 11 | 1 ¯ 1 ¯ ) a b ( | 00 + | 11 ) a b
where λ 10 and λ 11 are the same as those in Section 2. Bob can also reconstruct the two-qubit state using similar method in the above three steps. As a result, for the real case, the total successful probability for the sender Alice to prepare the two-qubit state at the position of Bob under the control of controller Charlie is
2 × [ p 0 λ 00 ( α 2 + β 2 ) + λ 01 ( γ 2 + δ 2 ) 2 λ 00 λ 00 ( α 2 + β 2 ) + λ 01 ( γ 2 + δ 2 ) + p 0 λ 00 ( γ 2 + δ 2 ) + λ 01 ( α 2 + β 2 ) 2 λ 00 λ 00 ( γ 2 + δ 2 ) + λ 01 ( α 2 + β 2 ) + p 1 λ 10 ( α 2 + β 2 ) + λ 11 ( γ 2 + δ 2 ) 2 λ 10 λ 10 ( α 2 + β 2 ) + λ 11 ( γ 2 + δ 2 ) + p 1 λ 10 ( γ 2 + δ 2 ) + λ 11 ( α 2 + β 2 ) 2 λ 10 λ 10 ( γ 2 + δ 2 ) + λ 11 ( α 2 + β 2 ) ] = 2 ( p 0 λ 00 + p 1 λ 10 )
It is the same as that of the controlled teleportation for the real case of a qubit in [36], but notice that here we complete the task of reconstructing a two-qubit state, moreover we do not need to prepare the state beforehand, which may save lots of quantum resource. In the whole process the consumption of classical resource is 3 cbits.
For the case in which there is at least one complex coefficient, in Step 2, Alice constructs measurement basis { | ν 0 , | ν 1 , | ν 2 , | ν 3 } a a in the following form,
| ν 0 | ν 1 | ν 2 | ν 3 a a = α * - β * γ * - δ * ζ α * - ζ β * - ζ - 1 γ * ζ - 1 δ * - β - α - δ - γ - ζ β - ζ α ζ - 1 δ ζ - 1 γ | 0 0 | 0 1 | 1 0 | 1 1 a a
where ζ = ( | γ | 2 + | δ | 2 ) / ( | α | 2 + | β | 2 ) , here we can assume that | α | 2 + | β | 2 0 . Because if | α | 2 + | β | 2 = 0 , the number of coefficients decreases to two, which is actually the same as the single-qubit case. The system for Alice and Bob can be reexpressed as
| Ω 0 a b | ϕ + a b = 1 2 { | ν 0 [ λ 00 ( α | 0 0 - β | 0 1 ) + λ 01 ( γ | 1 0 - δ | 1 1 ) ] + | ν 1 [ λ 00 ζ ( α | 0 0 - β | 0 1 ) - λ 01 ζ - 1 ( γ | 1 0 - δ | 1 1 ) ] - | ν 2 [ λ 00 ( β * | 0 0 + α * | 0 1 ) + λ 01 ( δ * | 1 0 + γ * | 1 1 ) ] + | ν 3 [ λ 00 ζ ( - β * | 0 0 - α * | 0 1 ) + λ 01 ζ - 1 ( δ * | 1 0 + γ * | 1 1 ) ] } a a b b
Thus Alice can get result 0 and 1 with probability [ λ 00 ( | α | 2 + | β | 2 ) + λ 01 ( | γ | 2 + | δ | 2 ) ] / 2 and [ λ 00 ζ 2 ( | α | 2 + | β | 2 ) + λ 01 ζ - 2 ( | γ | 2 + | δ | 2 ) ] / 2 , respectively. The states after Alice’s measurement with respect to the result 0 and 1 are
| ϑ 0 = λ 00 ( α | 0 0 - β | 0 1 ) + λ 01 ( γ | 1 0 - δ | 1 1 ) λ 00 ( | α | 2 + | β | 2 ) + λ 01 ( | γ | 2 + | δ | 2 )
and
| ϑ 1 = λ 00 ζ ( α | 0 0 - β | 0 1 ) + λ 01 ζ - 1 ( - γ | 1 0 + δ | 1 1 ) λ 00 ζ 2 ( | α | 2 + | β | 2 ) + λ 01 ζ - 2 ( | γ | 2 + | δ | 2 )
We divide it into two cases according to the value of ζ.
(i)
ζ = 1 , i.e., | α | 2 + | β | 2 = | γ | 2 + | δ | 2 . In this case, using similar methods as in the real cases above, Bob can recover the desired two-qubit state both from states in Equations (37) and (38). And the probabilities are both λ 00 / ( λ 00 ( | α | 2 + | β | 2 ) + λ 01 ( | γ | 2 + | δ | 2 ) ) . Similar scheme applies to the case that Charlie’s measurement result is 1. Thus the total successful probability for Alice remotely to prepare the two-qubit state | φ at Bob’s position under the control of Charlie is
2 × { p 0 [ λ 00 ( | α | 2 + | β | 2 ) + λ 01 ( | γ | 2 + | δ | 2 ) 2 ] λ 00 λ 00 ( | α | 2 + | β | 2 ) + λ 01 ( | γ | 2 + | δ | 2 ) + p 1 [ λ 10 ( | α | 2 + | β | 2 ) + λ 11 ( | γ | 2 + | δ | 2 ) 2 ] λ 10 λ 10 ( | α | 2 + | β | 2 ) + λ 11 ( | γ | 2 + | δ | 2 ) } = p 0 λ 00 + p 1 λ 10
which is half of the case that all the coefficients are real. As for the result 2 and 3, the CRSP protocol fails.
(ii)
ζ 1 . For this case, as Bob does not know the classical information of | φ , only when Alice’s measurement result is 0, Bob can reconstruct the two-qubit state | φ . Thus the successful probability reduces to half of (i) as ( p 0 λ 00 + p 1 λ 10 ) / 2 .

4. Conclusions

In this paper, protocols for controlled remote state preparation are presented both for a single qubit and two-qubit state. We utilize the general pure three-qubit states as the shared quantum channels, which are not LOCC equivalent to the GHz state. We discuss protocols for both states with real and complex coefficients, and find that the general pure three-qubit states can help to complete CRSP probabilistically. More than that, in some special cases, the CRSP can be achieved with unit probability, which are deterministic CRSP protocols. This overcomes the limitation that most of the existing quantum communication protocols are completed with GHz-, W- or Bell states, or the composition of these states. Moreover, due to the involvement of controller and multi-partities, this work may have potential application in controlled quantum communication, quantum network communication and distributed computation.

Acknowledgments

This work is supported by the National Natural Science Foundation of China (No. 61201272) and the Fundamental Research Funds for the Central Universities (ZYGX2013J018). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.

Author Contributions

Yuebo Zha: Algorithm developing and writing of the paper; Zhihua Zhang: Algorithm developing and writing of the paper; Yulin Huang: Writing of the paper; Jianyu Yang: Algorithm developing. All authors have read and approved the final manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Bennett, C.H.; Brassard, G.; Crépeau, C.; Jozsa, R.; Peres, A.; Wootters, W.K. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosenchannels. Phys. Rev. Lett. 1993, 70, 1895–1899. [Google Scholar] [CrossRef] [PubMed]
  2. Lee, H.W.; Kim, J. Quantum teleportation and Bell’s inequality using single-particle entanglement. Phys. Rev. A 2001, 63, 012305. [Google Scholar] [CrossRef]
  3. Kim, Y.H.; Kulik, S.P.; Shih, Y. Quantum teleportation of a polarization state with a complete Bell state measurement. Phys. Rev. Lett. 2001, 86, 1370–1373. [Google Scholar] [CrossRef] [PubMed]
  4. Zhou, J.D.; Hou, G.; Zhang, Y.D. Teleportation scheme of S-level quantum pure states by two-level Einstein-Podolsky-Rosen states. Phys. Rev. A 2001, 64, 012301. [Google Scholar] [CrossRef]
  5. Wang, X.G. Quantum teleportation of entangled coherent states. Phys. Rev. A 2001, 64, 022302. [Google Scholar] [CrossRef]
  6. Van Enk, S.J.; Hirota, O. Entangled coherent states: Teleportation and decoherence. Phys. Rev. A 2001, 64, 022313. [Google Scholar] [CrossRef]
  7. Bouwmeester, D.; Pan, J.W.; Mattle, K.; Eibl, M.; Weinfurter, H.; Weinfurter, A. Experimental quantum teleportation. Nature 1997, 390, 575–579. [Google Scholar] [CrossRef]
  8. Braunstein, S.L.; Kimble, H. Teleportation of continuous quantum variables. Phys. Rev. Lett. 1998, 80, 869–872. [Google Scholar] [CrossRef]
  9. Furusawa, A.; Srensen, J.L.; Braunstein, S.L.; Fuchs, C.A.; Kimble, H.J.; Polzik, E.S. Unconditional quantum teleportation. Science 1998, 282, 706–709. [Google Scholar] [CrossRef] [PubMed]
  10. Jin, X.M.; Ren, J.G.; Yang, B.; Yi, Z.H.; Zhou, F.; Xu, X.F.; Wang, S.K.; Yang, D.; Hu, Y.F.; Jiang, S.; et al. Experimental free-space quantum teleportation. Nat. Photon. 2010, 4, 376–381. [Google Scholar] [CrossRef]
  11. Huang, Y.F.; Ren, X.F.; Zhang, Y.S.; Duan, L.M.; Guo, G.C. Experimental teleportation of a quantum controlled-NOT gate. Phys. Rev. Lett. 2004, 93, 240501. [Google Scholar] [CrossRef] [PubMed]
  12. Christian, N.; Andreas, N.; Andreas, R.; Carolin, H.; Gerhard, R.; Stephan, R. Efficient teleportation between remote single-atom quantum memories. Phys. Rev. Lett. 2013, 110, 140403. [Google Scholar] [CrossRef]
  13. Nilsson, J.; Stevenson, R.M.; Chan, K.H.A.; Skiba-Szymanska, J.; Lucamarini, M.; Ward, M.B.; Bennett, A.J.; Salter, C.L.; Farrer, I.; Ritchie, D.A.; et al. Quantum teleportation using a light-emitting diode. Nat. Photon. 2013, 7, 311–315. [Google Scholar] [CrossRef]
  14. Friis, N.; Lee, A.R.; Truong, K.; Sabin, C.; Solano, E.; Johansson, G.; Fuentes, I. Relativistic quantum teleportation with superconducting circuits. Phys. Rev. Lett. 2013, 110, 113602. [Google Scholar] [CrossRef] [PubMed]
  15. Lo, H.K. Classical-communication cost in distributed quantum-information processing: A generalization of quantum-communication complexity. Phys. Rev. A 2000, 62, 012313. [Google Scholar] [CrossRef]
  16. Bennett, C.H.; Divincenzo, D.P.; Shor, P.W.; Smolin, J.A.; Terhal, B.M.; Wootters, W.K. Remote state preparation. Phys. Rev. Lett. 2001, 87, 077902. [Google Scholar] [CrossRef] [PubMed]
  17. Devetak, I.; Berger, T. Low-entanglement remote state preparation. Phys. Rev. Lett. 2001, 87, 197901. [Google Scholar] [CrossRef]
  18. Zheng, Y.Z.; Gu, Y.J.; Guo, G.C. Remote state preparation via a non-maximally entangled channel. Chin. Phys. Lett. 2002, 19, 14–16. [Google Scholar] [CrossRef]
  19. Zeng, B.; Zhang, P. Remote-state preparation in higher dimension and the parallelizable manifold Sn-1. Phys. Rev. A 2002, 65, 022316. [Google Scholar] [CrossRef]
  20. Shi, B.S.; Tomita, A. Remote state preparation of an entangled state. J. Phys. B At. Mol. Opt. Phys. 2002, 4, 380–382. [Google Scholar] [CrossRef]
  21. Berry, D.W.; Sanders, B.C. Optimal remote state preparation. Phys. Rev. Lett. 2003, 90, 057901. [Google Scholar] [CrossRef] [PubMed]
  22. Leung, D.W.; Shor, P.W. Oblivious remote state preparation. Phys. Rev. Lett. 2003, 90, 127905. [Google Scholar] [CrossRef] [PubMed]
  23. Hayashi, A.; Hashimoto, T.; Horibe, M. Remote state preparation without oblivious conditions. Phys. Rev. A 2003, 67, 052302. [Google Scholar] [CrossRef]
  24. Yu, C.; Song, H.; Wang, Y. Remote preparation of a qudit using maximally entangled states of qubits. Phys. Rev. A 2006, 73, 022340. [Google Scholar] [CrossRef]
  25. Kurucz, Z.; Adam, P.; Kis, Z.; Janszky, J. Continuous variable remote state preparation. Phys. Rev. A 2005, 72, 052315. [Google Scholar] [CrossRef]
  26. Lee, S. Bound on remote preparation of entanglement from isotropic states. Phys. Rev. A 2012, 85, 052311. [Google Scholar] [CrossRef]
  27. Peng, X.H.; Zhu, X.W.; Fang, X.M.; Feng, M.; Liu, M.; Gao, K. Experimental implementation of remote state preparation by nuclear magnetic resonance. Phys. Lett. A 2003, 306, 271–276. [Google Scholar] [CrossRef]
  28. Barreiro, J.T.; Wei, T.C.; Kwiat, P.G. Remote preparation of single-photon “Hybrid” entangled and vector-polarization states. Phys. Rev. Lett. 2010. [Google Scholar] [CrossRef]
  29. Wang, Z.Y.; Liu, Y.M.; Zuo, X.Q. Controlled remote state preparation. Commun. Theor. Phys. 2009, 52, 235–240. [Google Scholar]
  30. Hou, K.; Wang, J.; Yuan, H. Multiparty-controlled remote preparation of two-particle state. Commun. Theor. Phys. 2009, 52, 848–852. [Google Scholar]
  31. Wang, Z.Y. Controlled remote preparation of a two-qubit state via an asymmetric quantum channel. Commun. Theor. Phys. 2011, 55, 244–250. [Google Scholar] [CrossRef]
  32. Song, J.F.; Wang, Z.Y. Controlled remote preparation of a two-qubit state via positive operator-valued measure and two three-qubit entanglements. Int. J. Theor. Phys. 2011, 50, 2410–2425. [Google Scholar] [CrossRef]
  33. Li, Z.; Zhou, P. Probabilistic Multiparty-controlled remote preparation of an arbitrary m-qudit state via positive operator-valued measurement. Int. J. Quantum Inf. 2012, 10, 1250062. [Google Scholar] [CrossRef]
  34. Chen, X.B.; Ma, S.Y.; Su, Y. Controlled remote state preparation of arbitrary two and three qubit states via the Brown state. Quantum Inf. Process. 2012, 11, 1653–1667. [Google Scholar] [CrossRef]
  35. Acín, A.; Andrianov, A.; Costa, L.; Jané, E.; Latorre, J.I.; Tarrach, R. Generalised Schmidt decomposition and classification of three-quantum-bit states. Phys. Rev. Lett. 2000, 85, 1560. [Google Scholar] [CrossRef] [PubMed]
  36. Gao, T.; Yan, F.L.; Li, Y.C. Optimal controlled teleportation. A Lett. J. Explor. Front. Phys. 2008, 84, 50001. [Google Scholar] [CrossRef]
  37. An, N.B.; Cao, T.B. Perfect controlled joint remote state preparation independent of entanglement degree of the quantum channel. Phys. Lett. A 2014, 378, 3582–3585. [Google Scholar] [CrossRef]
  38. Wang, C.; Zeng, Z.; Li, X.H. Controlled remote state preparation via partially entangled quantum channel. Quantum Inf. Process. 2015, 14, 1077–1089. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

Zha, Y.; Zhang, Z.; Huang, Y.; Yang, J. Controlled Remote State Preparation via General Pure Three-Qubit State. Information 2015, 6, 375-387. https://0-doi-org.brum.beds.ac.uk/10.3390/info6030375

AMA Style

Zha Y, Zhang Z, Huang Y, Yang J. Controlled Remote State Preparation via General Pure Three-Qubit State. Information. 2015; 6(3):375-387. https://0-doi-org.brum.beds.ac.uk/10.3390/info6030375

Chicago/Turabian Style

Zha, Yuebo, Zhihua Zhang, Yulin Huang, and Jianyu Yang. 2015. "Controlled Remote State Preparation via General Pure Three-Qubit State" Information 6, no. 3: 375-387. https://0-doi-org.brum.beds.ac.uk/10.3390/info6030375

Article Metrics

Back to TopTop