Next Article in Journal
Complex Dynamics of a Continuous Bertrand Duopoly Game Model with Two-Stage Delay
Next Article in Special Issue
Generalized Robustness of Contextuality
Previous Article in Journal
The Structure of the Class of Maximum Tsallis–Havrda–Chavát Entropy Copulas
Previous Article in Special Issue
On Two-Distillable Werner States
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Novel Criteria for Deterministic Remote State Preparation via the Entangled Six-Qubit State

1
School of Software Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
2
Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
3
Department of Computer Science, University of Calgary, Calgary, AB T2N 1N4, Canada
4
School of Information Engineering, Inner Mongolia University of Science and Technology, Baotou 014010, China
*
Author to whom correspondence should be addressed.
Submission received: 29 April 2016 / Revised: 28 June 2016 / Accepted: 14 July 2016 / Published: 20 July 2016
(This article belongs to the Special Issue Quantum Information 2016)

Abstract

:
In this paper, our concern is to design some criteria for deterministic remote state preparation for preparing an arbitrary three-particle state via a genuinely entangled six-qubit state. First, we put forward two schemes in both the real and complex Hilbert space, respectively. Using an appropriate set of eight-qubit measurement basis, the remote three-qubit preparation is completed with unit success probability. Departing from previous research, our protocol has a salient feature in that the serviceable measurement basis only contains the initial coefficients and their conjugate values. By utilizing the permutation group, it is convenient to provide the permutation relationship between coefficients. Second, our ideas and methods can also be generalized to the situation of preparing an arbitrary N-particle state in complex case by taking advantage of Bell states as quantum resources. More importantly, criteria satisfied conditions for preparation with 100% success probability in complex Hilbert space is summarized. Third, the classical communication costs of our scheme are calculated to determine the classical recourses required. It is also worth mentioning that our protocol has higher efficiency and lower resource costs compared with the other papers.

Graphical Abstract

1. Introduction

With the rapid development of quantum information processing, many difficult tasks have been successfully solved by using entanglement resources. One of great discoveries is quantum teleportation (QT) [1] in this research filed. The QT, first proposed by Bennett, has enabled the transmission of quantum state between remote places without sending the state itself. In a typical QT protocol, the sender makes a collective measurement and informs the receiver through classical communications. The receiver can then perform proper unitary operations on his particle to reconstruct the initial quantum state. When the state is completely known to the sender previously, another economical scheme, called remote state preparation (RSP) [2,3,4]. The RSP, which was firstly introduced by Lo [5], also deals with the remote transmission of quantum state. Hence there is the trade-off of resources in RSP. Pati [6] showed that the preparation of the state of polar great circles or equatorial line needs only one classical bit, smaller than the cost in QT. However, with states of a generic set considered, the cost in RSP is equal to that in QT [5,7]. The research of RSP has been a popular direction in quantum communications, including joint remote state preparation (JRSP) protocols [8,9,10], controlled remote state preparation (CRSP) protocols [11,12,13] and deterministic remote state preparation (DRSP) protocols [14,15]. There have also been experimental studies of RSP [16,17], they can be applied to some encryption schemes [18,19,20,21,22].
Among all aspects of RSP, DRSP is starting to attract substantial attention. Many researchers have focused on this branch, finding a special set of states that can be remotely prepared with certainty. Pati [6] focused on the states chosen from equatorial or polar great circles on a Bloch sphere. Zeng et al. [23] generalized Pati’s protocol to higher dimensions. They proved that deterministic RSP in real Hilbert space can only be implemented in two, four, or eight dimensions. They also studied the RSP protocol of equatorial state, where RSP can be generalized to arbitrary dimension case. Liu et al. [24] considered the arbitrary two and three-qubit RSP cases using nonmaximally entangled states, i.e., an remote preparation of arbitrary quantum pure states of two and three qubits with different success probabilities. By using a six-qubit maximally entangled state as the quantum channel, Zhang et al. [25] proposed a theoretical scheme for bidirectional remote state preparation. Yan et al. [26] constructed the complex orthogonal bases by using the two-particle state, under which the success probability of the RSP protocol is 1/2. They showed that RSP can be done deterministically if the coefficients are all real. Wang et al. [27] presented a protocol to prepare a class of three-qubit states
| u = α | 000 + β | 111 + γ | 001 + δ | 110
Here, α is real, β , γ , δ are complex and satisfy | α | 2 + | β | 2 + | γ | 2 + | δ | 2 = 1 . By using three Einstein–Podolsky–Rosen (EPR) pairs as the quantum channel, their protocol can be successfully realized with 1/4 probability.
There is an intriguing question: if the coefficients α , β , γ , δ are some special values, can the initial state | u be prepared with a higher probability? Very recently, some researchers were interested in these coefficients which have an effect on the success probability. Wang et al. [27] classified them into four simple types, which they believed to be final optimal conditions. Similarly, Pan [28] drew the same conclusion by using the Bell state and asymmetric W state as the quantum channel. Sheng et al. [29] provided a protocol of deterministic entanglement purification, and completed nonlocal Bell-state analysis with hyper entanglement. Zhan [30] studied a deterministic RSP of preparing an arbitrary two-qubit pure state by using two bipartite partially entangled states as the quantum channel. Wang [31] presented a bipartite scheme for remotely preparing an arbitrary three-qubit state with a four-qubit cluster state and EPR state as the shared quantum channel. Ma et al. [32] proposed several RSP schemes of arbitrary two- and three-qubit states via the χ state as the entangled resource, and discussed the success probability of real and complex coefficients for the two cases.
The rest of our paper is organized as follows: Related literatures are overviewed in Section 2. In Section 3, we investigate two schemes to remotely prepare an arbitrary three-particle state in eight-dimensional Hilbert space by using the six-particle entangled state as the quantum channel. In Section 4, we generalize our research into remote state preparation of an arbitrary N-particle state which used Bell states as quantum resources. The classical communication cost (CCC) of the present scheme is calculated in Section 5, while discussion and conclusions are given in Section 6 and Section 7, respectively.

2. Related Works

There exists a number of studies on genuinely entangled six-qubit state, whose basic settings are related to this paper. We provide a brief overview below.
In 2007, the usefulness of the genuinely entangled six-qubit state that had been introduced by Borras et al. [33] was investigated for the quantum teleportation of an arbitrary three-qubit state. The state is a genuinely entangled six-qubit state which is not decomposable into pairs of Bell states. Choudhury et al. [34] reported that it is also difficult to disentangle this state by performing local operations, and entanglement still prevails after three local measurements. It has been shown that entanglement of | ψ 6 decays more slowly than that of the Greenberger–Horne–Zeilinger (GHZ) state. Further, it has been shown that the entanglement of | ψ 6 is robust against the depolarizing channel.
Recently, the entangled six-qubit state was widely used in the field of quantum cryptography. Zha et al. [35] presented two schemes for the remote preparation of a four-qubit W state and calculated the success probability of the RSP scheme in general. Li et al. [36] proposed a scheme for state sharing of an arbitrary single-qubit state by using this state as the quantum channel. Sun et al. [37] presented a scheme of bidirectional quantum controlled teleportation in which a six-qubit maximally entangled state quantum channel was initially shared by the Alice, Bob, and supervisor Charlie. Sun et al. [38] gave a multi-party quantum key agreement protocol utilized the state. However, to our best knowledge, up to now, there have been no protocols for how to generate DRSP of an arbitrary three-qubit state with this entangled six-qubit state as the shared quantum channel. These factors give us motivation to investigate this six-qubit entangled channel for the above mentioned DRSP.
So, the quantum channel by us can be expressed as follows:
| ψ 6 = 1 2 [ | F 0 | ϕ + | F 1 | ϕ + + | F 2 | ψ + | F 3 | ψ + ] 123456
Here,
| F 0 = 1 2 ( | 0000 + | 1111 ) , | F 1 = 1 2 ( | 0011 + | 1100 ) , | F 2 = 1 2 ( | 0110 + | 1001 ) , | F 3 = 1 2 ( | 0101 + | 1010 ) .
| ϕ ± = 1 2 ( | 00 ± | 11 ) , | ψ ± = 1 2 ( | 01 ± | 10 )

3. Remote State Preparation of an Arbitrary Three-Particle State

In this section, we focus on the remote state preparation in eight dimensions, i.e. the initial states with three particles. Suppose that Alice wants to help Bob prepare an arbitrary three-particle state remotely
| Ψ = α 0 | 000 + α 1 | 001 + α 2 | 010 + α 3 | 011 + α 4 | 100 + α 5 | 101 + α 6 | 110 + α 7 | 111
Here, the coefficients satisfy the normalization condition i = 0 i = 7 | α i | 2 = 1 . Alice knows these coefficient completely, but Bob does not know them at all. We suppose Alice and Bob share a entangled six-particle state | ψ 6 which is shown in Equation (2) as the quantum channel. Here, Alice and Bob possess the particles 1, 2, 3, and 4, 5, 6, respectively.
We will first discuss the prepared states in the real Hilbert space in Section 3.1. More importantly, the initial state | Ψ with complex coefficients is considered in Section 3.2.

3.1. The Coefficients Are Real

Suppose that α i ( 0 i 7 ) is an arbitrary real number. Using Equations (3) and (4), the entangled six-particle state | ψ 6 in Equation (2) can be rewritten
| ψ 6 123456 = 1 2 2 1 2 [ ( | 0000 + | 1100 ) 1234 | 00 56 + ( | 0110 + | 1010 ) 1234 | 01 56 + ( | 0110 + | 1010 ) 1234 | 10 56 + ( | 0000 + | 1100 ) 1234 | 11 56 + ( | 1111 + | 0011 1234 | 00 56 + ( | 1001 + | 0101 ) 1234 | 01 56 + ( | 1001 + | 0101 ) 1234 | 10 56 + ( | 1111 + | 0011 1234 | 11 56 ] = 1 2 2 1 2 [ ( | 000 + | 110 ) 123 | 000 456 + ( | 011 + | 101 ) 123 | 001 456 + ( | 011 + | 101 ) 123 | 010 456 + ( | 000 + | 110 ) 123 | 011 456 + ( | 111 + | 001 ) 123 | 100 456 + ( | 100 + | 010 ) 123 | 101 456 + ( | 100 + | 010 ) 123 | 110 456 + ( | 111 + | 001 ) 123 | 111 456 ]
First, Alice makes a three-particle projective measurement on her particles 1, 2, 3. A set of mutually orthogonal basis { | μ 1 , | μ 2 , | μ 3 , | μ 4 , | μ 5 , | μ 6 , | μ 7 , | μ 8 } with all real coefficients are given as
( | μ 1 | μ 2 | μ 3 | μ 4 | μ 5 | μ 6 | μ 7 | μ 8 ) = ( α 0 α 1 α 2 α 3 α 4 α 5 α 6 α 7 α 1 α 0 α 3 α 2 α 5 α 4 α 7 α 6 α 2 α 3 α 0 α 1 α 6 α 7 α 4 α 5 α 3 α 2 α 1 α 0 α 7 α 6 α 5 α 4 α 4 α 5 α 6 α 7 α 0 α 1 α 2 α 3 α 5 α 4 α 7 α 6 α 1 α 0 α 3 α 2 α 6 α 7 α 4 α 5 α 2 α 3 α 0 α 1 α 7 α 6 α 5 α 4 α 3 α 2 α 1 α 0 ) ( | 000 + | 110 2 | 011 + | 101 2 | 011 + | 101 2 | 000 + | 110 2 | 111 + | 001 2 | 100 + | 010 2 | 100 + | 010 2 | 111 + | 001 2 ) = ( α 0 α 1 α 2 α 3 α 4 α 5 α 6 α 7 α 1 α 0 α 3 α 2 α 5 α 4 α 7 α 6 α 2 α 3 α 0 α 1 α 6 α 7 α 4 α 5 α 3 α 2 α 1 α 0 α 7 α 6 α 5 α 4 α 4 α 5 α 6 α 7 α 0 α 1 α 2 α 3 α 5 α 4 α 7 α 6 α 1 α 0 α 3 α 2 α 6 α 7 α 4 α 5 α 2 α 3 α 0 α 1 α 7 α 6 α 5 α 4 α 3 α 2 α 1 α 0 ) ( 1 2 0 0 0 0 0 1 2 0 0 0 0 1 2 0 1 2 0 0 0 0 0 1 2 0 1 2 0 0 1 2 0 0 0 0 0 1 2 0 0 1 2 0 0 0 0 0 1 2 0 0 1 2 0 1 2 0 0 0 0 0 1 2 0 1 2 0 0 0 0 1 2 0 0 0 0 0 1 2 ) ( | 000 | 001 | 010 | 011 | 100 | 101 | 110 | 111 ) = ( A 0 A 7 A 6 A 1 A 5 A 2 A 3 A 4 A 2 A 5 A 4 A 3 A 7 A 0 A 1 A 6 A 1 A 6 A 7 A 0 A 4 A 3 A 2 A 5 A 3 A 4 A 5 A 2 A 6 A 1 A 0 A 7 A 4 A 3 A 2 A 5 A 1 A 6 A 7 A 0 A 5 A 2 A 3 A 4 A 0 A 7 A 6 A 1 A 6 A 1 A 0 A 7 A 3 A 4 A 5 A 2 A 7 A 0 A 1 A 6 A 2 A 5 A 4 A 3 ) ( | 000 | 001 | 010 | 011 | 100 | 101 | 110 | 111 )
where the real coefficients A i ( 0 i 7 ) are given as
A 0 = 1 2 ( α 0 α 3 ) , A 1 = 1 2 ( α 1 α 2 ) , A 2 = 1 2 ( α 1 + α 2 ) , A 3 = 1 2 ( α 0 + α 3 ) , A 4 = 1 2 ( α 4 α 7 ) , A 5 = 1 2 ( α 5 α 6 ) , A 6 = 1 2 ( α 5 + α 6 ) , A 7 = 1 2 ( α 4 + α 7 ) .
Using Equation (8), the whole system will be rewritten in terms of this measurement basis as
| ψ 6 123456 = 1 2 2 ( | μ 1 | μ 2 | μ 3 | μ 4 | μ 5 | μ 6 | μ 7 | μ 8 ) T ( α 0 α 1 α 2 α 3 α 4 α 5 α 6 α 7 α 1 α 0 α 3 α 2 α 5 α 4 α 7 α 6 α 2 α 3 α 0 α 1 α 6 α 7 α 4 α 5 α 3 α 2 α 1 α 0 α 7 α 6 α 5 α 4 α 4 α 5 α 6 α 7 α 0 α 1 α 2 α 3 α 5 α 4 α 7 α 6 α 1 α 0 α 3 α 2 α 6 α 7 α 4 α 5 α 2 α 3 α 0 α 1 α 7 α 6 α 5 α 4 α 3 α 2 α 1 α 0 ) ( | 000 | 001 | 010 | 011 | 100 | 101 | 110 | 111 ) 456
= 1 2 2 [ | μ 1 ( α 0 | 000 + α 1 | 001 + α 2 | 010 + α 3 | 011 + α 4 | 100 + α 5 | 101 + α 6 | 110 + α 7 | 111 ) 456     + | μ 2 ( α 1 | 000 α 0 | 001 + α 3 | 010 α 2 | 011 + α 5 | 100 α 4 | 101 + α 7 | 110 α 6 | 111 ) 456     + | μ 3 ( α 2 | 000 α 3 | 001 α 0 | 010 + α 1 | 011 + α 6 | 100 α 7 | 101 α 4 | 110 + α 5 | 111 ) 456     + | μ 4 ( α 3 | 000 + α 2 | 001 α 1 | 010 α 0 | 011 α 7 | 100 α 6 | 101 + α 5 | 110 + α 4 | 111 ) 456     + | μ 5 ( α 4 | 000 α 5 | 001 α 6 | 010 + α 7 | 011 α 0 | 100 + α 1 | 101 + α 2 | 110 α 3 | 111 ) 456     + | μ 6 ( α 5 | 000 + α 4 | 001 + α 7 | 010 + α 6 | 011 α 1 | 100 α 0 | 101 α 3 | 110 α 2 | 111 ) 456     + | μ 7 ( α 6 | 000 α 7 | 001 + α 4 | 010 α 5 | 011 α 2 | 100 + α 3 | 101 α 0 | 110 + α 1 | 111 ) 456     + | μ 8 ( α 7 | 000 + α 6 | 001 α 5 | 010 α 4 | 011 + α 3 | 100 + α 2 | 101 α 1 | 110 α 0 | 111 ) 456 ]
From the above equation, it is transparent that a process of entanglement swapping happens after Alice’s three-particle projective measurement on the particles 1, 2, 3, under the basis { | μ i ( i = 1 , 2 , , 8 ) }, and a new entanglement is established among particles 4, 5, 6. Suppose three classical bit strings m 1 m 2 m 3 = 000 ~ 111 correspond to the measurement result | μ i ( i = 1 , 2 , ... , 8 ) . Then Alice tells Bob the measurement result through a classical channel. Whatever Alice’s measurement outcomes are, Bob can always obtain the prepared state on his particles by performing an appropriate unitary operation (shown in Table 1).
In this scheme, we can see that Alice can help Bob remotely prepare the specified state with 100% success probability. For clearness, the schematic demonstration and quantum circuit diagram of our RSP scheme have been shown in Figure 1 and Figure 2, respectively.

3.2. The Coefficients Are Complex

In this scenario, the new measurement basis is constructed in an eight-dimensional complex Hilbert space. They only contain the initial coefficients and their conjugate values, so it is convenient for us to further investigate the permutation relationship between coefficients. A criterion for deterministic RSP is given, to determine which states can be prepared with 100% success probability. For clarity, an example is given to show that such special set of states really exists.
Now we further consider the remote preparation of a more general arbitrary three-particle state
| Ψ = α 0 | 000 + α 1 | 001 + α 2 | 010 + α 3 | 011 + α 4 | 100 + α 5 | 101 + α 6 | 110 + α 7 | 111
where the coefficients satisfy the normalization condition i = 0 i = 7 | α i | 2 = 1 . Here, α i ( 0 i 7 ) is an arbitrary complex number. We still assume Alice knows this state | Ψ , but Bob does not.
Likewise, Alice first performs a three-qubit projective measurement on her three particles 1, 2, 3, under eight mutual orthogonal measurement bases | η 1 , | η 2 , | η 3 , | η 4 , | η 5 , | η 6 , | η 7 and | η 8 , which are given by
( | η 1 | η 2 | η 3 | η 4 | η 5 | η 6 | η 7 | η 8 ) = ( α 0 * α 1 * α 2 * α 3 * α 4 * α 5 * α 6 * α 7 * λ α 0 * α 1 * λ α 2 * λ λ α 3 * λ α 4 * α 5 * λ α 6 * λ λ α 7 * α 3 α 2 α 1 α 0 α 7 α 6 α 5 α 4 λ α 3 α 2 λ α 1 λ λ α 0 λ α 7 α 6 λ α 5 λ λ α 4 α 4 * α 5 * α 6 * α 7 * α 0 * α 1 * α 2 * α 3 * λ α 4 * α 5 * λ α 6 * λ λ α 7 * λ α 0 * α 1 * λ α 2 * λ λ α 3 * α 7 α 6 α 5 α 4 α 3 α 2 α 1 α 0 λ α 7 α 6 λ α 5 λ λ α 4 λ α 3 α 2 λ α 1 λ λ α 0 )     ( 1 2 0 0 0 0 0 1 2 0 0 0 0 1 2 0 1 2 0 0 0 0 0 1 2 0 1 2 0 0 1 2 0 0 0 0 0 1 2 0 0 1 2 0 0 0 0 0 1 2 0 0 1 2 0 1 2 0 0 0 0 0 1 2 0 1 2 0 0 0 0 1 2 0 0 0 0 0 1 2 ) ( | 000 | 001 | 010 | 011 | 100 | 101 | 110 | 111 ) = ( A 0 * A 7 * A 6 * A 1 * A 5 * A 2 * A 3 * A 4 * λ A 0 * λ A 7 * A 6 * λ A 1 * λ A 5 * λ A 2 * λ λ A 3 * λ A 4 * A 3 A 4 A 5 A 2 A 6 A 1 A 0 A 7 λ A 3 λ A 4 A 5 λ A 2 λ A 6 λ A 1 λ λ A 0 λ A 7 A 4 * A 3 * A 2 * A 5 * A 1 * A 6 * A 7 * A 0 * λ A 4 * λ A 3 * A 2 * λ A 5 * λ A 1 * λ A 6 * λ λ A 7 * λ A 0 * A 7 A 0 A 1 A 6 A 2 A 5 A 4 A 3 λ A 7 λ A 0 A 1 λ A 6 λ A 2 λ A 5 λ λ A 4 λ A 3 ) ( | 000 | 001 | 010 | 011 | 100 | 101 | 110 | 111 )
Here, * denotes the conjugate of a matrix, the complex coefficients A i ( 0 i 7 ) are the same as Equation (8), and the coefficient λ is
λ = | A 1 | 2 + | A 2 | 2 + | A 5 | 2 + | A 6 | 2 | A 0 | 2 + | A 3 | 2 + | A 4 | 2 + | A 7 | 2 = | α 1 | 2 + | α 2 | 2 + | α 5 | 2 + | α 6 | 2 | α 0 | 2 + | α 3 | 2 + | α 4 | 2 + | α 7 | 2
Considering the orthogonality, the coefficients should satisfy the following conditions
α 0 α 4 * + α 4 α 0 * + α 3 α 7 * + α 7 α 3 * = 0 α 1 α 5 * + α 5 α 1 * + α 2 α 6 * + α 6 α 2 * = 0
Using Equation (8), the whole system will be rewritten in terms of this measurement basis as
| ψ 6 123456 = 1 2 2 ( | η 1 | η 2 | η 3 | η 4 | η 5 | η 6 | η 7 | η 8 ) T ( α 0 * α 1 * α 2 * α 3 * α 4 * α 5 * α 6 * α 7 * λ α 0 * α 1 * λ α 2 * λ λ α 3 * λ α 4 * α 5 * λ α 6 * λ λ α 7 * α 3 α 2 α 1 α 0 α 7 α 6 α 5 α 4 λ α 3 α 2 λ α 1 λ λ α 0 λ α 7 α 6 λ α 5 λ λ α 4 α 4 * α 5 * α 6 * α 7 * α 0 * α 1 * α 2 * α 3 * λ α 4 * α 5 * λ α 6 * λ λ α 7 * λ α 0 * α 1 * λ α 2 * λ λ α 3 * α 7 α 6 α 5 α 4 α 3 α 2 α 1 α 0 λ α 7 α 6 λ α 5 λ λ α 4 λ α 3 α 2 λ α 1 λ λ α 0 ) * ( | 000 | 001 | 010 | 011 | 100 | 101 | 110 | 111 ) 456 = 1 2 2 [ | η 1 ( α 0 | 000 + α 1 | 001 + α 2 | 010 + α 3 | 011 + α 4 | 100 + α 5 | 101 + α 6 | 110 + α 7 | 111 ) 456 + | η 2 ( λ α 0 | 000 α 1 λ | 001 α 2 λ | 010 + λ α 3 | 011 + λ α 4 | 100 α 5 λ | 101 α 6 λ | 110 + λ α 7 | 111 ) 456 + | η 3 ( α 3 | 000 + α 2 | 001 α 1 | 010 α 0 | 011 + α 7 | 100 + α 6 | 101 α 5 | 110 α 4 | 111 ) 456 + | η 4 ( λ α 3 | 000 α 2 λ | 001 + α 1 λ | 010 λ α 0 | 011 + λ α 7 | 100 α 6 λ | 101 + α 5 λ | 110 λ α 4 | 111 ) 456 + | η 5 ( α 4 | 000 + α 5 | 001 + α 6 | 010 + α 7 | 011 + α 0 | 100 + α 1 | 101 + α 2 | 110 + α 3 | 111 ) 456 + | η 6 ( λ α 4 | 000 α 5 λ | 001 α 6 λ | 010 + λ α 7 | 011 + λ α 0 | 100 α 1 λ | 101 α 2 λ | 110 + λ α 3 | 111 ) 456 + | η 7 ( α 7 | 000 + α 6 | 001 α 5 | 010 α 4 | 011 + α 3 | 100 + α 2 | 101 α 1 | 110 α 0 | 111 ) 456 + | η 8 ( λ α 7 | 000 α 6 λ | 001 + α 5 λ | 010 λ α 4 | 011 + λ α 3 | 100 α 2 λ | 101 + α 1 λ | 110 λ α 0 | 111 ) 456 ]
= 1 2 2 [ | η 1 ( α 0 | 000 + α 1 | 001 + α 2 | 010 + α 3 | 011 + α 4 | 100 + α 5 | 101 + α 6 | 110 + α 7 | 111 ) 456     + | η 2 ( λ α 0 | 000 α 1 λ | 001 α 2 λ | 010 + λ α 3 | 011 + λ α 4 | 100 α 5 λ | 101 α 6 λ | 110 + λ α 7 | 111 ) 456     + | η 3 ( α 3 | 000 + α 2 | 001 α 1 | 010 α 0 | 011 + α 7 | 100 + α 6 | 101 α 5 | 110 α 4 | 111 ) 456     + | η 4 ( λ α 3 | 000 α 2 λ | 001 + α 1 λ | 010 λ α 0 | 011 + λ α 7 | 100 α 6 λ | 101 + α 5 λ | 110 λ α 4 | 111 ) 456     + | η 5 ( α 4 | 000 + α 5 | 001 + α 6 | 010 + α 7 | 011 + α 0 | 100 + α 1 | 101 + α 2 | 110 + α 3 | 111 ) 456     + | η 6 ( λ α 4 | 000 α 5 λ | 001 α 6 λ | 010 + λ α 7 | 011 + λ α 0 | 100 α 1 λ | 101 α 2 λ | 110 + λ α 3 | 111 ) 456     + | η 7 ( α 7 | 000 + α 6 | 001 α 5 | 010 α 4 | 011 + α 3 | 100 + α 2 | 101 α 1 | 110 α 0 | 111 ) 456     + | η 8 ( λ α 7 | 000 α 6 λ | 001 + α 5 λ | 010 λ α 4 | 011 + λ α 3 | 100 α 2 λ | 101 + α 1 λ | 110 λ α 0 | 111 ) 456 ]
From the above equation, suppose three classical bit strings m 1 m 2 m 3 = 000 ~ 111 correspond to the measurement result | η i ( i = 1 , 2 , ... , 8 ) . After the measurement, Alice sends the classical bits to Bob. For the states with arbitrary complex coefficients, Bob can recover the prepared state only when the measurement result is 000 (100). The recovery operations performed by him is I 4 I 5 I 6 ( σ 4 x I 5 I 6 ), respectively. Otherwise, he cannot find a recovery operation independent of the coefficients. So, in this case the success probability is 2/8 = 25%.
However, if the coefficients are of some special values, Bob may reconstruct the initial state successfully with higher probability. To achieve this, we suppose the coefficient λ = 1 . This may set restrictions to the coefficients of the initial state, because:
λ = 1 | α 0 | 2 + | α 3 | 2 + | α 4 | 2 + | α 7 | 2 = | α 1 | 2 + | α 2 | 2 + | α 5 | 2 + | α 6 | 2
Now, Bob can recover the prepared initial state successfully when the measurement result of Alice is 001 (101). It is easy to see that the success probability will be raised to 4/8=50%. The recovery operations performed by Bob are I 4 σ 5 z σ 6 z and σ 4 x σ 5 z σ 6 z , respectively.
Furthermore, if the coefficients meet certain relationships between { α 0 , α 1 , , α 7 } and { α 0 * , α 1 * , , α 7 * }, we can further increase the success probability.
We now introduce the permutation group S 8 , which contains the set of 8! permutations for the eight coefficients { α 0 , α 1 , , α 7 }.
S 8 = { ( 1 ) , ( 12 ) , ( 13 ) , ... , ( 1234 ) ( 5678 ) , ... , ( 123456 ) ( 78 ) , ... , ( 12345678 ) , ... }
In Appendix, we partially give some permutations in S 8 and the corresponding recovery operations, not the whole outcomes.
Criterion 1. 
The arbitrary three-particle state Equation (9) can be remotely prepared with 100% success probability if the coefficients { α 0 , α 1 , , α 7 } satisfy
(i)
α 0 α 4 * + α 4 α 0 * + α 3 α 7 * + α 7 α 3 * = 0 ,
(ii)
α 1 α 5 * + α 5 α 1 * + α 2 α 6 * + α 6 α 2 * = 0 ,
(iii)
| α 0 | 2 + | α 3 | 2 + | α 4 | 2 + | α 7 | 2 = | α 1 | 2 + | α 2 | 2 + | α 5 | 2 + | α 6 | 2 ,
(iv)
( α 0 * , α 1 * , , α 7 * ) = λ g g ( α 0 , ± α 1 , , ± α 7 ) .
Here, λ g is a global constant that depends on the permutation g S 8 .
A natural question would be: Is there a quantum state that satisfies all the above conditions? To show its existence, we now give an example
α 0 = 1 4 2 ,   α 1 = 3 4 2 e i 3 4 π ,   α 2 = 1 4 2 e i π ,   α 3 = 3 4 2 e i 1 4 π , α 4 = 1 4 e i π ,   α 5 = 1 4 e i 7 4 π ,   α 6 = 1 4 ,   α 7 = 1 4 e i 5 4 π .
It is easy to verify that the above coefficients satisfy the conditions (i), (ii), (iii). The permutation relationships are
α 0 α 2 = α 1 α 3 = α 2 α 0 = α 3 α 1 = α 4 α 6 = α 5 α 7 = α 6 α 4 = α 7 α 5 = e i π
No matter what measurement result Alice gets, Bob can always find the recovery operations to reconstruct the initial state. The detailed recovery operations are summarized in Table 2.

4. Remote State Preparation of an Arbitrary N-Particle State

In the previous section, we have discussed the deterministic RSP of an arbitrary three-particle state using the entangled six-particle state | ψ 6 as the quantum channel. We first consider the preparation of states with all real coefficients. Second, a criterion is proposed for the RSP in complex Hilbert space with 100% success probability. Different from previous literatures, we introduce the permutation group S 8 , which generates the complete set of states for deterministic RSP. It is natural to ask whether our criterion can be generalized to higher dimensions. One should note that deterministic RSP cannot be realized in real Hilbert space when the dimension is larger than eight. As for complex coefficients, the answer is “yes”, as long as a proper set of orthogonal bases is constructed.
Alice wants to help Bob prepare an arbitrary N-particle state
| Ψ = α 0 | 00 0 + α 1 | 00 1 + + α M 1 | 11 1
where M = 2 N . The generalized Bell states are used as quantum resources, which are shared between Alice and Bob
| ψ B e l l = 1 M ( i = 0 M 1 | i | i )
Next, a set of orthogonal basis should be constructed containing the initial coefficients and their conjugate values
| X 1 = α 0 * | 00 0 + α 1 * | 00 1 + + α M 1 * | 11 1 | X 2 = α M 1 | 00 0 + α M 2 | 00 1 α M 3 | 00 10 α M 4 | 00 11 +     + ( 1 ) M / 2 1 α 1 | 11 0 + ( 1 ) M / 2 1 α 0 | 11 1 | X 3 = α 0 * | 00 0 α 1 * | 00 1 α 2 * | 00 10 + α 3 * | 00 11     + α M 4 * | 11 00 α M 3 * | 11 01 α M 2 * | 11 10 + α M 1 * | 11 1 | X 4 = α M 1 | 00 0 α M 2 | 00 1 + α M 3 | 00 10 α M 4 | 00 11 +     + ( 1 ) M 2 α 1 | 11 0 + ( 1 ) M 1 α 0 | 11 1
Here, the other M-4 bases are omitted.
Now, the criterion for deterministic RSP in higher dimensions is naturally drawn. Similar to the previous section, we introduce the permutation group S M . So, we generalize Criterion 1 to
Criterion 2. 
The N-particle state Equation (17) can be remotely prepared with 100% success probability if the coefficients { α 0 , α 1 , ... , α M - 1 } satisfy
(1)
The normalization condition,
(2)
( α 0 * , α 1 * , ... , α M - 1 * ) = λ g g ( α 0 , ± α 1 , , ± α M - 1 ) .
Here, λ g is a global constant that depends on the permutation g S M .
If the coefficients satisfy the conditions in Criterion 2, the proper recovery operations can always be found for the receiver Bob. Thus, the deterministic RSP of N-particle state can be realized.

5. Classical Communication Cost

In this section, we calculate the CCC which is very important to reflect the classical resources required in our RSP.
Consider our scheme in Section 3, in fact, the total measurement result is | μ i ( i = 1 , 2 , ... , 8 ) , and each of them can be obtained with the probability 1 8 . Therefore, the CCC is
8 × 1 8 log 2 8 = 3 cbits

6. Discussion

In this section, in order to better illustrate the current research work, we summarize the comparison for two cases. One is to use the same quantum channel to achieve DRSP, the other is use the different quantum channels to realize an arbitrary three-particle state. Clear lists are presented in Table 3 and Table 4.
Table 3 presents the comparison for using the same quantum channel | ψ 6 to achieve DRSP. Comparing to Zha’s protocol in Reference [35], we have more advantages in the following three aspects despite using the same quantum. First, there are eight parameters in the prepared state, which need to construct a 8×8 matrix in eight-dimensional Hilbert space. More parameters means more complexity and difficulty of computing. Second, our success probability is deterministic and can reach 100% if the coefficients meet certain relationships. Third, Bob’s recovery operations are easier than Zha’s scheme. We just use simple Pauli operations instead of complex unitary transformation.
Table 4 shows the comparison for using the different quantum channels to realize an arbitrary three-particle state for DRSP. On the one hand, it is worth noting that six quantum resources are all consumed in our scheme and References [31,32], but the initial state can only be prepared with the probability 50% by theirs, whereas our scheme can achieve 100%. On the other hand, comparing to Reference [30], although the success of probability can reach 100% in this protocol, it sacrifices more quantum and classical resources to achieve recovery of the quantum state.

7. Conclusions

In summary, we have proposed two new criteria for DRSP. Using the entangled six-particle state | ψ 6 , we investigate the DRSP that deals with real and complex coefficients in eight-dimensional Hilbert space. In the first case, we focus on the coefficients as real numbers. With the result of Alice’s three-particle projective measurement, Bob can obtain the initial state with 100% success probability deterministically. For the latter, we make a discussion and find that Bob also can recover the initial state with a certain probability or even 1 according to our criterion if the coefficients satisfy some constraints.
Compared with previous studies, the feature of our protocol has the following distinct advantages: First, the initial state to be remotely prepared is an arbitrary three-qubit state, which is neither single-qubit state nor two-qubit state. So the projective measurement performed by Alice is in Hilbert spaces of eight dimensions (neither two nor four). Second, the serviceable measurement basis contains only the initial coefficients and their conjugate values. By utilizing the permutation group, it is convenient to provide the permutation relationship between coefficients. The scenarios of the state and corresponding recovery operations performed by the receiver are only partially listed in Appendix because the number of permutations is enormous. Third, it is important that we present two perfect criteria to determine which states can be prepared with 100% success probability. Furthermore, our ideas and methods can also be generalized to the higher dimension state by taking advantage of the related operations of the permutation group and Bell states as quantum resources.

Acknowledgments

This work is supported by the National Natural Science Foundation of China (Grant Nos.61272514, 61170272), the National Development Foundation for Cryptological Research (Grant No. MMJJ201401012), the Fok Ying Tung Education Foundation (Grant No. 131067), and the China Scholarship Council (CSC).

Author Contributions

GangXu and Xiu-Bo Chen conceived and wrote the protocol; Zhao Dou and Jing Li analyzed the scheme; Xin Liu and Zongpeng Li reviewed the manuscript. All authors have read and approved the final manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix

Table A1. Partial permutations of S 8 in complex coefficient case.
Table A1. Partial permutations of S 8 in complex coefficient case.
SNSpecial TypePermutationNorm, Phase FactorBAUOExample
1 α 0 * α 0 = α 1 * α 1 = α 2 * α 2 = α 3 * α 3 = α 4 * α 4 = α 5 * α 5 = α 6 * α 6 = α 7 * α 7 ( 1 ) θ 0 = θ 1 = θ 2 = θ 3 = θ 4 = θ 5 = θ 6 = θ 7 = 0 I α 0 = 1 / 6 , α 1 = 2 / 6 , α 2 = 3 / 6 , α 3 = 2 / 3 , α 4 = 5 / 6 , α 5 = 6 / 6 , α 6 = 7 / 6 , α 7 = 2 / 3 .
2 α 0 * α 1 = α 1 * α 2 = α 2 * α 3 = α 3 * α 0 = α 4 * α 5 = α 5 * α 6 = α 6 * α 7 = α 7 * α 4 ( 1234 ) ( 5678 ) | α 0 | = | α 1 | = | α 2 | = | α 3 | , | α 4 | = | α 5 | = | α 6 | = | α 7 | θ 0 = θ 2 = 0 , θ 4 = θ 6 θ 1 = θ 3 = θ 4 + θ 5 , θ 5 = θ 7 P 1234 P 5678 α 0 = 1 4 , α 1 = 1 4 e i π 2 , α 2 = 1 4 , α 3 = 1 4 e i π 2 , α 4 = 3 4 e i 3 π 8 , α 5 = 3 4 e i π 8 , α 6 = 3 4 e i 3 π 8 , α 7 = 3 4 e i π 8 .
3 α 0 * α 1 = α 1 * α 2 = α 2 * α 3 = α 3 * α 4 = α 4 * α 5 = α 5 * α 0 = α 6 * α 7 = α 7 * α 6 ( 123456 ) ( 78 ) | α 0 | = | α 1 | = | α 2 | = | α 3 | = | α 4 | = | α 5 | , | α 6 | = | α 7 | θ 0 = θ 2 = θ 4 =0 , θ 1 = θ 3 = θ 5 = θ 6 + θ 7 P 123456 P 78 α 0 = α 2 = α 4 = 1 3 , α 1 = α 3 = α 5 = 1 3 e i π 4 , α 6 = 6 6 e i π 16 , α 7 = 6 6 e i 3 π 16 .
4 α 0 * α 1 = α 1 * α 2 = α 2 * α 3 = α 3 * α 4 = α 4 * α 5 = α 5 * α 6 = α 6 * α 7 = α 7 * α 0 ( 12345678 ) | α 0 | = | α 1 | = | α 2 | = | α 3 | = | α 4 | = | α 5 | = | α 6 | = | α 7 | = 1 / 2 2 , θ 0 = θ 2 = θ 4 = θ 6 = 0 , θ 1 = θ 3 = θ 5 = θ 7 P 12345678 α 0 = α 2 = α 4 = α 6 = 1 2 2 , α 1 = α 3 = α 5 = α 7 = 1 2 2 e i π 4 .

References

  1. 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. 1993, 70, 1895–1899. [Google Scholar] [CrossRef] [PubMed]
  2. Ma, S.Y.; Chen, X.B.; Luo, M.X.; Zhang, R.; Yang, Y.X. Remote preparation of a four-particle entangled cluster-type state. Opt. Commun. 2011, 284, 4088–4093. [Google Scholar] [CrossRef]
  3. Barreiro, J.T.; Wei, T.C.; Kwiat, P.G. Remote preparation of single-photon “hybrid” entangled and vector-polarization states. Phys. Rev. Lett. 2010, 105, 030407. [Google Scholar] [CrossRef] [PubMed]
  4. Zhou, N.R.; Cheng, H.L.; Tao, X.Y.; Gong, L.H. Three-party remote state preparation schemes based on entanglement. Quantum Inf. Process. 2014, 13, 513–526. [Google Scholar] [CrossRef]
  5. 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]
  6. Pati, A.K. Minimum classical bit for remote preparation and measurement of a qubit. Phys. Rev. A. 2000, 63, 014302. [Google Scholar] [CrossRef]
  7. Leung, D.W.; Shor, P.W. Oblivious remote state preparation. Phys. Rev. Lett. 2003, 90, 127905. [Google Scholar] [CrossRef] [PubMed]
  8. Luo, M.X.; Chen, X.B.; Ma, S.Y.; Niu, X.X.; Yang, Y.X. Joint remote preparation of an arbitrary three-qubit state. Opt. Commun. 2010, 283, 4796–4801. [Google Scholar] [CrossRef]
  9. Zhan, Y.B.; Hu, B.L.; Ma, P.C. Joint remote preparation of four-qubit cluster-type states. J. Phys. B At. Mol. Opt. Phys. 2011, 44, 095501. [Google Scholar] [CrossRef]
  10. Fu, H.; Chen, G.-B.; Li, X.-W.; Ma, P.-C.; Zhan, Y.-B. Joint remote preparation of an arbitrary four-qubit x-type entangled state. 2016; arXiv:1605.05446. [Google Scholar]
  11. Chen, X.-B.; Ma, S.-Y.; Su, Y.; Zhang, R.; Yang, Y.-X. 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]
  12. Liu, L.L.; Hwang, T. Controlled remote state preparation protocols via aklt states. Quantum Inf. Process. 2014, 13, 1639–1650. [Google Scholar] [CrossRef]
  13. Gao, C.; Ma, S.-Y.; Chen, W.-L. Controlled remote preparation via the brown state with no restriction. Int. J. Theor. Phys. 2016, 55, 2643–2652. [Google Scholar] [CrossRef]
  14. Li, J.-F.; Liu, J.-M.; Feng, X.-L.; Oh, C.H. Deterministic remote two-qubit state preparation in dissipative environments. Quantum Inf. Process. 2016, 15, 2155–2168. [Google Scholar] [CrossRef]
  15. Wang, H.-B.; Zhou, X.-Y.; An, X.-X.; Cui, M.-M.; Fu, D.-S. Deterministic joint remote preparation of a four-qubit cluster-type state via GHZ states. Int. J. Theor. Phys. 2016, 55, 3588–3596. [Google Scholar] [CrossRef]
  16. Killoran, N.; Biggerstaff, D.N.; Kaltenbaek, R.; Resch, K.J.; Lütkenhaus, N. Derivation and experimental test of fidelity benchmarks for remote preparation of arbitrary qubit states. Phys. Rev. A. 2010, 81, 012334. [Google Scholar] [CrossRef]
  17. Rådmark, M.; Wieśniak, M.; Żukowski, M.; Bourennane, M. Experimental multilocation remote state preparation. Phys. Rev. A 2013, 88, 032304. [Google Scholar] [CrossRef]
  18. Xia, Z.; Wang, X.; Sun, X.; Wang, Q. A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst. 2015, 27, 340–352. [Google Scholar] [CrossRef]
  19. Zhangjie, F.; Xingming, S.; Qi, L.; Lu, Z.; Jiangang, S. Achieving efficient cloud search services: Multi-keyword ranked search over encrypted cloud data supporting parallel computing. IEICE Trans. Commun. 2015, 98, 190–200. [Google Scholar]
  20. Ren, Y.; Shen, J.; Wang, J.; Han, J.; Lee, S. Mutual verifiable provable data auditing in public cloud storage. J. Internet Technol. 2015, 16, 317–323. [Google Scholar]
  21. Fu, Z.; Ren, K.; Shu, J.; Sun, X.; Huang, F. Enabling personalized search over encrypted outsourced data with efficiency improvement. IEEE Trans. Parallel Distrib. Syst. 2015. [Google Scholar] [CrossRef]
  22. Gu, B.; Sheng, V.S.; Tay, K.Y.; Romano, W.; Li, S. Incremental support vector learning for ordinal regression. IEEE Trans. Neural Netw. Learn. Syst. 2015, 26, 1403–1416. [Google Scholar] [PubMed]
  23. 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]
  24. Liu, J.-M.; Feng, X.-L.; Oh, C. Remote preparation of arbitrary two- and three-qubit states. EPL 2009, 87. [Google Scholar] [CrossRef]
  25. Zhang, D.; Zha, X.-W.; Duan, Y.-J.; Wei, Z.H. Deterministic controlled bidirectional remote state preparation via a six-qubit maximally entangled state. Int. J. Theor. Phys. 2016, 55, 440–446. [Google Scholar] [CrossRef]
  26. Yan, F.-L.; Zhang, G.-H. Remote preparation of the two-particle state. Int. J. Quantum Inf. 2008, 6, 485–491. [Google Scholar] [CrossRef]
  27. Wang, D.; Liu, Y.; Zhang, Z.J. Remote preparation of a class of three-qubit states. Opt. Commun. 2008, 281, 871–875. [Google Scholar] [CrossRef]
  28. Pan, G.X. Remote preparation of three-particle GHZ-class states. J. At. Mol. Sci. 2010, 1, 344–351. [Google Scholar] [CrossRef]
  29. Sheng, Y.-B.; Deng, F.-G. Deterministic entanglement purification and complete nonlocal bell-state analysis with hyperentanglement. Phys. Rev. A 2010, 81, 032307. [Google Scholar] [CrossRef]
  30. Zhan, Y.-B. Deterministic remote preparation of arbitrary two- and three-qubit states. EPL 2012, 98. [Google Scholar] [CrossRef]
  31. Wang, Z.-Y. Highly efficient remote preparation of an arbitrary three-qubit state via a four-qubit cluster state and an epr state. Quantum Inf. Process. 2013, 12, 1321–1334. [Google Scholar] [CrossRef]
  32. Ma, S.-Y.; Luo, M.-X. Efficient remote preparation of arbitrary two- and three-qubit states via the χ state. Chin. Phys. B. 2014, 23, 090308. [Google Scholar] [CrossRef]
  33. Borras, A.; Plastino, A.; Batle, J.; Zander, C.; Casas, M.; Plastino, A. Multiqubit systems: Highly entangled states and entanglement distribution. J. Phys. A Math. Theor. 2007, 40. [Google Scholar] [CrossRef]
  34. Choudhury, S.; Muralidharan, S.; Panigrahi, P.K. Quantum teleportation and state sharing using a genuinely entangled six-qubit state. J. Phys. A Math. Theor. 2009, 42, 115303. [Google Scholar] [CrossRef]
  35. Zha, X.-W.; Song, H.-Y. Two schemes of remote preparation of a four-particle entangled w state via a six-qubit maximally entangled state. Phys. Scr. 2011, 84, 015010. [Google Scholar] [CrossRef]
  36. Li, C.-C.; Nie, Y.-Y.; Shag, M.-H. Quantum state sharing of an arbitrary single qubit state by using a genuinely entangled sixqubit state as a quantum channel. J. Jiangxi Nomal Univ. 2012, 36, 267–270. (In Chinese) [Google Scholar]
  37. Sun, X.-M.; Zha, X.-W. A scheme of bidirectional quantum controlled teleportation via six-qubit maximally entangled state. Acta Photonica Sin. 2013, 42, 1052–1056. [Google Scholar]
  38. Sun, Z.; Zhang, C.; Wang, P.; Yu, J.; Zhang, Y.; Long, D. Multi-party quantum key agreement by an entangled six-qubit state. Int. J. Theor. Phys. 2016, 55, 1920–1929. [Google Scholar] [CrossRef]
Figure 1. The schematic demonstration. Solid dots represent particles; a rectangle denotes a three-particle projective measurement; squares stand for single-particle unitary operations.
Figure 1. The schematic demonstration. Solid dots represent particles; a rectangle denotes a three-particle projective measurement; squares stand for single-particle unitary operations.
Entropy 18 00267 g001
Figure 2. The quantum circuit diagram. In the circuit, the single lines are denoted as the quantum channels, while the double lines represent the classical channels. The element μ 123 indicates making a three-particle projective measurement on particles 1, 2, 3; U i ( i = 4 , 5 , 6 ) indicates performing an appropriate unitary operation on corresponding particles.
Figure 2. The quantum circuit diagram. In the circuit, the single lines are denoted as the quantum channels, while the double lines represent the classical channels. The element μ 123 indicates making a three-particle projective measurement on particles 1, 2, 3; U i ( i = 4 , 5 , 6 ) indicates performing an appropriate unitary operation on corresponding particles.
Entropy 18 00267 g002
Table 1. The recovery operations for Bob. The measurement result of Alice on particles 1, 2, 3 is AMR123, and the counterpart classical message is m 1 m 2 m 3 . Bob’s appropriate unitary operation is defined as BAUO.
Table 1. The recovery operations for Bob. The measurement result of Alice on particles 1, 2, 3 is AMR123, and the counterpart classical message is m 1 m 2 m 3 . Bob’s appropriate unitary operation is defined as BAUO.
AMR123 m 1 m 2 m 3 The State on the Particles 4, 5, 6BAUO
| μ 1 000 α 0 | 000 + α 1 | 001 + α 2 | 010 + α 3 | 011
+ α 4 | 100 + α 5 | 101 + α 6 | 110 + α 7 | 111
I 4 I 5 I 6
| μ 2 001 α 1 | 000 α 0 | 001 + α 3 | 010 α 2 | 011
+ α 5 | 100 α 4 | 101 + α 7 | 110 α 6 | 111
I 4 I 5 σ 6 x z
| μ 3 010 α 2 | 000 α 3 | 001 α 0 | 010 + α 1 | 011
+ α 6 | 100 α 7 | 101 α 4 | 110 + α 5 | 111
I 4 σ 5 x z σ 6 z
| μ 4 011 α 3 | 000 + α 2 | 001 α 1 | 010 α 0 | 011
α 7 | 100 α 6 | 101 + α 5 | 110 + α 4 | 111
σ 4 z σ 5 x z σ 6 x
| μ 5 100 α 4 | 000 α 5 | 001 α 6 | 010 + α 7 | 011
α 0 | 100 + α 1 | 101 + α 2 | 110 α 3 | 111
σ 4 x z σ 5 z σ 6 z
| μ 6 101 α 5 | 000 + α 4 | 001 + α 7 | 010 + α 6 | 011
α 1 | 100 α 0 | 101 α 3 | 110 α 2 | 111
σ 4 x z I σ 6 x
| μ 7 110 α 6 | 000 α 7 | 001 + α 4 | 010 α 5 | 011
α 2 | 100 + α 3 | 101 α 0 | 110 + α 1 | 111
σ 4 x z σ 5 x σ 6 z
| μ 8 111 α 7 | 000 + α 6 | 001 α 5 | 010 α 4 | 011
+ α 3 | 100 + α 2 | 101 α 1 | 110 α 0 | 111
σ 4 x σ 5 x z σ 6 x
Table 2. The recovery operations for Bob. The measurement result of Alice on particles 1, 2, 3 is AMR123, and the counterpart classical message is m 1 m 2 m 3 . Bob’s appropriate unitary operation is defined as BAUO.
Table 2. The recovery operations for Bob. The measurement result of Alice on particles 1, 2, 3 is AMR123, and the counterpart classical message is m 1 m 2 m 3 . Bob’s appropriate unitary operation is defined as BAUO.
AMR123 m 1 m 2 m 3 The State on the Particles 4, 5, 6BAUO
| η 1 000 α 0 | 000 + α 1 | 001 + α 2 | 010 + α 3 | 011 + α 4 | 100 + α 5 | 101 + α 6 | 110 + α 7 | 111 I 4 I 5 I 6
| η 2 001 λ α 0 | 000 ( α 1 / λ ) | 001 ( α 2 / λ ) | 010 + λ α 3 | 011 + λ α 4 | 100 ( α 5 / λ ) | 101 ( α 6 / λ ) | 110 + λ α 7 | 111 I 4 σ 5 z σ 6 z
| η 3 010 α 3 | 000 + α 2 | 001 α 1 | 010 α 0 | 011 + α 7 | 100 + α 6 | 101 α 5 | 110 α 4 | 111 I 4 σ 5 z σ 6 x
| η 4 011 λ α 3 | 000 ( α 2 / λ ) | 001 + ( α 1 / λ ) | 010 λ α 0 | 011 + λ α 7 | 100 ( α 6 / λ ) | 101 + ( α 5 / λ ) | 110 λ α 4 | 111 I 4 σ 5 z σ 6 x z
| η 5 100 α 4 | 000 + α 5 | 001 + α 6 | 010 + α 7 | 011 + α 0 | 100 + α 1 | 101 + α 2 | 110 + α 3 | 111 σ 4 x I 5 I 6
| η 6 101 λ α 4 | 000 ( α 5 / λ ) | 001 ( α 6 / λ ) | 010 + λ α 7 | 011 + λ α 0 | 100 ( α 1 / λ ) | 101 ( α 2 / λ ) | 110 + λ α 3 | 111 σ 4 x σ 5 z σ 6 z
| η 7 110 α 7 | 000 + α 6 | 001 α 5 | 010 α 4 | 011 + α 3 | 100 + α 2 | 101 α 1 | 110 α 0 | 111 σ 4 x σ 5 z σ 6 x
| η 8 111 λ α 7 | 000 ( α 6 / λ ) | 001 + ( α 5 / λ ) | 010 λ α 4 | 011 + λ α 3 | 100 ( α 2 / λ ) | 101 + ( α 1 / λ ) | 110 λ α 0 | 111 σ 4 x σ 5 z σ 6 x z
Table 3. The comparison for using the same quantum channel to achieve DRSP.
Table 3. The comparison for using the same quantum channel to achieve DRSP.
Zha’s Protocol [35]Our Protocol
Entanglement resourceEntangled six-qubit state | ψ 6 Entangled six-qubit state | ψ 6
Prepared stateFour-particle W stateArbitrary three-particle state
The number of parameters48
Qubits66
Cbits23
Qubit efficiency100%100%
Success probability100% (Non-deterministic)100% (Deterministic)
Recovery operationUPauli operations
Table 4. The comparison for using the different quantum channels to realize an arbitrary three-particle state for DRSP.
Table 4. The comparison for using the different quantum channels to realize an arbitrary three-particle state for DRSP.
Entanglement ResourceQubitsCbits(General Case)Success Probability
Zhan’s protocol [30]Three GHZ states96100%
Wang’s protocol [31]Four-qubit cluster state + EPR pair6350%
Ma’s protocol [32] χ state6450%
Our protocolEntangled Six-qubit state | ψ 6 63100%

Share and Cite

MDPI and ACS Style

Xu, G.; Chen, X.-B.; Dou, Z.; Li, J.; Liu, X.; Li, Z. Novel Criteria for Deterministic Remote State Preparation via the Entangled Six-Qubit State. Entropy 2016, 18, 267. https://0-doi-org.brum.beds.ac.uk/10.3390/e18070267

AMA Style

Xu G, Chen X-B, Dou Z, Li J, Liu X, Li Z. Novel Criteria for Deterministic Remote State Preparation via the Entangled Six-Qubit State. Entropy. 2016; 18(7):267. https://0-doi-org.brum.beds.ac.uk/10.3390/e18070267

Chicago/Turabian Style

Xu, Gang, Xiu-Bo Chen, Zhao Dou, Jing Li, Xin Liu, and Zongpeng Li. 2016. "Novel Criteria for Deterministic Remote State Preparation via the Entangled Six-Qubit State" Entropy 18, no. 7: 267. https://0-doi-org.brum.beds.ac.uk/10.3390/e18070267

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop