Next Article in Journal
Design and Validation of Disturbance Rejection Dynamic Inverse Control for a Tailless Aircraft in Wind Tunnel
Next Article in Special Issue
Quantum Key Distribution Networks: Challenges and Future Research Issues in Security
Previous Article in Journal
Evolutionary Analysis of the Acoustics of the Baroque Church of San Luis de los Franceses (Seville)
Previous Article in Special Issue
Lengthening Transmission Distance of Continuous Variable Quantum Key Distribution with Discrete Modulation through Photon Catalyzing
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Scheme for Controlled Cyclic Asymmetric Remote State Preparation in Noisy Environment

State Key Laboratory of Integrated Services Networks, Xidian University, Taibai South Road, Electronic City Street, Yanta District, Xi’an 710071, China
*
Author to whom correspondence should be addressed.
Appl. Sci. 2021, 11(4), 1405; https://doi.org/10.3390/app11041405
Submission received: 13 October 2020 / Revised: 15 January 2021 / Accepted: 27 January 2021 / Published: 4 February 2021
(This article belongs to the Special Issue Quantum Communications and Quantum Networks)

Abstract

:
As research on quantum computers and quantum information transmission deepens, the multi-particle and multi-mode quantum information transmission has been attracting increasing attention. For scenarios where multi-parties transmit sequentially increasing qubits, we put forward a novel (N + 1)-party cyclic remote state preparation (RSP) protocol among an arbitrary number of players and a controller. Specifically, we employ a four-party scheme in the case of a cyclic asymmetric remote state preparation scheme and demonstrate the feasibility of the scheme on the IBM Quantum Experience platform. Furthermore, we present a general quantum channel expression under different circulation directions based on the n-party. In addition, considering the impact of the actual environment in the scheme, we discuss the feasibility of the scheme affected by different noises.

1. Introduction

During the past few years, quantum communication theory and technology have been further extended. Quantum entanglement is a crucial resource in quantum information processing tasks, and has been widely applied in various fields such as quantum teleportation (QT), remote state preparation (RSP), quantum key distribution (QKD) and quantum secret sharing (QSS). In 1982, Aspect successfully confirmed the phenomenon of quantum entanglement through experiments [1]. In 1993, Bennett proposed the concept of QT [2], which has great potential for protecting sensitive information and accelerating classical computation. Then, Lo [3] first introduced remote state preparation (RSP) at the beginning of the 21st century. In RSP [4,5,6], Alice can remotely prepare an arbitrary single-qubit quantum state for Bob by using a classical bit communication and a shared entangled state. Besides, Alice knows all the information of the single-qubit quantum state to be prepared by Bob, and Alice does not have to hold the single-qubit quantum state. Since then, the novel type of RSP has drawn considerable attention, and various related schemes [7,8,9,10,11], like CRSP (controlled RSP) [12,13], CJRSP (controlled joint) [14] and CBRSP (controlled bidirectional RSP), have been presented. In addition, with the development of entanglement source preparation, the scheme of RSP has been expanded from single qubit to multiple qubits [15]. In 2016, Chen et al. pointed out an efficient scheme for the RSP of an arbitrary five-qubit Brown-type state [16]. Binayak and Ding introduced the joint remote preparation of an arbitrary six-qubit cluster-type state [17,18]. In 2018, Wu and Fang discussed the bidirectional and hybrid quantum information transmission schemes [19,20]. A JRSP scheme of the arbitrary eight-qubit cluster-type state was put forward in 2020 [21]. However, we note that almost all the protocols mentioned above are only considered in one-way directional or bidirectional preparations. In fact, the information network is made up of two or more nodes, that is, a large information system usually is composed by some subsystems. Naturally, some cyclic RSP schemes [22,23] are investigated, information switching is not located in two-party system. In 2019, Li [24] et al. discussed the scheme of the controlled cyclic quantum teleportation of an arbitrary two-qubit entangled state by employing a ten-qubit entangled state as a quantum channel. Sang [25] et al. explored a scheme of four-party cyclic RSP of an arbitrary single-qubit state by employing a ten-qubit maximally entangled state as the quantum channel. In quantum communication, the remote preparation of multi-particle quantum states between multi-party is inevitable. So we put forward the cyclic asymmetric remote preparation scheme with qubits sequentially increasing, which is a novel transmission mode of cyclic RSP. Furthermore, we generalize the scheme to send multiple qubits quantum information among multiple players in an asymmetric manner.
The influence of decoherence caused by the actual environment has always been the major factor affecting the effect of quantum state transmission; it is meaningful to investigate the cyclic controlled RSP in a noisy environment. In recent years, some RSP schemes that operated in noisy environments have been proposed [26,27,28,29]. In 2018, Sun [30] put forward an asymmetrically controlled two-way joint RSP in a noisy environment for the preparation of single and three equatorial states. The deterministic hierarchical remote state preparation of a two-qubit entangled state employing a Brown state in a noisy environment was proposed in 2020 [31].
Since 2016, IBM Quantum Experience has allowed players to design quantum circuits employing an interactive graphical user interface, test and simulate these circuits on classic computers and actual quantum processors. The actual relevance of an optimized scheme lies in the experimental realization of the scheme. The different kinds of theoretical protocols for quantum communication and computation [32,33,34] have already been verified in the IBM quantum experience. IBM Quantum Experience has been utilized to perform many practical experiments on quantum chips, including quantum simulation, the development of quantum algorithms [35], testing quantum information theory tasks, quantum cryptography, quantum error correction [36], quantum applications [37], and so forth.
In this paper, we put forward a novel (N + 1)-party cyclic RSP protocol for preparing sequentially increasing qubits among arbitrary number of players with a controller. To be specific, the i-th party prepare an i-qubit state for the (i + 1)-th party in a loop of N(1, 2, … i, i + 1, … n)-party, and the n-th party prepares the n-qubit state for the first party. Moreover, we demonstrate the special case of our scheme on the IBM quantum computer by designing appropriate quantum circuits using single-qubit and two-qubit quantum gates. For verifying the practicality of our scheme, we also discuss the variation of the fidelity of the scheme affected by different noises.
This paper is structured as follows—in Section 2, we specifically introduce a controlled cyclic asymmetric RSP scheme in which Alice remotely prepares an arbitrary single-qubit state for Bob, Bob prepares an arbitrary two-qubit state to Charlie, and Charlie prepares an arbitrary three-qubit state for Alice. Then, we construct the quantum circuit simulation of this scheme in IBM’s quantum simulator and analyse the mean probability of the output results. Furthermore, we generalize the scheme to (N + 1)-party controlled cyclic RSP protocol for sequentially increasing qubits in Section 3. In Section 4, we analyze and compare the fidelity of output state in four noisy environments (depolarization noise, amplitude damping noise, phase damping noise, and bit-phase flip noise). Finally, we give a brief comparison and conclusion of the scheme in Section 5.

2. Four-Party Controlled Cyclic Asymmetrical RSP Protocol of Sequentially Increasing Qubits States

In this section, we aim at a situation where the amount of information transmitted between multiple participants is sequentially increasing. Suppose that there are four participants, employing ten quantum entangled states as quantum channels. Alice prepares any single-qubit state ξ A = a 0 e i θ 0 0 + a 1 e i θ 1 1 for Bob, Bob prepares any two-qubit state ξ B = b 0 e i ϕ 0 00 + b 1 e i ϕ 1 11 for Charlie, Charlie prepares any three-qubit state ξ C = c 0 e i γ 0 000 + c 1 e i γ 1 111 for Alice, and David is the controller, where a 0 , a 1 , b 0 , b 1 , c 0 , c 1 R , a 0 2 + a 1 2 = 1 , b 0 2 + b 1 2 = 1 , c 0 2 + c 1 2 = 1 , θ 0 , θ 1 , ϕ 0 , ϕ 1 , γ 0 , γ 1 0 , 2 π . The scenario of the scheme is shown in Figure 1.
The quantum channel linking the Alice, Bob, Charlie and David has the form
φ 12345678910 = 1 4 [ ( 0000 + 1111 ) 1234 ( 000 + 111 ) 567 ( 00 + 11 ) 89 0 10 + ( 0011 1100 ) 1234 ( 011 100 ) 567 ( 01 10 ) 89 1 10 ] ,
where Alice holds qubits (2,3,4,9), Bob holds qubits (5,8), Charlie holds qubits (1,6,7), and David holds qubit 10.

2.1. Preparation of Quantum Channel

The quantum channel in the simplest case is a ten-qubits entangled state shared by the sender Alice, Bob, Charlie and the receiver David, which can be realized by Hadamard (H), Controlled-NOT (CNOT) operations and Pauli X, Y, Z gates in “IBM qasm Simulator”.
Firstly, the product state of ten-qubit states initialized to 0 is used as the input state φ 0 in the quantum circuit, which can be expressed as:
φ 0 = 0 1 0 2 0 10
Then, performing H gates on qubits (1, 5, 8, 10), and then the input state φ 0 is converted to φ 1 as follows:
φ 1 = ( 0000 + 1000 ) 1234 ( 000 + 100 ) 567 ( 00 + 10 ) 89 ( 0 + 1 ) 10 .
Several CNOT operations are performed on the following qubit pairs (1,2), (1,3), (1,4), (5,6), (5,7), (8,9). When qubit 10 is | 1 , qubits 3, 4, 6, 7, and 9 are performed Pauli X gate operation, and qubits 1, 5, and 8 are performed Pauli Z gate operation. Afterwards, the quantum channel is reconstructed as Formula (1).
Then, Alice, Bob and Charlie respectively performing CNOT operation on qubits pairs (9, a ), (5, b ), (1, c ), qubits 9, 5, 1 control auxiliary qubits a and b , c . We get the thirteen-qubits target channel and it can be described as follows:
φ 12345678910 a b c = 1 4 [ ( 0000 0 c + 1111 1 c ) 1234 ( 000 0 b + 111 1 b ) 567 ( 00 0 a + 11 1 a ) 89 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( 011 0 b 100 1 b ) 567 01 1 a 10 0 a ) 89 1 10 ] .
The process and the result of the construction of the target channel in IBM qasm Simulator is illustrated by Figure 2.
Theoretically, the distribution probability of each quantum state in the target channel is 0.0625 in ideal case. Based on the Figure 2b, we calculate that the standard deviation of the average probability distribution is 0.002. The diversity in mean probability and ideal case is due to the decoherence effects and gate errors.

2.2. Description of Four-Party Controlled Cyclic Asymmetrical RSP Protocol

In this scheme, the four participants including three players and one controller, and each of the players acts both as a sender and as a receiver. From the schematic given in Figure 3, the procedure of the four-party controlled cyclic asymmetrical RSP protocol is detailed as follows:
Step 1: Alice selects an appropriate measurement basis according to the known quantum state to perform a single qubit measurement on his qubits. After completing the measurement operations, Alice announces his outcomes to the Bob via the classical channels.
Alice performs a single qubit measurement on qubit 9 based on the following basis:
Φ + 9 = ( a 0 0 + a 1 1 ) 9 Φ 9 = ( a 1 0 a 0 1 ) 9
The measurement result has two possibilities, and the remaining qubits collapse with a probability of 0.5 to a new state as follows:
9 Φ ± Φ ± φ φ 123456789 , 10 , a b c = 1 4 [ ( 0000 0 c + 1111 1 c ) 1234 ( 000 0 b + 111 1 b ) 567 ( a 0 0 8 0 a + a 1 1 8 1 a ) 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( 011 0 b 100 1 b ) 567 ( a 1 0 8 1 a a 0 1 8 0 a ) 1 10 ] = 1 4 [ ( 0000 0 c + 1111 1 c ) 1234 ( 000 0 b + 111 1 b ) 567 ( a 1 0 8 0 a a 0 1 8 1 a ) 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( 011 0 b 100 1 b ) 567 ( a 0 0 8 1 a a 1 1 8 0 a ) 1 10 ] .
Alice performs a single qubit measurement on an auxiliary qubit a .
For 9 Φ + φ 123456789 , 10 , a b c , the basis are
Ψ + a = 1 2 ( e i θ 0 0 + e i θ 1 1 ) a Ψ a = 1 2 ( e i θ 0 0 e i θ 1 1 ) a .
The remaining qubits collapse with a probability of 0.5 to a new state as follows:
a Ψ ± 9 Φ + Φ + φ φ 123456789 , 10 , a b c = 1 4 2 [ ( 0000 0 c + 1111 1 c ) 1234 ( 000 0 b + 111 0000 b ) 567 ( a 0 e i θ 0 0 8 + a 1 e i θ 1 1 8 ) 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( 011 0 b 100 1 b ) 567 ( a 1 e i θ 1 0 8 a 0 e i θ 0 1 8 ) 1 10 ] = 1 4 2 [ ( 0000 0 c + 1111 1 c ) 1234 ( 000 0 b + 111 1 b ) 567 ( a 0 e i θ 0 0 8 a 1 e i θ 1 1 8 ) 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( 011 0 b 100 1 b ) 567 ( a 1 e i θ 1 0 8 a 0 e i θ 0 1 8 ) 1 10 ] .
For 9 Φ Φ φ φ 12345678910 a b c , the basis are
Ω + a = 1 2 ( e i θ 1 0 + e i θ 0 1 ) a Ω a = 1 2 ( e i θ 1 0 e i θ 0 1 ) a .
The remaining qubits collapse with a probability of 0.5 to a new state as follows:
a Ω ± 9 Φ Φ φ φ 123456789 , 10 , a b c = 1 4 2 [ ( 0000 0 c + 1111 1 c ) 1234 ( 000 0 b + 111 1 b ) 567 ( a 1 e i θ 1 0 8 a 0 e i θ 0 1 8 ) 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( 011 0 b 100 1 b ) 567 ( a 0 e i θ 0 0 8 a 1 e i θ 1 1 8 ) 1 10 ] = 1 4 2 [ ( 0000 0 c + 1111 1 c ) 1234 ( 000 0 b + 111 1 b ) 567 ( a 1 e i θ 1 0 8 + a 0 e i θ 0 1 8 ) 1 10 + ( 0011 0 c 1100 1 c ) 1234 ( 011 0 b 100 1 b ) 567 ( a 0 e i θ 0 0 8 a 1 e i θ 1 1 8 ) 1 10 ] .
Step 2: Bob selects an appropriate measurement basis according to the known quantum state to perform a single qubit measurement on his qubits. After completing the measurement, Bob announces his outcomes to the Charlie via the classical channels.
Bob performs a single qubit measurement on qubit 5 based on the following basis:
Φ + 5 = ( b 0 0 + b 1 1 ) 5 Φ 5 = ( b 1 0 b 0 1 ) 5 .
The measurement result has eight possibilities, and the remaining qubits collapse with a probability of 0.125 to a new state 5 Φ ± a Ψ ± 9 Φ + Φ + φ φ 123456789 , 10 , a b c 5 Φ ± a Ω ± 9 Φ Φ φ φ 123456789 , 10 , a b c .
Then Bob performs a single qubit measurement on an auxiliary qubit b .
For 5 Φ + a Ψ ± 9 Φ + Φ + φ φ 123456789 , 10 , a b c 5 Φ + a Ω ± 9 Φ Φ φ φ 123456789 , 10 , a b c , the basis are
Ψ + b = 1 2 ( e i ϕ 0 0 + e i ϕ 1 1 ) b Ψ b = 1 2 ( e i ϕ 0 0 e i ϕ 1 1 ) b .
If Bob’s single-qubit projection measurement result is Φ + 5 , Ψ + b , the remaining qubits collapse with a probability of 0.25 to a new state as follows:
b Ψ + 5 Φ + a Ψ ± 9 Φ + Φ + φ φ 123456789 , 10 , a b c = 1 8 [ ( 0000 0 c + 1111 1 c ) 1234 ( b 0 e i ϕ 0 00 67 + b 1 e i ϕ 1 11 67 ) ( a 0 e i θ 0 0 8 + a 1 e i θ 1 1 8 ) 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( b 0 e i ϕ 0 11 67 b 1 e i ϕ 1 00 67 ) ( a 1 e i θ 1 0 8 a 0 e i θ 0 1 8 ) 1 10 ] = 1 8 [ ( 0000 0 c + 1111 1 c ) 1234 ( b 0 e i ϕ 0 00 67 + b 1 e i ϕ 1 11 67 ) ( a 0 e i θ 0 0 8 a 1 e i θ 1 1 8 ) 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( b 0 e i ϕ 0 11 67 b 1 e i ϕ 1 00 67 ) ( a 1 e i θ 1 0 8 a 0 e i θ 0 1 8 ) 1 10 ]
b Ψ + 5 Φ + a Ω ± 9 Φ Φ φ φ 123456789 , 10 , a b c = 1 8 [ ( 0000 0 c + 1111 1 c ) 1234 ( b 0 e i ϕ 0 00 67 + b 1 e i ϕ 1 11 67 ) ( a 1 e i θ 1 0 8 a 0 e i θ 0 1 8 ) 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( b 0 e i ϕ 0 11 67 b 1 e i ϕ 1 00 67 ) ( a 0 e i θ 0 0 8 a 1 e i θ 1 1 8 ) 1 10 ] = 1 8 [ ( 0000 0 c + 1111 1 c ) 1234 ( b 0 e i ϕ 0 00 67 + b 1 e i ϕ 1 11 67 ) ( a 1 e i θ 1 0 8 + a 0 e i θ 0 1 8 ) 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( b 0 e i ϕ 0 11 67 b 1 e i ϕ 1 00 67 ) ( a 0 e i θ 0 0 8 a 1 e i θ 1 1 8 ) 1 10 ] .
For 5 Φ a Ψ ± 9 Φ + Φ + φ φ 123456789 , 10 , a b c 5 Φ a Ω ± 9 Φ Φ φ φ 123456789 , 10 , a b c the basis are
Ω + b = 1 2 ( e i ϕ 1 0 + e i ϕ 0 1 ) a Ω b = 1 2 ( e i ϕ 1 0 e i ϕ 0 1 ) a .
If Bob’s single-qubit projection measurement result is | Ω + > b Φ 5 , the remaining qubits collapse with a probability of 0.25 to a new state as follows:
b Ω + 5 Φ a Ψ ± 9 Φ + Φ + φ φ 123456789 , 10 , a b c = 1 8 [ ( 0000 0 c + 1111 1 c ) 1234 ( b 1 e i ϕ 1 00 67 b 0 e i ϕ 0 11 67 ) ( a 0 e i θ 0 0 8 + a 1 e i θ 1 1 8 ) 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( b 1 e i ϕ 1 11 67 + b 0 e i ϕ 0 00 67 ) ( a 1 e i θ 1 0 8 a 0 e i θ 0 1 8 ) 1 10 ] = 1 8 [ ( 0000 0 c + 1111 1 c ) 1234 ( b 1 e i ϕ 1 00 67 b 0 e i ϕ 0 11 67 ) ( a 0 e i θ 0 0 8 a 1 e i θ 1 1 8 ) 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( b 1 e i ϕ 1 11 67 + b 0 e i ϕ 0 00 67 ) ( a 1 e i θ 1 0 8 a 0 e i θ 0 1 8 ) 1 10 ]
b Ω + 5 Φ a Ω ± 9 Φ Φ φ φ 123456789 , 10 , a b c = 1 8 [ ( 0000 0 c + 1111 1 c ) 1234 ( b 1 e i ϕ 1 00 67 b 0 e i ϕ 0 11 67 ) ( a 1 e i θ 1 0 8 a 0 e i θ 0 1 8 ) 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( b 1 e i ϕ 1 00 67 + b 0 e i ϕ 0 11 67 ) ( a 0 e i θ 0 0 8 a 1 e i θ 1 1 8 ) 1 10 ] = 1 8 [ ( 0000 0 c + 1111 1 c ) 1234 ( b 1 e i ϕ 1 00 67 b 0 e i ϕ 0 11 67 ) ( a 1 e i θ 1 0 8 + a 0 e i θ 0 1 8 ) 0 10 + ( 0011 0 c 1100 1 c ) 1234 ( b 1 e i ϕ 1 00 67 + b 0 e i ϕ 0 11 67 ) ( a 0 e i θ 0 0 8 a 1 e i θ 1 1 8 ) 1 10 ] .
Step 3: Charlie selects an appropriate measurement basis according to the known quantum state to perform a single qubit measurement on his qubits. After completing the measurement, Charlie announces his outcomes to the Alice via the classical channels.
Charlie performs a single qubit measurement on qubit 1 based on the following basis:
Φ + 1 = ( c 0 0 + c 1 1 ) 1 Φ 1 = ( c 1 0 c 0 1 ) 1 .
Then Charlie performs a single qubit measurement on an auxiliary qubit c .
If Charlie performs a single qubit measurement on qubit 1 based on the Φ + 1 , the basis are
Ψ + c = 1 2 ( e i γ 0 0 + e i γ 1 1 ) a Ψ c = 1 2 ( e i γ 0 0 e i γ 1 1 ) a .
If Charlie performs a single qubit measurement on qubit 1 based on the Φ 1 , the basis are
Ω + c = 1 2 ( e i γ 1 0 + e i γ 0 1 ) a Ω c = 1 2 ( e i γ 1 0 e i γ 0 1 ) a .
Step 4: David carries out a single qubit measurement on qubit 10 based on the following basis: 0 , 1 .
With the help of the controller David, the senders Alice, Bob and Charlie can exchange their desired quantum state at the same time. The final result of the controlling party David measuring particle 10 makes the participants Alice, Bob, and Charlie must carry out corresponding unitary transformations, respectively, to obtain all the information of the quantum state. The controller ensures the security of the quantum communication scheme and provides robustness against complex eavesdropping attacks.
Step 5: The unitary transformations
If the controller, David’s, basis is 0 , then the qubits 2,3,4,6,7 and 8 will collapse into the following product state φ 234678 = ( c 0 e i γ 0 000 + c 1 e i γ 1 111 ) ( b 0 e i ϕ 0 00 + b 1 e i ϕ 1 11 ) ( a 0 e i θ 0 0 + a 1 e i θ 1 1 ) . Alice, Bob and Charlie carry out a corresponding unitary operation I 234 I 67 I 8 to obtain the desired quantum state respectively.
If the controller David’s basis is 1 , then the qubits 2,3,4,6,7 and 8 will collapse into the following product state φ 234678 = ( c 0 e i γ 0 011 c 1 e i γ 1 100 ) ( b 0 e i ϕ 0 11 b 1 e i ϕ 1 00 ) ( a 1 e i θ 1 0 a 0 e i θ 0 1 ) . Alice, Bob and Charlie carry out a corresponding unitary operation σ z 2 σ x 34 i σ y 6 σ x 7 i σ y 8 to obtain the desired quantum state, respectively.
For the other 127 measurement results, Alice, Bob and Charlie can perform an appropriate unitary operation on their qubit according to the single-qubit projection measurement result, and then reconstruct the desired quantum state for 100%. Eight situations of the possible outcomes of the measurement results and corresponding unitary operations are illustrated in the following Table 1.

2.3. Experimental Realization in IBM QE

The implementation of a particular protocol is made solely in view of the number of qubits the device supports. It provides free access through a cloud-based web-interface called IBM Quantum Experience (IBM QE), which allows researchers to design, test and run their experiments. Based on the high level of control that can be reached on the IBM digital quantum computer, we perform a proof-of-principle experimental realization of the four-party controlled asymmetric RSP scheme in IBM quantum computer. Randomness intrinsic in quantum mechanics is shown with the help of measuring an equal super position state in the computational basis for single run. The experiment is repeated for a different number of shots in the device to get the probability of obtaining each output state accurately.
The single-qubit quantum gates like Identity gate(I), Pauli gates (X, Y, Z), Hardman gate (H), and phase gates (S, S , T, T ) are available in the IBM quantum experience toolbox. These gates can be inserted anywhere in the circuit utilizing a graphical user interface which allows click, drag, and drop method.
In the Four-party controlled cyclic asymmetrical RSP protocol of sequentially increasing qubits states, we assume that the measurement basis are Φ + 9 , Φ + 5 , Φ + 1 , Ψ + a , Ψ + b , Ψ + c , and the coefficient of measurement basis is a 0 , a 1 , b 0 , b 1 , c 0 , c 1 = 1 2 . Owing to the q-sphere simulation is only available for circuits using less than 6 qubits, we suppose that the phase coefficient of measurement basis is θ 0 , θ 1 , ϕ 0 , ϕ 1 , γ 0 , γ 1 = 0 . We implement controlled Z gate on qubits 2, 6, and 8, and controlled X gate on qubits 3, 4, 6, 7, 8 to achieve the above scheme. The circuit diagram constructed is shown in Figure 4:
The output state of the four-party controlled cyclic asymmetrical RSP protocol can be obtained by performing a measurement operator at the end of the lines, which in turn gives the average probability of each output state.
From Figure 5, it shows the state of qubits 1,5,9,10,11,12,13 are 0 . In the ideal situation, the mean probabilities for the output state of qubits 2, 3, 4, 6, 7, 8 are 0.125, the output state is φ 234678 = 1 2 2 ( 000 + 111 ) ( 00 + 11 ) ( 0 + 1 ) , and the result after running ten times in Jupyter Notebook (Figure 5b) is more stable than the result after running once in the ibmq_qsam_simulator (Figure 5a). We successfully implement quantum circuit in the IBM quantum computer to realize the cyclic asymmetric RSP scheme.
In Table 2, we have shown the outcome of 10 runs for the output state each run having 8192 shots. According the average value and standard deviation, we obtain the average error between the ideal results and the experimental results is 0.004. The discrepancy arises from the finite coherence time of the qubits, the implementation of the gates and the process of reading out the qubits.

3. Multi-Party Controlled Cyclic Asymmetrical RSP Protocol of Sequentially Increasing Qubits States

The controlled cyclic asymmetrical RSP protocol of sequentially increasing qubits states can be extended to multiparty scenario easily. Suppose there are n players A l i c e 1 , A l i c e 2 , … and A l i c e n , and controller Charlie. A l i c e i can prepare an i-qubit state to his neighbor A l i c e i + 1 under the control of Charlie. The entangled channel share among participants is φ ( i = 1 n ( i + 1 ) + 1 ) .
φ ( i = 1 n ( i + 1 ) + 1 ) = 1 2 [ ( 0 0 + 1 1 ) A n 1 , A 1 1 , , A 1 n ( 0 0 + 1 1 ) A n 1 1 , A n 2 , , A n n ( 0 0 + 1 1 ) A i 1 , A i + 1 2 , A i + 1 i + 1 ( 000 + 111 ) A 2 1 , A 3 2 , A 3 3 ( 00 + 11 ) A 1 n + 1 , A 2 2 0 ( i = 1 n ( i + 1 ) + 1 ) + ( 0 1 1 0 ) A n 1 , A 1 1 , , A 1 n ( 0 1 1 0 ) A n 1 1 , A n 2 , , A n n ( 0 1 1 0 ) A i 1 , A i + 1 2 , A i + 1 i + 1 ( 011 100 ) A 2 1 , A 3 2 , A 3 3 ( 01 10 ) A 1 n + 1 , A 2 2 1 ( i = 1 n ( i + 1 ) + 1 ) ] ,
where A 1 n represents the nth qubit owned by A l i c e 1 , A n n represents the nth qubit owned by A l i c e n , and A i + 1 i represents the i-th qubit owned by A l i c e i + 1 , and i { 1 , 2 , , n } . Charlie holds control qubit labeled by i = 1 n ( i + 1 ) + 1 . For example, if n = 3, the entangled channel shared should have the form as Equation (1).
If we want to change the direction of the controlled cyclic asymmetrical RSP protocol, we need to change the distribution of qubits, and the quantum channel will be changed to the following expression.
φ ( i = 1 n ( i + 1 ) + 1 ) = 1 2 [ ( 0 0 + 1 1 ) A 2 1 , A 1 1 , , A 1 n ( 0 0 + 1 1 ) A 3 1 , A 2 2 , A 2 n ( 0 0 + 1 1 ) A i + 1 1 , A i 2 , A i i + 1 ( 000 + 111 ) A n 1 , A n 1 2 , A n 1 3 ( 00 + 11 ) A 1 n + 1 , A n 2 0 ( i = 1 n ( i + 1 ) + 1 ) + ( 0 1 1 0 ) A 2 1 , A 1 1 , , A 1 n ( 0 1 1 0 ) A 3 1 , A 2 2 , A 2 n ( 0 1 1 0 ) A i + 1 1 , A i 2 , A i i + 1 ( 011 100 ) A n 1 , A n 1 2 , A n 1 3 ( 01 10 ) A 1 n + 1 , A n 2 1 ( i = 1 n ( i + 1 ) + 1 ) ] ,
where A 2 1 represents the 1th qubit owned by A l i c e 2 , A i i + 1 represents the (i + 1)th qubit owned by A l i c e i , Charlie holds control qubit labeled by i = 1 n ( i + 1 ) + 1 . Specifically, there is ( 0 0 n + 1 + 1 1 n + 1 ) A 2 1 , A 1 1 , , A 1 n . When n is even, there is ( 0 n + 1 2 1 n + 1 2 + 1 1 n + 1 2 0 n + 1 2 + 1 ) A 2 1 , A 1 1 , , A 1 n . When n is odd, there is ( 0 n + 1 2 1 n + 1 2 1 n + 1 2 0 n + 1 2 ) A 2 1 , A 1 1 , , A 1 n .

4. Four-Party Controlled Cyclic Asymmetrical RSP Protocol in Noisy Environments

In this section, we discuss our scheme in four noisy environments, including amplitude-damping, phase-damping noise, bit-flip noise, and phase-flip noise.
The content shared by the participants in advance is constructed by an organization called the QDC (Qubits Distribution Center). After preparing the quantum channel, QDC allocates the qubits A 1 , A 2 , A 3 , A 4 to Alice, the qubits B 1 , B 2 to Bob, and sends the qubits C 1 , C 2 , C 3 to Charlie, sends the qubits D 1 to David. If the quantum channel is in an ideal environment without noise influence, it is a pure state, and its density matrix can be expressed as ρ = ζ ζ . In practical applications, when affected by a noisy environment [38], the pure state may be converted to a mixed state. The corresponding density matrix can be written as follows:
Λ q ( ρ ) = m ( E j q ) C 1 ( E j q ) A 1 ( E j q ) A 2 ( E j q ) A 3 ( E j q ) B 1 ( E j q ) C 2 ( E j q ) C 3 ( E j q ) B 2 × ( E j q ) A 4 ( E j q ) D 1 ρ ( E j q ) C 1 ( E j q ) A 1 ( E j q ) A 2 ( E j q ) A 3 ( E j q ) B 1 ( E j q ) C 2 × ( E j q ) C 3 ( E j q ) B 2 ( E j q ) A 4 ( E j q ) D 1 ,
where j is a label, and different noise channels have different values; the superscript indicates that the operator E acts on different noise environment and q D , A , P , W , B , S . If q = D , for depolarized noise, then j = 0 , 1 , 2 , 3 ; if q = A , for amplitude damping noise, then j = 0 , 1 ; if q = P , for phase damping noise, then j = 0 , 1 ; if q = S , for bit-phase flip noise, then j = 0 , 1 .
For reconstructing the desired state, three participants and the controller have to perform single-qubit measurements based on appropriate measurement bases.The desired states were then reconstructed via unitary transformations. If the seven measurement bases are Φ + 9 , Ψ + a , Φ + 5 , Ψ + b , Φ + 1 , Ψ + c , 0 10 , then the corresponding unitary transformations would be I A 2 I A 3 I A 4 I B 2 I B 3 I C 2 to recover the desired states. We obtain the reconstructed desired state in an ideal environment as follows,
ζ = c 0 e i γ 0 000 + c 1 e i γ 1 111 A 1 A 2 A 3 b 0 e i ϕ 0 00 + b 1 e i ϕ 1 11 C 2 C 3 a 0 e i θ 0 0 + a 1 e i θ 1 1 B 2 0 D 1 + c 0 e i γ 0 011 c 1 e i γ 1 100 A 1 A 2 A 3 b 0 e i ϕ 0 11 b 1 e i ϕ 1 00 C 2 C 3 a 1 e i θ 1 0 a 0 e i θ 0 1 B 2 1 D 1 .
For any two quantum states, including pure state and mixed state, the fidelity is F ( ρ , σ ) = T r ρ 1 2 σ ρ 1 2 , which is defined as a formula composed of density operators in two states. Then the fidelity between two pure states ψ and φ is the modulus of their inner product, which is F = ψ ψ φ φ . As in this article, when the ideal output state is a pure state and the observed output state is a mixed state, the fidelity formula defined by the original fidelity is simplified to F = ζ ρ o u t ζ . When the two states are mixed state, the density matrix can be calculated separately employing the universal formula F ( ρ , σ ) = T r ( ρ σ ) + 1 T r ( ρ 2 ) 1 T r ( σ 2 ) .

4.1. Depolarized Noise

For a single qubit, supposing that the qubit is depolarized with probability p and remains unchanged with probability 1-p. The effect of the depolarization noise on the Bloch sphere is the entire sphere shrinks uniformly as a function of p. Then the state of the quantum system in depolarized noise is ε ( ρ ) = p I 2 + ( 1 p ) ρ , and supposing there is I 2 = ρ + X ρ X + Y ρ Y + Z ρ Z 4 , and then get ε ( ρ ) = ( 1 p ) ρ + p 3 ( X ρ X + Y ρ Y + Z ρ Z ) . The depolarized noise can be expressed by Kraus operators given in Formula (25).
E 0 D = 1 3 4 p D , E 1 D = p D 4 0 1 1 0 , E 2 D = p D 4 0 i i 0 , E 3 D = p D 4 1 0 0 1 ,
where p D [ 0 , 1 ] is the decoherence rate for depolarized noise. E 0 D means that the quantum state 0 , 1 is not changed, but the amplitude of the quantum state is reduced; E 1 D means the quantum state 0 and 1 transition with probability p D 4 ; E 2 D means the quantum state 0 transitions to i 1 , the quantum state 1 transitions to i 0 ; E 2 D means the quantum state 1 transition to 1 .
If the scheme is implemented in depolarized noisy environment, then the concrete density matrices of the output states can be obtained as follows.
( ρ o u t D ) = ( 1 3 4 p D ) 10 { c 0 e i γ 0 000 + c 1 e i γ 1 111 A 1 A 2 A 3 × b 0 e i ϕ 0 00 + b 1 e i ϕ 1 11 C 2 C 3 × a 0 e i θ 0 0 + a 1 e i θ 1 1 B 2 0 D 1 + c 0 e i γ 0 011 c 1 e i γ 1 100 A 1 A 2 A 3 × b 0 e i ϕ 0 11 b 1 e i ϕ 1 00 C 2 C 3 × a 1 e i θ 1 0 a 0 e i θ 0 1 B 2 1 D 1 × c 0 e i γ 0 000 + c 1 e i γ 1 111 A 1 A 2 A 3 × b 0 e i ϕ 0 00 + b 1 e i ϕ 1 11 C 2 C 3 × a 0 e i θ 0 0 + a 1 e i θ 1 11 B 2 0 D 1 + c 0 e i γ 0 011 c 1 e i γ 1 100 A 1 A 2 A 3 × b 0 e i ϕ 0 11 b 1 e i ϕ 1 00 C 2 C 3 × a 1 e i θ 1 0 a 0 e i θ 0 1 B 2 1 D 1 } + ( p D 4 ) 10 { c 1 e i γ 1 111 + c 0 e i γ 0 000 A 1 A 2 A 3 × b 1 e i ϕ 1 11 + b 0 e i ϕ 0 00 C 2 C 3 × a 1 e i θ 1 1 + a 0 e i θ 0 0 B 2 1 D 1 + c 1 e i γ 1 100 c 0 e i γ 0 011 A 1 A 2 A 3 × b 1 e i ϕ 1 00 b 0 e i ϕ 0 11 C 2 C 3 × a 0 e i θ 0 1 a 1 e i θ 1 0 B 2 0 D 1 × c 1 e i γ 1 111 + c 0 e i γ 0 000 A 1 A 2 A 3 × b 1 e i ϕ 1 11 + b 0 e i ϕ 0 00 C 2 C 3 × a 1 e i θ 1 1 + a 0 e i θ 0 0 B 2 1 D 1 + c 1 e i γ 1 100 c 0 e i γ 0 011 A 1 A 2 A 3 × b 1 e i ϕ 1 00 b 0 e i ϕ 0 11 C 2 C 3 × a 0 e i θ 0 1 a 1 e i θ 1 0 B 2 0 D 1 } + ( p D 4 ) 10 { c 1 e i γ 1 111 + c 0 e i γ 0 000 A 1 A 2 A 3 × i ( b 1 e i ϕ 1 11 b 0 e i ϕ 0 00 ) C 2 C 3 × ( a 1 e i θ 1 1 + a 0 e i θ 0 0 ) B 2 i 1 D 1 + c 1 e i γ 1 100 c 0 e i γ 0 011 A 1 A 2 A 3 × i ( b 1 e i ϕ 1 00 + b 0 e i ϕ 0 11 ) C 2 C 3 × a 0 e i θ 0 1 a 1 e i θ 1 0 B 2 i 0 D 1 × c 1 e i γ 1 1111 + c 0 e i γ 0 000 A 1 A 2 A 3 × i ( b 1 e i ϕ 1 11 b 0 e i ϕ 0 00 ) C 2 C 3 × ( a 1 e i θ 1 1 + a 0 e i θ 0 0 ) B 2 i 1 D 1 + c 1 e i γ 1 100 c 0 e i γ 0 011 A 1 A 2 A 3 × i ( b 1 e i ϕ 1 00 + b 0 e i ϕ 0 11 ) C 2 C 3 × a 0 e i θ 0 1 a 1 e i θ 1 0 ) B 2 i 0 D 1 } + ( p D 4 ) 10 { c 0 e i γ 0 000 + c 1 e i γ 1 111 A 1 A 2 A 3 × b 0 e i ϕ 0 00 b 1 e i ϕ 1 11 C 2 C 3 × a 0 e i θ 0 0 + a 1 e i θ 1 1 B 2 0 D 1 + c 0 e i γ 0 011 c 1 e i γ 1 100 A 1 A 2 A 3 × b 0 e i ϕ 0 11 + b 1 e i ϕ 1 00 C 2 C 3 × ( a 1 e i θ 1 0 a 0 e i θ 0 1 ) B 2 1 D 1 × c 0 e i γ 0 000 + c 1 e i γ 1 111 A 1 A 2 A 3 × b 0 e i ϕ 0 00 b 1 e i ϕ 1 11 C 2 C 3 × a 0 e i θ 0 0 + a 1 e i θ 1 1 B 2 0 D 1 + c 0 e i γ 0 011 c 1 e i γ 1 100 A 1 A 2 A 3 × b 0 e i ϕ 0 11 + b 1 e i ϕ 1 00 C 2 C 3 × ( a 1 e i θ 1 0 a 0 e i θ 0 1 ) B 2 1 D 1 } .
Then, the fidelity of the output state in depolarized noisy environment can be calculated as:
F D = ζ ρ o u t D ζ = ( 1 3 4 p D ) 10 + ( p D 4 ) 10 ( b 0 2 b 1 2 ) 2 + ( b 0 2 b 1 2 ) 2 × ( a 0 2 a 1 2 ) 2 .
It can be seen from the above formula that the fidelity of the output quantum state is related to the decoherence rate in depolarization noise and the coefficient of the desired quantum state.

4.2. Amplitude Damping Noise

The amplitude damping noise can be expressed by Kraus operators given in Formula (28).
E 0 A = 1 0 0 1 p A , E 1 A = 0 p A 0 0 ,
where P A = sin 2 θ ( P A [ 0 , 1 ] ) is the decoherence rates for amplitude damping noise. E 0 A means that quantum state 0 is not changed, and only reduce the amplitude of quantum state 1 ; E 1 A means the quantum state 1 transition to 0 .
If the scheme is implemented in amplitude damping noisy environment, then the concrete density matrices of the output states can be obtained as follows.
( ρ o u t A ) = { c 0 e i γ 0 000 + ( 1 P A ) 2 c 1 e i γ 1 111 A 1 A 2 A 3 × b 0 e i ϕ 0 00 + ( 1 P A ) 3 b 1 e i ϕ 1 11 C 2 C 3 × a 0 e i θ 0 0 + ( 1 P A ) a 1 e i θ 1 1 B 2 0 D 1 + ( 1 P A ) ( c 0 e i γ 0 011 c 1 e i γ 1 100 ) A 1 A 2 A 3 × ( ( 1 P A ) b 0 e i ϕ 0 11 1 P A b 1 e i ϕ 1 00 ) C 2 C 3 × 1 P A ( a 1 e i θ 1 0 a 0 e i θ 0 1 ) B 2 1 P A 1 D 1 } × { c 0 e i γ 0 000 + ( 1 P A ) 2 c 1 e i γ 1 111 A 1 A 2 A 3 × b 0 e i ϕ 0 00 + ( 1 P A ) 3 b 1 e i ϕ 1 11 C 2 C 3 × a 0 e i θ 0 0 + ( 1 P A ) a 1 e i θ 1 1 B 2 0 D 1 + ( 1 P A ) ( c 0 e i γ 0 011 c 1 e i γ 1 100 ) A 1 A 2 A 3 × ( 1 P A ) ( b 0 e i ϕ 0 11 b 1 e i ϕ 1 00 ) C 2 C 3 × 1 P A ( a 1 e i θ 1 0 a 0 e i θ 0 1 ) B 2 1 P A 1 D 1 } + P A 10 c 0 2 b 0 2 a 0 2 ( 0000000 + 0000000 ) A 1 A 2 A 3 C 2 C 3 B 2 D 1 × ( 0000000 + 0000000 ) A 1 A 2 A 3 C 2 C 3 B 2 D 1 .
Then, the fidelity of the output state in amplitude damping noisy environment can be calculated as:
F A = ζ ρ o u t A ζ = 1 2 { { c 0 2 + ( 1 P A ) 2 c 1 2 × b 0 2 + ( 1 P A ) 3 b 1 2 × a 0 2 + ( 1 P A ) a 1 2 } 2 + { ( 1 P A ) ( c 0 2 + c 1 2 ) × ( ( 1 P A ) b 0 2 + 1 P A b 1 2 ) × 1 P A ( a 0 2 + a 1 2 ) × ( 1 P A ) } 2 } + P A 10 c 0 4 b 0 4 a 0 4 .
It can be seen from the above formula that the fidelity of the output quantum state is related to the decoherence rate in amplitude damping noise and the coefficient of the desired quantum state.

4.3. Phase Damping Noise

The phase damping noise can be expressed by Kraus operators given in Formula (31).
E 0 P = 1 p P 1 0 0 1 , E 1 P = p P 1 0 0 0 , E 2 P = p P 0 0 0 1 ,
where p P [ 0 , 1 ] is the decoherence rates for phase damping noise.
If the scheme is implemented in phase damping noisy environment, then the concrete density matrices of the output states can be obtained as follows.
( ρ o u t P ) = ( 1 p P ) 10 { c 0 e i γ 0 000 + c 1 e i γ 1 111 A 1 A 2 A 3 × b 0 e i ϕ 0 00 + b 1 e i ϕ 1 11 C 2 C 3 × a 0 e i θ 0 0 + a 1 e i θ 1 1 B 2 0 D 1 + c 0 e i γ 0 011 c 1 e i γ 1 100 ) A 1 A 2 A 3 × b 0 e i ϕ 0 11 b 1 e i ϕ 1 00 C 2 C 3 × a 1 e i θ 1 0 a 0 e i θ 0 1 B 2 1 D 1 } × c 0 e i γ 0 000 + c 1 e i γ 1 111 A 1 A 2 A 3 × b 0 e i ϕ 0 00 + b 1 e i ϕ 1 11 C 2 C 3 × a 0 e i θ 0 0 + a 1 e i θ 1 1 B 2 0 D 1 + c 0 e i γ 0 011 c 1 e i γ 1 100 A 1 A 2 A 3 × b 0 e i ϕ 0 11 b 1 e i ϕ 1 00 C 2 C 3 × a 1 e i θ 1 0 a 0 e i θ 0 1 B 2 1 D 1 } + p P 10 c 0 2 b 0 2 a 0 2 0000000 + 0000000 A 1 A 2 A 3 C 2 C 3 B 2 D 1 × 0000000 + 0000000 A 1 A 2 A 3 C 2 C 3 B 2 D 1 + p P 10 c 1 2 b 1 2 a 1 2 1111111 + 1111111 A 1 A 2 A 3 C 2 C 3 B 2 D 1 × 1111111 + 1111111 A 1 A 2 A 3 C 2 C 3 B 2 D 1 .
Then, the fidelity of the output state in phase damping noisy environment can be calculated as:
F P = ζ ρ o u t P ζ = ( 1 p P ) 10 + p P 10 c 0 4 b 0 4 a 0 4 + p P 10 c 1 4 b 1 4 a 1 4 .
It can be seen from the above formula that the fidelity of the output quantum state is related to the coefficient of the desired quantum state and the decoherence rate in phase damping noise.

4.4. Bit-Phase Flip Noise

The bit-phase flip noise is a combination of a phase flip and a bit flip, and its influence to the quantum channel can be expressed by the Kraus operators given in Formula (34).
E 0 S = 1 s P 1 0 0 1 , E 1 S = s P 0 i i 0 ,
where p S [ 0 , 1 ] is the decoherence rates for bit-phase flip noise. E 0 S means that the quantum state 0 is not changed, but the amplitude of quantum state 1 is reduced; E 1 S means that quantum state 0 transitions to i 1 , quantum state 1 transitions to -i 0 .
If the scheme is implemented in bit-phase flip noisy environment, then the concrete density matrices of the output states can be obtained as follows.
( ρ o u t S ) = ( 1 p S ) 10 { c 0 e i γ 0 000 + c 1 e i γ 1 111 A 1 A 2 A 3 × b 0 e i ϕ 0 00 + b 1 e i ϕ 1 11 C 2 C 3 × a 0 e i θ 0 0 + a 1 e i θ 1 1 B 2 0 D 1 + c 0 e i γ 0 011 c 1 e i γ 1 100 ) A 1 A 2 A 3 × b 0 e i ϕ 0 11 b 1 e i ϕ 1 00 C 2 C 3 × a 1 e i θ 1 0 a 0 e i θ 0 1 B 2 1 D 1 } × c 0 e i γ 0 000 + c 1 e i γ 1 111 A 1 A 2 A 3 × b 0 e i ϕ 0 00 + b 1 e i ϕ 1 11 C 2 C 3 × a 0 e i θ 0 0 + a 1 e i θ 1 1 B 2 0 D 1 + c 0 e i γ 0 011 c 1 e i γ 1 100 A 1 A 2 A 3 × b 0 e i ϕ 0 11 b 1 e i ϕ 1 00 C 2 C 3 × a 1 e i θ 1 0 a 0 e i θ 0 1 B 2 1 D 1 } + p S 10 { c 0 e i γ 0 000 + c 1 e i γ 1 111 A 1 A 2 A 3 × i ( b 0 e i ϕ 0 00 b 1 e i ϕ 1 11 ) C 2 C 3 × a 0 e i θ 0 0 a 1 e i θ 1 1 B 2 i 1 D 1 + c 1 e i γ 1 100 c 0 e i γ 0 011 ) A 1 A 2 A 3 × i b 0 e i ϕ 0 11 i b 1 e i ϕ 1 00 C 2 C 3 × a 1 e i θ 1 1 a 0 e i θ 0 0 B 2 i 0 D 1 } × c 0 e i γ 0 000 + c 1 e i γ 1 111 A 1 A 2 A 3 × i ( b 0 e i ϕ 0 00 + b 1 e i ϕ 1 11 ) C 2 C 3 × a 0 e i θ 0 0 a 1 e i θ 1 1 B 2 i 1 D 1 + c 1 e i γ 1 100 c 0 e i γ 0 011 A 1 A 2 A 3 × i ( b 0 e i ϕ 0 11 b 1 e i ϕ 1 00 ) C 2 C 3 × a 1 e i θ 1 1 a 0 e i θ 0 0 B 2 i 0 D 1 } .
Then, the fidelity of the output state in bit-phase flip noisy environment can be calculated as:
F S = ζ ρ o u t S ζ = ( 1 p S ) 10 .
It can be seen from the above formula that the fidelity of the output quantum state is only related to the decoherence rate in bit-phase flip noise.

4.5. Analysis of the Effect of the Scheme in Four Noisy Environments

From the above calculation results of fidelity, it can be found that in the environment of depolarization, amplitude damping and phase damping noise, the fidelity of the output state depends on the coefficient of the desired state and the decoherence rate. However, in a bit-phase flip noise environment, the fidelity of the output state is only decided by the decoherence rate.
As can be seen from the Figure 6, in the depolarization noise, amplitude damped noise, and bit-phase flip noise channels, as the probability of depolarization increases, the fidelity of the output state gradually tends to 0; while in phase damping noise channel, the fidelity of the output state decreases with the increase of decoherence rate and then increases when P > 0.8.
When the decoherence rate of bit-phase flip noise and phase damped noise channel is 0.4, the fidelity of the output state drops to 0, and the fidelity of the phase damping noise is gradually increasing after the decoherence rate is 0.8. When the decoherence rate of the depolarized noise channel is 0.6, the fidelity of the output state drops to 0; and the amplitude damping noise is less affected by the decoherence rate than the other three noises.
When simultaneously considering the influence of the coefficient of the desired quantum state and the decoherence rate, it is assumed that the coefficients of the desired quantum state are all equal. There are the variations of fidelity in different noises as the decoherence rate and the coefficient of desired quantum state varied simultaneously is shown in the figure below:
From Figure 7, it can be observed that the Fidelity(D) and the Fidelity(S) decrease with the P(D) and P(S). The Fidelity(D) and the Fidelity(S) independent of the coefficient of the desired quantum state. In the amplitude damped noise, when the coefficient of the desired state is greater than 0.7, the Fidelity(A) is positively correlated with the transformation of P(A). In the phase damping noise channel, when the coefficient of the desired state is 1 and the P(p) is higher than 0.5, the Fidelity(p) increases as the P(p) increases. When the coefficient of the desired state is less than 1, the Fidelity(p) decreases with the increasing of P(p).

5. Comparison and Conclusions

Efficiency [39] is a main factor utilizing for weighing the superiority of RSP protocol. In comparison with the other cyclic RSP schemes, we calculate the scheme’s efficiency( η ) with the following manner.
η = q i q s + q c ,
where q i denotes the number of states to be transmitted, q s indicates the quantum resource consumption, and q c means the classical resource consumption.
From Table 3, the following conclusions can be drawn:
(1) The efficiency of our scheme is 32%, which is relatively higher than those of the schemes in [16,23,24,25,30,32]. Besides, our scheme has a larger transmission capacity than the other schemes because the sequentially increasing qubits could carry more information via the transmission in the scheme.
(2) Due to the influence of the real environment, the initial maximally entangled state easily evolves into a non-maximally entangled state or a mixed state. Compared with the [25], we employ a ten-qubit non-maximally entangled state as quantum channel which is more realistic than the maximally entangled state.
(3) In comparison with [25], we increase the number of states to be transmitted in the four-party cyclic remote preparation scheme of an arbitrary single-particle state, an arbitrary two-qubit state and an arbitrary three-qubit state, which is more efficient and realistic.
(4) Another remarkable advantage of our scheme is that the protocol can be employed to send multiple quantum information among multiple players either in an asymmetric manner. Compared with [16,23,24,25,30,32], our scheme can realize the system having N > 3 observers. When the value of N is specified, we can construct anyone of all possible quantum channels.
In this paper, the most significant innovation of the proposed scheme is reflected in realizing the remote state preparation with sequentially increasing qubits among multi-party, which is not only cyclically asymmetric but also bidirectional. We introduce a specific case of our scheme concretely, namely, the four-party controlled cyclic asymmetrical RSP protocol. Then the four-party controlled cyclic asymmetrical RSP protocol is demonstrated on the IBM quantum computer by designing appropriate quantum circuits using single-qubit and two-qubit quantum gates. The desired quantum states are reconstructed by adopting appropriate unitary transformations with a success probability of 100%. Furthermore, arbitrary qubit transmission channels with different circulation directions are designed and constructed. Considering the mutual coupling between the open quantum system and the environment, the feasibility of the scheme under different noise environments is analyzed respectively.
In our subsequent research, we will consider a case where the input state is a mixed state and the output state is also a mixed state. Besides, the phase transition between the output state and the input state in the scheme can be discussed by simulating it in IBM Quantum Experience.

Author Contributions

Conceptualization, N.Z. and T.W.; methodology, N.Z. and T.W.; software, T.W. and Y.Y.; validation, N.Z., T.W. and Y.Y.; formal analysis, Y.Y. and C.P.; resources, T.W.; data curation, N.Z. and T.W.; Formula derivation and calculation, T.W. and N.Z.; writing—original draft preparation, N.Z. and T.W.; writing—review and editing, N.Z., T.W. and Y.Y.; visualization, N.Z. and T.W.; supervision, C.P.; project administration, N.Z. and C.P.; funding acquisition, N.Z. and C.P. All authors have read and agreed to the published version of the manuscript.

Funding

This work was funded by the Shannxi Key Industrial Innovation China Project in Industrial Domain (Grant No. 2019ZDLGY09-03, No. 2020ZDLGY15-09), the National Natural Science Foundation of China (Grants No. 61771296, No. 61372076, No. 61301171), the Natural Science Foundation of Shaanxi province (Grant No. 2018JM60-53, No. 2018JZ60-06), the 111 Project under Grant B08038.

Acknowledgments

We wish to express their appreciation to the reviewers for their helpful suggestions which greatly improved the presentation of this paper.

Conflicts of Interest

The authors declares that there is no conflict of interest with this article. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.

References

  1. Aspect, A.; Dalibard, J.; Roger, G. Experimental realization of einstein-podolsky-rosen-bohm gedankenexperiment: A new violation of bell’s inequalities. Phys. Rev. Lett. 1982, 49, 91–94. [Google Scholar] [CrossRef] [Green Version]
  2. 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-rosen channels. Phys. Rev. Lett. 1993, 70, 13–29. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  3. 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] [Green Version]
  4. Pati, K.A. Minimum classical bit for remote preparation and measurement of a qubit. Phys. Rev. A 2000, 63, 94–98. [Google Scholar] [CrossRef] [Green Version]
  5. 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] [Green Version]
  6. Moreno, M.G.M.; Cunha, M.M.; Parisio, F. Remote preparation of w states from imperfect bipartite sources. Quantum Inf. Process. 2016, 15, 3869–3879. [Google Scholar] [CrossRef] [Green Version]
  7. Devetak, I.; Berger, T. Low-entanglement remote state preparation. Phys. Rev. Lett. 2001, 87, 197901. [Google Scholar] [CrossRef] [Green Version]
  8. Ma, S.; Gao, C.; Zhang, P.; Qu, Z.G. Deterministic remote preparation via the Brown state. Quantum Inf. Process. 2017, 16, 1–22. [Google Scholar] [CrossRef]
  9. Leung, D.W.; Shor, P.W. Oblivious remote state preparation. Phys. Rev. Lett. 2003, 90, 127905. [Google Scholar] [CrossRef] [Green Version]
  10. Xiang, G.; Li, J.; Guo, G.C. Remote State Preparation and Operation for Photons. Photonics Asia 2004 Inf. Process. Data Storage 2004, 5631, 13. [Google Scholar]
  11. Zhan, Y.-B. Remote State Preparation of a Greenberger-Horne-Zeilinger Class State. Commun. Theor. Phys. 2005, 43, 637–640. [Google Scholar]
  12. Wang, Z.-Y.; Liu, Y.-M.; Zuo, X.-Q.; Zhang, Z.-J. Controlled Remote State Preparation. Commun. Theor. Phys. 2009, 52, 235–240. [Google Scholar]
  13. 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] [Green Version]
  14. Peng, J.-Y.; Bai, M.-Q.; Mo, Z.-W. Bidirectional controlled joint remote state preparation. Quantum Inf. Process. 2015, 14, 4263–4278. [Google Scholar] [CrossRef]
  15. Choudhury, B.S.; Samanta, S. An optional remote state preparation protocol for a four-qubit entangled state. Quantum Inf. Process. 2019, 18, 118. [Google Scholar] [CrossRef]
  16. Chen, H.B.; Fu, H.; Li, X.W.; Ma, P.C.; Zhan, Y.B. Economic scheme for remote preparation of an arbitrary five-qubit brown-type state. Pramana 2016, 86, 783–788. [Google Scholar] [CrossRef]
  17. Ding, M.X.; Jiang, M.; Liu, Y.H. Deterministic joint remote preparation of an arbitrary six-qubit cluster-type state. Opt. Int. J. Light Electron Opt. 2016, 127, 10681–10686. [Google Scholar] [CrossRef]
  18. Choudhury, B.S.; Samanta, S. Perfect joint remote state preparation of arbitrary six-qubit cluster-type states. Quantum Inf. Process. 2018, 17, 1–12. [Google Scholar] [CrossRef]
  19. Fang, S.; Jiang, M. A Novel Scheme for Bidirectional and Hybrid Quantum Information Transmission via a Seven-Qubit State. Int. J. Theor. Phys. 2018, 57, 523–532. [Google Scholar] [CrossRef]
  20. Wu, H.; Zha, X.-W.; Yang, Y.-Q. Controlled Bidirectional Hybrid of Remote State Preparation and Quantum Teleportation via Seven-Qubit Entangled State. Int. J. Theor. Phys. 2018, 57, 28–35. [Google Scholar] [CrossRef]
  21. Cao, L.Y.; Jiang, M.; Chen, C. Joint remote state preparation of an arbitrary eight-qubit cluster-type state. Pramana 2020, 94, 41. [Google Scholar] [CrossRef]
  22. Jiang, S.-X.; Zhou, R.-G.; Xu, R.; Luo, G. Cyclic Hybrid Double-channel Quantum Communication Via Bell-state and Ghz-state In Noisy Environments. IEEE Access 2019, 7, 80530–80541. [Google Scholar] [CrossRef]
  23. Wang, M.; Yang, C.; Mousoli, R. Controlled cyclic remote state preparation of arbitrary qubit states. Comput. Mater. Contin. 2018, 55, 321–329. [Google Scholar] [CrossRef]
  24. Li, Y.; Qiao, Y.; Sang, M.; Nie, Y. Bidirectional Controlled Remote State Preparation of an Arbitrary Two-Qubit State. Int. J. Theor. Phys. 2019, 58, 2228–2234. [Google Scholar] [CrossRef]
  25. Sang, Z. Cyclic Controlled Joint Remote State Preparation by Using a Ten-Qubit Entangled State. Int. J. Theor. Phys. 2019, 58, 255–260. [Google Scholar] [CrossRef]
  26. Sun, L.; Wu, S.; Qu, Z.; Wang, M.; Wang, X. The effect of quantum noise on two different deterministic remote state preparation of an arbitrary three-particle state protocols. Quantum Inf. Process. 2018, 17, 1–18. [Google Scholar] [CrossRef]
  27. Espoukeh, P.; Pedram, P. Quantum teleportation through noisy channels with multi-qubit GHZ states. Quantum Inf. Process. 2014, 13, 1789–1811. [Google Scholar] [CrossRef] [Green Version]
  28. Sharma, V.; Shukla, C.; Banerjee, S.; Pathak, A. Controlled bidirectional remote state preparation in noisy environment: A generalized view. Quantum Inf. Process. 2015, 14, 3441–3464. [Google Scholar] [CrossRef] [Green Version]
  29. Zhao, H.; Huang, L. Effects of Noise on Joint Remote State Preparation of an Arbitrary Equatorial Two-Qubit State. Int. J. Theor. Phys. 2017, 56, 720–728. [Google Scholar] [CrossRef]
  30. Sun, Y.-R.; Xu, G.; Chen, X.-B.; Yang, Y.; Yang, Y.-X. Asymmetric Controlled Bidirectional Remote Preparation of Single- and Three-Qubit Equatorial State in Noisy Environment. IEEE Access 2019, 7, 2811–2822. [Google Scholar] [CrossRef]
  31. Dash, T.; Sk, R.; Panigrahi, P.K. Deterministic joint remote state preparation of arbitrary two-qubit state through noisy cluster-GHZ channel. Opt. Commun. 2020, 464. [Google Scholar] [CrossRef]
  32. Wei, S.J.; Xin, T.; Long, G.L. Efficient universal quantum channel simulation in IBM’s cloud quantum computer. Sci. China (Phys. Mech. Astron.) 2018, 7, 48–57. [Google Scholar]
  33. Sisodia, M.; Shukla, A.; Pathak, A. Experimental realization of nondestructive discrimination of Bell states using a five-qubit quantum computer. Phys. Lett. A 2017, 381, 3860–3874. [Google Scholar] [CrossRef] [Green Version]
  34. Rajiuddin, S.; Baishya, A.; Behera, B.K.; Panigrahi, P.K. Experimental realization of quantum teleportation of an arbitrary two-qubit state using a four-qubit cluster state. Quantum Inf. Process. 2020, 19, 87. [Google Scholar] [CrossRef]
  35. Kalra, A.R.; Gupta, N.; Behera, B.K.; Prakash, S.; Panigrahi, P.K. Demonstration of the no-hiding theorem on the 5-Qubit IBM quantum computer in a category-theoretic framework. Quantum Inf. Process. 2019, 18, 1–13. [Google Scholar] [CrossRef] [Green Version]
  36. Joschka, R.; David, H.; Nicholas, C.; Dominic, H.; Viv, K. Protecting quantum memories using coherent parity check codes. Quantum Sci. Technol. 2018, 3, 035010. [Google Scholar]
  37. Alvarez-Rodriguez, U.; Sanz, M.; Lamata, L.; Solano, E. Quantum artificial life in an ibm quantum computer. Sci. Rep. 2018, 8, 14793. [Google Scholar] [CrossRef]
  38. Zhang, C.; Bai, M.; Zhou, S. Cyclic joint remote state preparation in noisy environment. Quantum Inf. Process. 2018, 17, 1–20. [Google Scholar] [CrossRef]
  39. Banerjee, A.; Pathak, A. Maximally efficient protocols for direct secure quantum communication. Phys. Lett. A 2012, 376, 2944–2950. [Google Scholar] [CrossRef]
Figure 1. The schematic of the four-party cyclic asymmetric remote state preparation (RSP) protocol. The black arrow points out the direction of the communications and the dashed line represents the control information.
Figure 1. The schematic of the four-party cyclic asymmetric remote state preparation (RSP) protocol. The black arrow points out the direction of the communications and the dashed line represents the control information.
Applsci 11 01405 g001
Figure 2. The construction of the target channel. (a) Quantum circuit illustrating the construction of target channel. (b) The histogram shows theoretical and experimental results of the quantum state’s mean probability distribution. The x-axis of this histogram is arranged in the order of ( c , b , 2 , 1 ) from the bottom to the top, showing the average probability and percentage error of each state in the target channel of 13 qubits.
Figure 2. The construction of the target channel. (a) Quantum circuit illustrating the construction of target channel. (b) The histogram shows theoretical and experimental results of the quantum state’s mean probability distribution. The x-axis of this histogram is arranged in the order of ( c , b , 2 , 1 ) from the bottom to the top, showing the average probability and percentage error of each state in the target channel of 13 qubits.
Applsci 11 01405 g002
Figure 3. Diagram of four-party controlled cyclic asymmetrical RSP protocol, where SM is short for single-qubit measurement.
Figure 3. Diagram of four-party controlled cyclic asymmetrical RSP protocol, where SM is short for single-qubit measurement.
Applsci 11 01405 g003
Figure 4. Quantum circuit illustrating four-party controlled cyclic asymmetrical RSP protocol.
Figure 4. Quantum circuit illustrating four-party controlled cyclic asymmetrical RSP protocol.
Applsci 11 01405 g004
Figure 5. Histogram of output results. (a) Histogram of output results after running once in the ’ibmq_qasm_simulator’ quantum processor. The x-axis of this histogram is arranged in the order of ( 8 , 2 , 1 ) from the bottom to the top. (b) Histogram of output results after running ten times in Jupyter Notebook. The x-axis of this histogram is arranged in the order of ( c , b , 2 , 1 ) from the bottom to the top.
Figure 5. Histogram of output results. (a) Histogram of output results after running once in the ’ibmq_qasm_simulator’ quantum processor. The x-axis of this histogram is arranged in the order of ( 8 , 2 , 1 ) from the bottom to the top. (b) Histogram of output results after running ten times in Jupyter Notebook. The x-axis of this histogram is arranged in the order of ( c , b , 2 , 1 ) from the bottom to the top.
Applsci 11 01405 g005
Figure 6. The trend of the fidelity of the output state with the change of the decoherence rate(P) in four types of noisy environments, where different types of lines represent different noise environments. Suppose the coefficient of the desired state a 0 = a 1 = b 0 = b 1 = c 0 = c 1 = 1 2 .
Figure 6. The trend of the fidelity of the output state with the change of the decoherence rate(P) in four types of noisy environments, where different types of lines represent different noise environments. Suppose the coefficient of the desired state a 0 = a 1 = b 0 = b 1 = c 0 = c 1 = 1 2 .
Applsci 11 01405 g006
Figure 7. The variations of the fidelity in different noise with different coefficients of the initiated state and decoherence rate, where P(D) is short for the decoherence rate of the depolarized noise, P(A) is short for the decoherence rate of the Amplitude damping noise, P(p) is short for the decoherence rate of the phase damping noise, P(S) is short for the decoherence rate of the bit-phase flip noise. Suppose the coefficient of the desired state is a 0 = a 1 = b 0 = b 1 = c 0 = c 1 [ 0 , 1 ] .
Figure 7. The variations of the fidelity in different noise with different coefficients of the initiated state and decoherence rate, where P(D) is short for the decoherence rate of the depolarized noise, P(A) is short for the decoherence rate of the Amplitude damping noise, P(p) is short for the decoherence rate of the phase damping noise, P(S) is short for the decoherence rate of the bit-phase flip noise. Suppose the coefficient of the desired state is a 0 = a 1 = b 0 = b 1 = c 0 = c 1 [ 0 , 1 ] .
Applsci 11 01405 g007
Table 1. Joint collapsed states of some cases and reconstructed unitary transformation.
Table 1. Joint collapsed states of some cases and reconstructed unitary transformation.
SPM1(A)SPM1(B)SPM1(C)SPM2(A)SPM2(B)SPM2(C)SPM(D)   Transformations   
                     AliceBobCharlie
Φ + 9 Φ + 5 Φ + 1 Ψ + a Ψ + b Ψ + c 0 10 I 234 I 8 I 67
                   1 10 σ z 2 σ x 34 i σ y 8 i σ y 6 σ x 7
Φ + 9 Φ + 5 Φ + 1 Ψ a Ψ b Ψ c 0 10 σ z 234 σ z 8 σ z 67
                   1 10 I 2 σ x 34 σ x 8 σ x 67
Φ 9 Φ 5 Φ 1 Ψ + a Ψ + b Ψ + c 0 10 i σ y 2 σ x 34 i σ y 8 i σ y 6 σ x 7
                   1 10 σ x 2 I 34 I 8 I 6 7
Φ 9 Φ 5 Φ 1 Ψ a Ψ b Ψ c 0 10 σ x 234 σ x 8 σ x 67
                   1 10 σ x 2 σ z 2 I 34 σ z 8 σ z 67 .
Table 2. Data analysis of the output state, where A is short for the average value, S is for standard deviation.
Table 2. Data analysis of the output state, where A is short for the average value, S is for standard deviation.
Runs 000000 234678 000001 234678 000110 234678 000111 234678 111000 234678 111001 234678 111110 234678 111111 234678
10.1250.1170.1260.1180.1180.1380.1300.128
20.1320.1250.1220.1210.1290.1310.1190.121
30.1200.1280.1240.1270.1290.1180.1260.127
40.1250.1230.1300.1270.1230.1270.1200,125
50.1320.1230.1290.1220.1240.1180.1250.127
60.1280.1290.1220.1250.1240.1220.1290.121
70.1240.1260.1240.1290.1220.1190.1320.123
80.1210.1210.1230.1300.1270.1260.1240.127
90.1200.1310.1220.1290.1210.1250.1200.132
100.1230.1300.1260.1250.1250.1240.1240.124
A0.1250.12530.12480.12530.12420.12480.12490.1255
S0.00440.00440.00290.00390.00350.00630.00450.0039
Table 3. Comparison with other RSP schemes, where BSM is short for Bell-state measurement and SM for single-qubit measurement.
Table 3. Comparison with other RSP schemes, where BSM is short for Bell-state measurement and SM for single-qubit measurement.
SchemeType q i q s q c OperationEfficiency
[25]CCJRSP3 (three arbitrary single-qubit)1067 SM19%
[32]CJRSP3 (three arbitrary single-qubit)996 SM17%
[30] CCJRSP2 (An arbitrary two-qubit state)755 SM17%
[24] CBRSP4(Two arbitrary two-qubit )989 SM24%
[16]CBRSP and QT2 (two arbitrary single-qubit)741 BSM,3 SM18%
[23]CCRSP3 (three arbitrary single-qubit)766 SM23%
OursCCARSP6(A single-qubit, a two-qubit, a three-qubit)1367 SM32%
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Zhao, N.; Wu, T.; Yu, Y.; Pei, C. A Scheme for Controlled Cyclic Asymmetric Remote State Preparation in Noisy Environment. Appl. Sci. 2021, 11, 1405. https://doi.org/10.3390/app11041405

AMA Style

Zhao N, Wu T, Yu Y, Pei C. A Scheme for Controlled Cyclic Asymmetric Remote State Preparation in Noisy Environment. Applied Sciences. 2021; 11(4):1405. https://doi.org/10.3390/app11041405

Chicago/Turabian Style

Zhao, Nan, Tingting Wu, Yan Yu, and Changxing Pei. 2021. "A Scheme for Controlled Cyclic Asymmetric Remote State Preparation in Noisy Environment" Applied Sciences 11, no. 4: 1405. https://doi.org/10.3390/app11041405

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