Next Article in Journal
Modeling Diffusion of Elongated Particles Through a Narrowing Channel
Next Article in Special Issue
A Consistent Approach to Modeling Quantum Observers
Previous Article in Journal
The Statistical Thermodynamics of Generative Diffusion Models: Phase Transitions, Symmetry Breaking, and Critical Instability
Previous Article in Special Issue
Enhanced Coexistence of Quantum Key Distribution and Classical Communication over Hollow-Core and Multi-Core Fibers
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Controlled Double-Direction Cyclic Quantum Communication of Arbitrary Two-Particle States

1
School of Mathematics and Statistics, Kashi University, Kashi 844000, China
2
The School of Mathematics and Statistics, Yili Normal University, Yili 835000, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Entropy 2025, 27(3), 292; https://doi.org/10.3390/e27030292
Submission received: 28 January 2025 / Revised: 6 March 2025 / Accepted: 8 March 2025 / Published: 11 March 2025
(This article belongs to the Special Issue Classical and Quantum Networks: Theory, Modeling and Optimization)

Abstract

With the rapid development of quantum communication technologies, controlled double-direction cyclic (CDDC) quantum communication has become an important research direction. However, how to choose an appropriate quantum state as a channel to achieve double-direction cyclic (DDC) quantum communication for multi-particle entangled states remains an unresolved challenge. This study aims to address this issue by constructing a suitable quantum channel and investigating the DDC quantum communication of two-particle states. Initially, we create a 25-particle entangled state using Hadamard and controlled-NOT (CNOT) gates, and provide its corresponding quantum circuit implementation. Based on this entangled state as a quantum channel, we propose two new four-party CDDC schemes, applied to quantum teleportation (QT) and remote state preparation (RSP), respectively. In both schemes, each communicating party can synchronously transmit two different arbitrary two-particle states to the other parties under supervisory control, achieving controlled quantum cyclic communication in both clockwise and counterclockwise directions. Additionally, the presented two schemes of four-party CDDC quantum communication are extended to situations where n > 3 communicating parties. In each proposed scheme, we provide universal analytical formulas for the local operations of the sender, supervisor, and receiver, demonstrating that the success probability of each scheme can reach 100%. These schemes only require specific two-particle projective measurements, single-particle von Neumann measurements, and Pauli gate operations, all of which can be implemented with current technologies. We have also evaluated the inherent efficiency, security, and control capabilities of the proposed schemes. In comparison to earlier methods, the results demonstrate that our schemes perform exceptionally well. This study provides a theoretical foundation for bidirectional controlled quantum communication of multi-particle states, aiming to enhance security and capacity while meeting the diverse needs of future network scenarios.

1. Introduction

Quantum entanglement is essential for quantum communication, as it reveals non-local correlations between distant subsystems. QT and RSP are prime examples of quantum entanglement applications, both involving the transfer of quantum states between locations without the actual physical travel of the particles involved. QT was introduced by Bennett et al. [1] in 1993. It allows for the secure teleportation of any arbitrary unknown single-particle state from one location to another using pre-shared entanglement between two parties as the quantum channel, with the support of classical communication. Since then, various QT protocols have been proposed, such as controlled QT [2,3,4], bidirectional QT [5,6], controlled bidirectional QT [7,8], cyclic QT [9,10], and controlled cyclic QT [11,12,13], each enhancing aspects like security or communication capacity. Additionally, in 2000, Lo [14] introduced RSP, which can be viewed as a form of QT. Unlike QT, the prepared single- or multi-particle state does not need to be owned or measured by the transmitter. Instead, its coefficients are completely known to the transmitter, but not to the recipient at all. Therefore, RSP consumes less classical resources at the cost of the target state being completely transparent to the sender. Since its introduction, RSP has garnered significant attention, leading to the development of various enhanced RSP protocols, such as multicast-based multiparty RSP [15], controlled RSP [16,17], joint RSP [18,19,20,21,22], controlled joint RSP [23], and bidirectional controlled RSP [24,25,26,27], among others. However, these protocols are limited to one-way or two-way communication only.
In recent years, the development of quantum networks has brought new challenges and opportunities to the study of quantum communication. Quantum networks are regarded as a core infrastructure for achieving distributed quantum computing, ultra-secure communication, and high-precision quantum sensing. They are also an essential component of the future quantum internet [28,29,30]. Kimble first proposed the concept of the quantum internet in 2008 [28], emphasizing that quantum networks can enable global quantum information processing through entanglement distribution. With the continuous progress of technology, significant advancements have been made in the capacity of quantum networks [29], the computational efficiency of nonlinear Bell inequalities [30], and the feasibility of quantum repeaters [31]. These studies not only provide important theoretical and technical support for the design of quantum communication protocols but also highlight the pivotal role of quantum networks in the future of quantum information technology [32,33].
To address the demand for multiparty quantum communication in quantum networks, Chen et al. [34] proposed a novel cyclic QT scheme in 2017. This scheme utilizes a six-particle entangled state as the quantum channel to facilitate single-particle state transmission among multiple participants. Specifically, in this protocol, Alice teleports a single-particle state to Bob, Bob transmits a single-particle state to Charlie, and Charlie simultaneously conveys a single-particle state back to Alice, forming a closed cyclic communication loop. This scheme was further extended to scenarios involving n ( n > 3 ) participants, offering a flexible solution for multiparty quantum communication in quantum networks. Peng et al. [13] expanded on Chen’s work, introducing a framework for cyclic controlled QT where each participant, with the supervisor’s permission, teleports a state to neighbors. This led to the development of cyclic quantum communication protocols like controlled cyclic QT [35,36] and cyclic (controlled) RSP [37,38,39,40]. These protocols, while considering cyclic transmission in both directions, have a limitation: adjacent participants cannot exchange their quantum states, which may not fit real-world applications. More recently, Jiang et al. [41] proposed a hybrid dual-channel protocol, allowing communicators to transmit both known and unknown single-particle states to two others using RSP and QT, respectively. This protocol supports both cyclic RSP and QT communication in both directions, enhancing flexibility. Additionally, from a different viewpoint, adjacent communicators are able to swap their quantum states, which could significantly enhance the functionality of future quantum communication networks. Building on this, Sun and Zhang [42] introduced a DDC controlled RSP protocol for single-particle states, inspired by the single-particle quantum multicast concept, using a thirteen-particle entangled state as the quantum channel. The following year, they extended this idea by proposing a four-party scheme for implementing DDC controlled RSP for arbitrary two-particle states [43]. In this scheme, with the supervisor’s approval, each communicator can assist the other two communicators in preparing their respective two-particle target states simultaneously. In 2023, Peng et al. [44] further advanced the field by proposing a DDC controlled quantum communication scheme for single-particle states.
Although the existing studies have laid a solid foundation for multiparty quantum communication, further exploration of more efficient and flexible quantum resources and protocols is still needed to meet the increasingly complex and diverse demands of future quantum networks. To address this challenge, this paper proposes a scheme for constructing a 25-particle entangled state using Hadamard and CNOT gates as the quantum channel. Based on this entangled state, we designed DDC controlled QT and RSP protocols for arbitrary two-particle states. In the four-party scenario, the proposed protocol allows each communicator to simultaneously transmit two different two-particle states to the other two communicators, achieving cyclic communication in both clockwise and counterclockwise directions, significantly enhancing the flexibility and applicability of the quantum communication protocol. Moreover, the proposed protocol achieves a 100% success rate, with the required operations consisting only of two-particle projective measurements, single-particle von Neumann measurements, and Pauli gates, all of which can be implemented with current quantum technologies, ensuring experimental feasibility. We further extend the four-party protocol to an ( n + 1 ) -party scenario ( n > 3 ) and propose a new method for constructing an ( 8 n + 1 ) -particle entangled state to meet the demands of multiparty communication in large-scale quantum networks. While Peng et al. have already proposed a quantum channel and circuit design for single-particle states, the complexity and technical requirements increase significantly when extending the protocol to two-particle states. Compared to previous research, our work breaks through the limitations of single-particle states and is the first to apply the DDC quantum communication protocol to two-particle states. By constructing a new quantum channel, we successfully overcome the technical bottlenecks in two-particle state cyclic communication and propose a more efficient and scalable quantum communication model. This innovation not only expands the types of particles and transmission modes in quantum communication but also provides a solid theoretical foundation for the implementation of multi-particle quantum communication. Additionally, we provide more precise and practical mathematical formulas, offering important theoretical support for future research in multi-particle quantum communication. We also analyze the efficiency, security, and control capabilities of the scheme, and enhance the stability and flexibility of communication by optimizing multiparty control mechanisms. This offers solid support for the practical implementation and use of quantum communication networks. The results of this research will promote the widespread application of quantum communication technologies in large-scale quantum networks, further advancing the field of quantum information science.
The rest of this article is structured as follows. In Section 2, we suggest a method for constructing a multi-particle quantum channel using a 25-particle entangled state as an example, provide the detailed steps for implementing a four-party DDC controlled QT scheme of arbitrary unknown two-particle states, and extend this transmission scheme to ( n + 1 ) -party ( n > 3 ) via an ( 8 n + 1 ) -particle entangled state as the quantum channel. Section 3 describes the four-party DDC controlled RSP scheme by introducing auxiliary 12 particles, and promotes it to the scenario with n ( n > 3 ) communicators. Finally, conclusions are discussed and drawn in Section 4.

2. Double-Direction Cyclic Controlled Quantum Teleportation of Arbitrary Two-Particle States

We introduce a four-party DDC-controlled QT scheme with three communicators—Alice, Bob, and Charlie—and a supervisor, David.With the supervisor’s approval, each communicator can simultaneously teleport two distinct unknown two-particle states to the other communicators, while also receiving two unknown two-particle states from them. This setup allows for cyclic controlled QT in both clockwise and counterclockwise directions. Figure 1 illustrates the relationships among the three communicators and the controller, emphasizing the quantum states being teleported and the transmission of control information.
The detailed description of this scheme is provided in Section 2.2, and we extend the scheme to a general case involving multiple communicators, with the specific protocol and corresponding quantum circuit diagram presented in Section 2.3. To implement the proposed scheme, a 25-particle entangled state is required as the quantum channel, and the specific steps for constructing this quantum channel are detailed in Section 2.1.

2.1. Construction of the Quantum Channel

To implement the four-party DDC controlled QT scheme, we begin by constructing a 25-particle maximally entangled state to serve as the quantum channel. In Yu’s protocol [15], an eight-particle maximally entangled state, denoted as | φ 1 8 , is used for the quantum multicast of two-particle states. Building on this eight-particle maximally entangled state, we extend it to a 25-particle maximally entangled state to fulfil the requirements for four-party controlled QT. Specifically, the quantum channel state is expressed as
| G 1 , 2 , , 25 = 1 2 ( | φ 1 8 12 8 | φ 1 8 9 , 10 , , 16 | φ 1 8 17 , 18 , , 24 | 0 25 + | φ 2 8 12 8 | φ 2 8 9 , 10 , , 16 | φ 2 8 17 , 18 , , 24 | 1 25 ) ,
where | φ 1 8 and | φ 2 8 are the eight-particle maximally entangled states, the explicit forms of which are provided in Appendix A as Equations (A1) and (A2).
Figure 2 shows the quantum circuit used to create the 25-particle maximally entangled state.
The Hadamard gate H and the C N O T gate are represented by the following matrices:
H = 1 2 1 1 1 1 , C N O T = 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 .
We begin by preparing the 25-particle maximally entangled state from the initial state, where all qubits are in the | 0 state. The first step is to apply a Hadamard gate H to the 25th qubit, which changes its state from | 0 to a superposition state of 1 2 ( | 0 + | 1 ) . The quantum state at this stage is
| G 1 1 , 2 , , 25 = | 00 0 1 , 2 , , 24 1 2 ( | 0 + | 1 ) 25 .
Next, we apply 24 C N O T gates, where the 25th qubit serves as the control qubit and the remaining 24 qubits serve as the target qubits. Each C N O T gate entangles the 25th qubit with the corresponding target qubit. After these operations, the final quantum state becomes
| G 2 1 , 2 , , 25 = 1 2 ( | 00 0 + | 11 1 ) 1 , 2 , , 25 .
Subsequently, we proceed with a series of transformations. First, particle 1 passes through a Hadamard gate, followed by a CNOT operation with particle 1 as the control and particle 5 as the target. Then, particle 2 undergoes a Hadamard gate, and a CNOT operation is performed with particle 1 as the control and particle 6 as the target. Particle 3 is next processed with a Hadamard gate, followed by a CNOT operation with particle 3 as the control and particle 7 as the target. Another CNOT operation is applied with particle 3 as the control and particle 4 as the target. Lastly, particle 4 is subjected to a Hadamard gate, and a CNOT operation is performed with particle 4 as the control and particle 8 as the target.
Similarly, we apply the same set of transformations to particles ( 9 , 10 , , 16 ) and ( 17 , 18 , , 24 ) . After all these steps, the 25-particle maximally entangled channel, as shown in Equation (1), is fully constructed.
This construction process provides us with a general method for preparing multi-particle entangled states. Using this method, we can construct a maximally entangled state for any number of particles of the form ( 8 n + 1 ) .

2.2. Four-Party DDC Controlled Quantum Teleportation Protocol

In this subsection, we provide a detailed description of the four-party DDC controlled QT protocol, using the 25-particle entangled state constructed in Section 2.1 as the quantum channel. As illustrated in Figure 1, The protocol involves four participants: Alice, Bob, and Charlie as communicators, and David as the supervisor. Alice intends to send the unknown two-particle state | ϵ 1 A 1 A ^ 1 to Bob and | ϵ 2 A 2 A ^ 2 to Charlie. Bob aims to send | ω 1 B 1 B ^ 1 to Charlie and | ω 2 B 2 B ^ 2 to Alice. Meanwhile, Charlie plans to teleport | λ 1 C 1 C ^ 2 to Alice and | λ 2 C 2 C ^ 2 to Bob, all under the supervision of David. These arbitrary unknown two-particle states can be represented as | ϵ k X k X ^ k = l = 1 4 μ k l | b l X k X ^ k , where k { 1 , 2 } corresponds to the different quantum states transmitted, and X { A , B , C } represents Alice, Bob, or Charlie as the sender. Here, μ k l are the complex coefficients for each quantum state and | b l is the two-particle computational basis, with l { 1 , 2 , 3 , 4 } corresponding to | 00 , | 01 , | 10 , | 11 . The coefficients μ k l , ν k l , and γ k l (for k { 1 , 2 } , l { 1 , 2 , 3 , 4 } ) satisfy the normalization conditions l = 1 4 | μ k l | 2 = 1 , l = 1 4 | ν k l | 2 = 1 , and l = 1 4 | γ k l | 2 = 1 , ensuring the proper normalization of the quantum states involved. This generalized expression unifies the representation of all the quantum states used in the protocol, eliminating redundancy while keeping the clarity of the different states exchanged between Alice, Bob, and Charlie under the supervisor’s control.
In the preparation phase, the supervisor David needs to prepare a 25-particle maximally entangled state as depicted in Equation (1), then should retain particle 25 for himself and allocate particles ( 1 , 2 , 3 , 4 , 15 , 16 , 21 , 22 ) , ( 5 , 6 , 9 , 10 , 11 , 12 , 23 , 24 ) and ( 7 , 8 , 13 , 14 , 17 , 18 , 19 , 20 ) to Alice, Bob, and Charlie, respectively. This way, David, Alice, Bob, and Charlie share an entangled quantum system, each participant holding a distinct set of particles. The entangled state | G that describes this system is written as a superposition of two terms. Each term consists of the product of three maximally entangled 8-particle states, one for each of Alice, Bob, and Charlie. In the first term, David’s qubit is in the state | 0 , while in the second term, David’s qubit is in the state | 1 . Thus, the entire initial quantum system, combining the individual states | ϵ 1 , | ϵ 2 , | ω 1 , | ω 2 , | λ 1 , and | λ 2 , is described by the following expression:
| T = | ϵ 1 A 1 A ^ 1 | ϵ 2 A 2 A ^ 2 | ω 1 B 1 B ^ 1 | ω 2 B 2 B ^ 2 | λ 1 C 1 C ^ 1 | λ 2 C 2 C ^ 2 | G A B C D .
where the bold letters A , B , and C represent the sets of particles A 1 A 2 A 8 , B 1 B 2 B 8 , and C 1 C 2 C 8 , respectively.
In order to fulfil DDC controlled QT, our protocol sequentially executes the following steps, as illustrated in Figure 1.
Step 1: Alice, Bob, and Charlie each perform measurements on their respective particle pairs using a Bell-state measurement basis, resulting in the evolution of a complex multipartite quantum entangled state. Alice measures the particle pairs ( A 1 , A 1 ) , ( A ^ 1 , A 2 ) , ( A 2 , A 3 ) , and ( A ^ 2 , A 4 ) with the Bell-state measurement basis | B s t = 1 2 [ | 0 , s + ( 1 ) t | 1 , 1 s ] , where s , t { 0 , 1 } , and ⊕ denotes addition modulo 2. Alice’s measurement results correspond to a superposition of four Bell states, and these measurement outcomes interact with the system’s entanglement, affecting the final state of the system through the complex coefficients x i j . After Alice’s measurement, the particle pairs she holds will transform into the following entangled states: | B f g A 1 A 1 | B h t A ^ 1 A 2 | B u v A 2 A 3 | B p q A ^ 2 A 4 . Each Bell state corresponds to a measurement outcome | f , h , | f , 1 h , | 1 f , h , and | 1 f , 1 h . These outcomes, through the complex coefficients x i j , become entangled with Bob and Charlie’s measurement results, influencing the overall system’s state.
Bob performs Bell-state measurements on the particle pairs ( B 1 , B 1 ) , ( B ^ 1 , B 2 ) , ( B 2 , B 3 ) , and ( B ^ 2 , B 4 ) , the Bell-state basis Bob uses is the same as Alice’s, given by | B s t = 1 2 [ | 0 , s + ( 1 ) t | 1 , 1 s ] . Bob’s measurement outcomes depend on Alice’s measurements, so the Bell states Bob measures will be entangled with Alice’s results. Bob’s measurement results will form new particle pair entangled states, which are expressed as | B f g B 1 B 1 | B h t B ^ 1 B 2 | B u v B 2 B 3 | B p q B ^ 2 B 4 . These measurement outcomes will be entangled with Alice’s and Charlie’s results through the complex coefficients y i j , thereby affecting the overall quantum state of the system.
Charlie also measures his four particle pairs ( C 1 , C 1 ) , ( C ^ 1 , C 2 ) , ( C 2 , C 3 ) , and ( C ^ 2 , C 4 ) , using the same Bell-state basis as Alice and Bob. Charlie’s measurement outcomes will affect the final quantum state of the system through complex coefficients z i j , and these outcomes will become entangled with the results from Alice and Bob. Charlie’s measurement results are expressed as | B f g C 1 C 1 | B h t C ^ 1 C 2 | B u v C 2 C 3 | B p q C ^ 2 C 4 . Through the complex coefficients z i j , these measurement outcomes entangle with Alice’s and Bob’s results, ultimately influencing the overall quantum state of the system.
Through Alice, Bob, and Charlie’s Bell-state measurements, the initial quantum state of the system evolves into a complex tensor product form, consisting of multiple Bell-state measurement outcomes and the entanglement generated by these measurements. The measurement results of each participant become entangled with the results of the others, ultimately forming a complex multipartite quantum entangled state | T , with the explicit form given in Equation (A4) of Appendix A.
Generally, Alice transfers the measurement results | B f g A 1 A 1 | B h t A ^ 1 A 2 and | B u v A 2 A 3 | B p q A ^ 2 A 4 to Bob and Charlie, respectively. Bob notifies Charlie and Alice of his measurement results | B m n B 1 B 1 | B r s B ^ 1 B 2 and | B i j B 2 B 3 | B l k B ^ 2 B 4 , respectively. At the same time, Charlie announces his measurement outcomes A and B to | B m n C 1 C 1 | B r s C ^ 1 C 2 and | B i j C 2 C 3 | B l k C ^ 2 C 4 to Alice and Bob separately. Then, the measured quantum state | T can be expressed in a concise and structured form, with its explicit expression provided in Equation (A5) of Appendix A.
Step 2: If the supervisor, David, agrees to communicate, then he should perform a single-particle Von Neumann measurement on particle D using the computational basis { | 0 , | 1 } . Then, he sends a 1-bit classical message w ( w = 0 , 1 ) to Alice, Bob, and Charlie over three distinct channels (David–Alice, David–Bob, and David–Charlie), corresponding to the measurement result | w D .
Step 3: Upon receiving the measurement results from the other participants, Alice, Bob, and Charlie are required to apply the appropriate unitary operations according to the results of the measurements in order to reconstruct the original quantum state. The unitary operations involved in this process can be represented by the following general expression:
U ( X ) = ( 1 w ) U ( X ) U ^ ( X ) + w U ( X ) U ^ ( X ) ,
where X { A , B , C } represents the different participants Alice, Bob, and Charlie, and its specific form is provided in Equation (A6) of Appendix A. U ( X ) and U ^ ( X ) are the first set of unitary operations corresponding to participant X, and the specific expressions can be found in Equation (A6) of Appendix A. U ( X ) and U ^ ( X ) are the second set of unitary operations corresponding to participant X, and the specific expressions can also be found in Equation (A7) of Appendix A. w is a weighting factor that adjusts the contribution of the first and second sets of operations based on the measurement results received by each participant. These unitary operations are applied to the particle groups ( A 5 , A 6 , A 7 , A 8 ) , ( B 5 , B 6 , B 7 , B 8 ) , and ( C 5 , C 6 , C 7 , C 8 ) , enabling each group to recover their intended original states. In other words,
U ( A ) U ( B ) U ( C ) ( D t | T ) = ( x 11 | 00 + x 12 | 01 + x 13 | 10 + x 14 | 11 ) B 5 B 6 ( z 21 | 00 + z 22 | 01 + z 23 | 10 + z 24 | 11 ) B 7 B 8 ( y 11 | 00 + y 12 | 01 + y 13 | 10 + y 14 | 11 ) C 5 C 6 ( x 21 | 00 + x 22 | 01 + x 23 | 10 + x 24 | 11 ) C 7 C 8 ( z 11 | 00 + z 12 | 01 + z 13 | 10 + z 14 | 11 ) A 5 A 6 ( y 21 | 00 + y 22 | 01 + y 23 | 10 + y 24 | 11 ) A 7 A 8 .
From Equation (7), it can be observed that Alice’s state | ϵ 1 A 1 A ^ 1 has been teleported to Bob, and | ϵ 2 A 2 A ^ 2 to Charlie. Bob’s state | ω 1 B 1 B ^ 1 has been transferred to Charlie, while | ω 2 B 2 B ^ 2 has been sent to Alice. Meanwhile, Charlie’s state | λ 1 C 1 C ^ 1 has been transmitted to Alice, and | λ 2 C 2 C ^ 2 to Bob.
Additionally, according to Equation (A4) in Appendix A, our scheme has 12 Bell-state measurements and 1 single-particle von Neumann measurement, yielding a total of 4 4 × 4 4 × 4 4 × 2 = 33 , 554 , 432 possible measurement outcomes. For each outcome, the unitary transformations in Equation (6) are applied to correctly reconstruct the desired states. As a result, our scheme achieves a success probability of 100%.

2.3. Generalized DDC Controlled Quantum Teleportation Scheme

In this subsection, we extend our four-party scheme of DDC controlled QT to the scene with n ( n > 3 ) communicators in this subsection. Assume the n communicators can be denoted as { N 1 , N 2 , , N n } , and they form a closed ring. All communicators initially share an ( 8 n + 1 ) -particle maximally entangled state together with the supervisor, Tom. This state can be written as
| G N 1 N 2 N n = 1 2 [ j = 1 n | φ 1 8 N j 1 N j 2 N j 3 N j 4 N j + 1 5 N j + 1 6 N j 1 7 N j 1 8 | 0 T + j = 1 n | φ 2 8 N j 1 N j 2 N j 3 N j 4 N j + 1 5 N j + 1 6 N j 1 7 N j 1 8 | 1 T ] ,
where the communicator N j has eight particles ( N j 1 , N j 2 , , N j 8 ) for any j { 1 , 2 , , n } . Additionally, the particle T belongs to the supervisor Tom. For j = n , we impose N n + 1 5 = N 1 5 and N n + 1 6 = N 1 6 , and for j = 1 , we impose N 0 7 = N n 7 and N 0 8 = N n 8 . The symbol ⨂ represents the tensor product, while N 1 , N 2 , and N n denote the groups of particles N 1 1 N 1 2 N 1 8 , N 2 1 N 2 2 N 2 8 , and N n 1 N n 2 N n 8 , respectively. The entangled states | φ 1 8 and | φ 2 8 are defined in Equations (A1) and (A2) of Appendix A, respectively.
Consider that N 1 intends to teleport two arbitrary unknown two-particle states, | ϵ N 1 and | ϵ 2 N 1 , to N 2 and N n , respectively. Each participant N j ( j { 2 , 3 , , n 1 } ) aims to send two arbitrary unknown two-particle states, | ϵ N j and | ϵ 2 N j , to N j + 1 and N j 1 , respectively. Finally, N n intends to transmit the state | ϵ N n to N 1 and | ϵ 2 N n to N n 1 , with the entire process being supervised and controlled by Tom. The relation among these n + 1 participants is shown in Figure 3.
The above 2 n arbitrary unknown two-particle states to be teleported can be expressed as
| ϵ N j = a 11 ( N j ) | 00 + a 12 ( N j ) | 01 + a 13 ( N j ) | 10 + a 14 ( N j ) | 11
where complex coefficients a k 1 ( N j ) , a k 2 ( N j ) , a k 3 ( N j ) , and a k 4 ( N j ) satisfy the normalization condition | a k 1 ( N j ) | 2 + | a k 2 ( N j ) | 2 + | a k 3 ( N j ) | 2 + | a k 4 ( N j ) | 2 = 1 ( k = 1 , 2 ). The second unknown two-particle state, | ϵ 2 N j , can be expressed in terms of the same form as | ϵ N j , with its coefficients denoted as a 21 ( N j ) , a 22 ( N j ) , a 23 ( N j ) , a 24 ( N j ) , which similarly satisfy the normalization condition. Thus, | ϵ 2 N j can be written by replacing a 1 k ( N j ) in | ϵ N j with a 2 k ( N j ) ( k = 1 , 2 , 3 , 4 ) . The complete initial system state can be represented as follows:
| W = j = 1 n | ϵ N j j = 1 n | ϵ 2 N j | G N 1 N 2 N n .
In order to complete DDC controlled QT of arbitrary unknown two-particle states among n + 1 participants, each communicator needs to execute four Bell-state measurements and then inform the two adjacent communicators of the measurement results. After that, the supervisor Tom makes a single-particle projective measurement on his particle T in the basis { | 0 , | 1 } , and relays his measurement outcome to all communicators. According to the outcomes from the two adjacent communicators and the controller, each communicator is able to successfully reconstruct the target two-particle states. For simplicity, we will omit the detailed discussion on the connections between measurement outcomes, collapsed states, and their corresponding recovery operations. Since this extended scheme employs procedures and operations similar to those in the earlier scheme with three communicators and one supervisor, the success probability of our proposed scheme remains 1.

3. DDC Controlled RSP of Arbitrary Two-Particle States

Based on the quantum channel [1] we constructed, this subsection proposes a four-party DDC controlled RSP scheme, which can be used for the preparation of arbitrary two-particle states and further extended to scenarios involving n + 1 ( n > 3 ) participants. As the quantum circuit diagram illustrating the relationships among the four participants is similar to that in Section 2, it is not repeated here.

3.1. Four-Party DDC Controlled RSP Scheme

Assume that Alice wishes to help Bob prepare an arbitrary two-particle state | ϕ 1 remotely and assist Charlie in preparing | ϕ 2 ; Bob intends to aid Charlie remotely with the preparation of | ψ 1 and also help Alice prepare | ψ 2 . At the same time, Charlie plans to help Alice prepare an arbitrary two-particle state | χ 1 remotely and assist Bob in preparing | χ 2 , all under the supervision of David. The six arbitrary two-particle states to be prepared can be written as follows:
| ϕ 1 = l = 1 4 a 1 l e i θ l | b l , | ϕ 2 = l = 1 4 a 2 l e i θ l | b l , | ψ 1 = l = 1 4 b 1 l e i α l | b l , | ψ 2 = l = 1 4 b 2 l e i α l | b l , | χ 1 = l = 1 4 c 1 l e i β l | b l , | χ 2 = l = 1 4 c 2 l e i β l | b l ,
where real numbers a k l , b k l , c k l , θ l , θ l , α l , α l , β l , and β l ( k { 1 , 2 } , l { 1 , 2 , 3 , 4 } ) satisfy the conditions Σ l = 1 4 | a k l | 2 = 1 , Σ l = 1 4 | b k l | 2 = 1 , Σ l = 1 4 | c k l | 2 = 1 , and θ l , θ l , α l , α l , β l , β l [ 0 , 2 π ) . Note that for any k { 1 , 2 } and l { 1 , 2 , 3 , 4 } , Alice is completely aware of coefficients a k l , θ l , and θ l , but Bob and Charlie are not aware of them. Similarly, Bob knows the coefficients b k l , α l , and α l , but Charlie and Alice do not know about them, and the coefficients c k l , β l , and β l are known to Charlie but unknown to Alice and Bob.
Similar to Section 2.2, a 25-particle maximally entangled channel is pre-shared among three communicators—Alice, Bob, and Charlie—and the supervisor David.
To achieve the quantum task of four-party DDC-controlled RSP, the following steps must be performed:
Step 1: Three communicators, Alice, Bob, and Charlie, introduce three auxiliary particles ( A ¯ 1 , A ¯ 2 , A ¯ 3 , A ¯ 4 ) , ( B ¯ 1 , B ¯ 2 , B ¯ 3 , B ¯ 4 ) , and ( C ¯ 1 , C ¯ 2 , C ¯ 3 , C ¯ 4 ) , respectively. In this way, the initial system state of 37 particles can be represented as
| T = | G A B C D | 0000 A ¯ | 0000 B ¯ | 0000 C ¯ ,
where the bold letters A , B , and C represent the sets of particles A 1 A 2 A 8 , B 1 B 2 B 8 , and C 1 C 2 C 8 , respectively. Similarly, A ¯ , B ¯ , and C ¯ represent the sets of particles A ¯ 1 A ¯ 2 A ¯ 3 A ¯ 4 ) , B ¯ 1 B ¯ 2 B ¯ 3 B ¯ 4 , and C ¯ 1 C ¯ 2 C ¯ 3 C ¯ 4 , respectively.
Then, Alice carries out the CNOT operation C X Y on qubit pairs ( A 1 , A ¯ 1 ) , ( A 2 , A ¯ 2 ) , ( A 3 , A ¯ 3 ) , and ( A 4 , A ¯ 4 ) , respectively, where C X Y | u v X Y = | u X | u v Y . That is, qubits A 1 , A 2 , A 3 , A 4 serve as controlling qubits and auxiliary qubits A ¯ 1 , A ¯ 2 , A ¯ 3 , A ¯ 4 function as target qubits. After Bob and Charlie also perform similar operations, the state | T shown in Equation (11) will change to
| T = 1 2 j = 1 3 | φ 1 12 P j | 0 D + 1 2 j = 1 3 | φ 2 12 P j | 1 D ,
where the P 1 , P 2 , P 3 are defined as follows: P 1 = A 1 A 2 A ¯ 1 A ¯ 2 A 3 A 4 A ¯ 3 A ¯ 4 B 5 B 6 C 7 C 8 ,   P 2 = B 1 B 2 B ¯ 1 B ¯ 2 B 3 B 4 B ¯ 3 B ¯ 4 C 5 C 6 A 7 A 8 , and P 3 = C 1 C 2 C ¯ 1 C ¯ 2 C 3 C 4 C ¯ 3 C ¯ 4 A 5 A 6 B 7 B 8 . The detailed forms of | φ 1 12 and | φ 2 12 are provided in Appendix A as Equations (A8) and (A9), respectively. For brevity, their explicit expressions are deferred to the appendix.
Step 2: Alice performs two projective measurements on ( A 1 , A 2 ) and ( A 3 , A 4 ) with the measurement basis { | ϵ u v | u , v = 0 , 1 } and { | ζ p q | p , q = 0 , 1 } , respectively. These measurement bases are defined as weighted combinations of the standard two-qubit basis states ( | 00 , | 01 , | 10 , | 11 ) , where the coefficients and phase factors depend on the measurement indices. For the first type of measurement basis, the general expression is
| ϵ u v = a 1 , 2 u + v + 1 | 00 + ( 1 ) u + v a 1 , 2 u + v + 1 + ( 1 ) v | 01 + ( 1 ) u a 1 , 2 u + v + 1 + 2 ( 1 ) u | 10 + ( 1 ) v a 1 , 4 2 u v | 11 ,
where u , v { 0 , 1 } , and the coefficients a 1 , k are participant-specific weights that determine the contribution of each basis state. Similarly, the second type of measurement basis, denoted as | ζ p q , has a structure analogous to | ϵ u v . The differences lie in the replacement of indices u , v with p , q , and the coefficients a 1 , k are replaced by a 2 , k . Additionally, logical operations such as 1 q and p q modify the relative phases of the basis states.
Bob and Charlie use similar measurement bases. For Bob, the first and second types of bases are denoted as | ϵ u v and | ζ p q , following the same structure but with coefficients b 1 , k and b 2 , k , respectively. Charlie, on the other hand, uses the bases | ϵ u v and | ζ p q , where the coefficients are c 1 , k and c 2 , k . The indices u , v , u , v , u , v , p , q , p , q , p , q { 0 , 1 } represent binary measurement outcomes. These indices determine the specific coefficients and phase factors in the measurement bases, encoding the results of the measurements. After completing the measurements, the results are exchanged among the participants. Alice sends her outcomes | ϵ u v to Bob and | ζ p q to Charlie. Bob shares | ϵ u v with Charlie and | ζ p q with Alice. Similarly, Charlie transfers | ϵ u v to Alice and | ζ p q to Bob.
Step 3: After receiving the measurement results, Alice measures her particle pairs ( A ¯ 1 , A ¯ 2 ) and ( A ¯ 3 , A ¯ 4 ) using a feedforward measurement strategy. For ( A ¯ 1 , A ¯ 2 ) , she constructs the measurement basis { | ω s t ( u v ) | s , t = 0 , 1 } , where each state is expressed as
| ω s t ( u v ) = 1 2 [ e i θ 2 u + v + 1 | 00 + ( 1 ) s + t e i θ 2 u + v + 1 + ( 1 ) v | 01 + ( 1 ) s e i θ 2 u + v + 1 + 2 ( 1 ) u | 10 + ( 1 ) t e i θ 4 2 u v | 11 ] ,
where u , v { 0 , 1 } and s , t { 0 , 1 } . Here, the coefficients e i θ n introduce phase adjustments for each basis state, and the terms ( 1 ) s + t , ( 1 ) s , and ( 1 ) t account for relative phase differences. Similarly, for the second pair of qubits ( A ¯ 3 , A ¯ 4 ) , she constructs the measurement basis { | ς m r ( p q ) | m , r = 0 , 1 } , which follows a similar structure to | ω s t ( u v ) . Specifically, in this case, the indices u , v and s , t are replaced by p , q and m , r , respectively. The corresponding phase factors θ n are adjusted accordingly to reflect the changes in indices. This unified structure ensures symmetry and consistency in the measurement bases for different qubit pairs.
Bob and Charlie follow a similar measurement process to Alice. Bob measures his particle pairs ( B ¯ 1 , B ¯ 2 ) and ( B ¯ 3 , B ¯ 4 ) , constructing the bases { | ω ^ s t ( u v ) | s , t = 0 , 1 } and { | ς ^ m r ( p q ) | m , r = 0 , 1 } , where the structure of the states mirrors Alice’s, but with participant-specific phase parameters α k . Similarly, Charlie measures his particle pairs ( C ¯ 1 , C ¯ 2 ) and ( C ¯ 3 , C ¯ 4 ) using the bases { | ω ¯ s t ( u v ) | s , t = 0 , 1 } and { | ς ¯ m r ( p q ) | m , r = 0 , 1 } , where the phase parameters β k are specific to Charlie. Subsequently, each correspondent of the three correspondents needs to send his/her outcomes to the other two correspondents, respectively. Alice sends her outcomes | ω s t ( u v ) to Bob and | ς m r ( p q ) to Charlie. Bob shares | ω ^ s t ( u v ) with Charlie and | ς ^ m r ( p q ) with Alice. Similarly, Charlie shares | ω ¯ s t ( u v ) to Alice and | ς ¯ m r ( p q ) to Bob. This mutual sharing of measurement outcomes ensures that all three participants can synchronize their operations for the subsequent steps in the protocol.
By applying the six sets of measurement bases described above, the quantum state | T introduced in Equation (12) can be rewritten in a detailed expanded form. The full mathematical expression of | T is provided in Appendix A as Equation (A10).
Step 4: If supervisor David agrees to help the three communicators, he performs a single-particle von Neumann measurement on his particle D in the { | 0 , | 1 } basis.He then informs the communicators of his measurement result, denoted as | d D ( d = 0 , 1 ).
Step 5: After hearing the classic messages corresponding to the measurement results, each of the three communicators needs to perform an appropriate unitary transformation to restore their respective target states. In detail, after receiving Charlie’s measurement result | ϵ u v C 1 C 2 | ω ¯ s t ( u v ) C ¯ 1 C ¯ 2 , Bob’s measurement result | ζ p q B 3 B 4 | ς ^ m r ( p q ) B ¯ 3 B ¯ 4 and David’s measurement result | d D , Alice selects the unitary operation
( 1 d ) [ σ A 5 ( s , s ) σ A 6 ( s t , s t ) ] [ σ A 5 ( u , 0 ) σ A 6 ( u v , u ) ] [ σ A 7 ( m , m ) σ A 8 ( 1 m r , 1 m r ) ] [ σ A 7 ( p q , q ) σ A 8 ( ( p q ) q , p q ) ] + d [ σ A 5 ( 1 s , s ) σ A 6 ( 1 s t , s t ) ] [ σ A 5 ( u , 0 ) σ A 6 ( u v , u ) ] [ σ A 7 m 1 , m ) σ A 8 ( m r , 1 m r ) ] [ σ A 7 ( p q , q ) σ A 8 ( q , 0 ) ]
to reconstruct the original quantum states | χ 1 A 5 A 6 | ψ 2 A 7 A 8 , where σ ( i , j ) = | 0 i j | + ( 1 ) i | 1 1 i j | ( i , j = 0 , 1 ) are Pauli gate operations. After receiving the classical measurement results, Bob and Charlie perform the appropriate unitary transformations to recover their respective target quantum states. The transformation structure for Bob and Charlie is identical to that of Alice. Specifically Bob’s operation can be derived by replacing the parameters A 5 , A 6 , A 7 , A 8 in Alice’s transformation formula with B 5 , B 6 , B 7 , B 8 , and substituting the measurement parameters s , t , u , v , p , q , m , r with s , t , u , v , p , q , m , r . Similarly, Charlie’s operation can be obtained by replacing A 5 , A 6 , A 7 , A 8 with C 5 , C 6 , C 7 , C 8 , and substituting s , t , u , v , p , q , m , r with s , t , u , v , p , q , m , r . Therefore, it is unnecessary to explicitly write out Bob’s and Charlie’s formulas; their operations can be deduced directly from Alice’s formula by applying the appropriate substitutions.
According to the above derivation, it is evident that the four-party DDC controlled RSP of arbitrary two-particle states is always achievable, ensuring that the total success probability of our scheme is 100%.

3.2. Generalized DDC Controlled RSP Scheme

To address the diverse requirements of future quantum communication networks, it is essential to generalize the four-party DDC controlled RSP scheme for arbitrary two-particle states to accommodate n ( n > 3 ) communication parties. Consider n correspondents N 1 , N 2 , , N n , who pre-share an ( 8 n + 1 ) -particle maximally entangled state with the supervisor, Tom, as described in Equation (11). Specifically, each eight-particle group ( N j 1 , N j 2 , , N j 8 ) is assigned to the correspondent N j ( j = 1 , 2 , , n ), while the single particle T is held by Tom. In this scheme, N 1 assists N 2 in remotely preparing an arbitrary two-particle state | φ N 1 1 and helps N n prepare | φ N 1 2 . Similarly, N j ( j = 2 , 3 , , n 1 ) aids N j + 1 in preparing the state | φ N j 1 and N j 1 in preparing | φ N j 2 . Meanwhile, N n assists N 1 in preparing | φ N n 1 and helps N n 1 prepare | φ N n 2 , all under the supervision of Tom. The 2 n arbitrary two-particle states can be mathematically described using the following general form. The first state, | φ N j 1 , for each correspondent N j , is expressed as
| φ N j 1 = a 11 ( j ) e i θ 1 j | 00 + a 12 ( j ) e i θ 2 j | 01 + a 13 ( j ) e i θ 3 j | 10 + a 14 ( j ) e i θ 4 j | 11 ,
where the coefficients a 1 k ( j ) ( k = 1 , 2 , 3 , 4 ) satisfy the normalization condition k = 1 4 | a 1 k ( j ) | 2 = 1 , and the phase parameters θ k j [ 0 , 2 π ) . Similarly, the second state, | φ N j 2 , is represented with the same structure, substituting a 1 k ( j ) with a 2 k ( j ) and θ k j with θ ^ k j .
In order to complete the quantum task, each correspondent N w ( w = 1 , 2 , , n ) introduces four auxiliary particles ( N ^ w 1 , N ^ w 2 , N ^ w 3 , N ^ w 4 ) , initialized in the state | 0000 N ^ w 1 N ^ w 2 N ^ w 3 N ^ w 4 . Subsequently, four CNOT gate operations are performed on the particle pairs ( N w 1 , N ^ w 1 ) , ( N w 2 , N ^ w 2 ) , ( N w 3 , N ^ w 3 ) and ( N w 4 , N ^ w 4 ) , where the particles N w 1 , N w 2 , N w 3 , N w 4 act as control particles, and the auxiliary particles N ^ w 1 , N ^ w 2 , N ^ w 3 , N ^ w 4 serve as targets. After these operations, the entangled channel in Equation (8) transforms into
| H = 1 2 [ j = 1 n | φ 1 12 N j 1 N j 2 N ^ j 1 N ^ j 2 N j 3 N j 4 N ^ j 3 N ^ j 4 N j + 1 5 N j + 1 6 N j 1 7 N j 1 8 | 0 T + j = 1 n | φ 2 12 N j 1 N j 2 N ^ j 1 N ^ j 2 N j 3 N j 4 N ^ j 3 N ^ j 4 N j + 1 5 N j + 1 6 N j 1 7 N j 1 8 | 1 T ] ,
where | φ 1 12 and | φ 2 12 are the same as Equations (A8) and (A9) in Appendix A, respectively. To ensure the closed-loop structure of the indices, for j = n , we define N n + 1 5 = N 1 5 and N n + 1 6 = N 1 6 , while for j = 1 , we define N j 1 7 = N n 7 and N j 1 8 = N n 8 . The symbol ⨂ represents the tensor product, and the particle T belongs to the supervisor. Second, each correspondent N w implements four projective measurements on particle pairs ( N w 1 , N ^ w 1 ) , ( N w 2 , N ^ w 2 ) , ( N w 3 , N ^ w 3 ) , and ( N w 4 , N ^ w 4 ) . Specifically, for the first particle pair ( N w 1 , N ^ w 1 ) , the measurement basis is defined as
| ϵ k j = a 1 , 2 k + j + 1 ( w ) | 00 + ( 1 ) k + j a 1 , 2 k + j + 1 + ( 1 ) j ( w ) | 01 + ( 1 ) k a 1 , 2 k + j + 1 + 2 ( 1 ) k ( w ) | 10 + ( 1 ) j a 1 , 4 2 k j ( w ) | 11 ,
where k , j { 0 , 1 } . The coefficients a 1 , n ( w ) represent participant-specific weights that contribute to the basis states. For the second particle pair ( N w 2 , N ^ w 2 ) , the basis follows a similar structure to | ϵ k j , but with adjusted indices and coefficients. Specifically, the indices k , j are replaced with h , l , and the coefficients a 1 , n ( w ) are replaced by a 2 , n ( w ) . For the third particle pair ( N w 3 , N ^ w 3 ) , the measurement basis is given as
| ω s t ( k j ) = 1 2 [ e i θ 2 k + j + 1 w | 00 + ( 1 ) s + t e i θ 2 k + j + 1 + ( 1 ) j w | 01 + ( 1 ) s e i θ 2 k + j + 1 + 2 ( 1 ) k w | 10 + ( 1 ) t e i θ 4 2 k j w | 11 ] ,
where s , t { 0 , 1 } , and e i θ n w introduces specific phase adjustments for each basis state. For the fourth particle pair ( N w 4 , N ^ w 4 ) , the measurement basis shares the same structure as | ω s t ( k j ) , but with indices k , j , s , t replaced by h , l , m , r , respectively. Similarly, the phase parameters θ n w are replaced with θ ^ n w . Third, the supervisor Tom measures his particle T using the measurement operation | d T d | ( d { 0 , 1 } ) and announces the measurement result | d T to all correspondents. Based on these results, all participants can reconstruct the target two-particle states. For simplicity, the intermediate measurement results, collapsed states, and corresponding recovery unitary operations are omitted here. Since the proposed extended scheme is similar in steps and operations to the four-party controlled bidirectional cyclic scheme for RSP presented in the previous section, the success probability of this extended scheme is 1.

4. Discussion and Conclusions

To the best of our knowledge, DDC quantum communication has been explored only in a few studies [41,42,44,45], which mainly address the mixed communication of single-particle states, RSP of single-particle states with real coefficients, and the remote preparation of dual-particle states with real coefficients. In conventional controlled schemes, a fixed set of measurement outcomes from the sender and supervisor is used to determine the necessary recovery transformations for the receiver. These approaches typically present the relationship between the measurement results and the corresponding recovery operations in a way that can be cumbersome, especially when extending to multiparty communication scenarios. The reliance on this rigid structure can hinder the scalability and generalizability of the schemes, making it less efficient for applications involving more complex quantum networks or multiparty communication. Unlike the schemes in the four references mentioned above, our scheme provides general analytical formulas applicable to dual-particle states, describing the unitary transformations performed by the sender, supervisor, and receiver. This overcomes the limitations of existing schemes, such as their weak reasoning ability and complex expressions, which are not ideal for future multi-particle quantum communication. Additionally, our scheme differs from the ones in the four references in the following ways: the scheme in Section 2 is novel and has not been previously reported, and in Section 3, we explore DDC controlled RSP for dual-particle states with complex coefficients, offering a more general and broader application potential than the scheme in reference [45]. This extension not only increases the applicability of the scheme but also enables it to handle more complex quantum communication network applications.
Intrinsic efficiency (IE) is an important metric for assessing the effectiveness of quantum communication protocols. It is defined as [13,46]
ω = q t b c + q c ,
where q t is the number of qubits being transmitted, q c denotes the number of qubits in the quantum channel, and b c refers to the classical bits transferred. Through systematic optimization of channel utilization, our protocols achieve superior efficiency compared to existing schemes, as detailed in Table 1.
As demonstrated in Table 1, the two-particle scheme in Section 2.2 of our paper achieves a 40% improvement in IE compared to the single-particle scheme. The generalized scheme in Section 2.3 of our paper exhibits particularly noteworthy characteristics, approaching an asymptotic efficiency of ω = 4 / 13 as n . This represents a 38% improvement over the corresponding single-particle state schemes, while maintaining linear scaling of resource requirements. The efficiency gains originate from optimized entanglement distribution strategies and reduced classical communication overhead through deterministic operator relationships. Further extension to complex Hilbert spaces yields additional protocol variants for complex-coefficient states. Specifically, the IEs of our protocols in Section 3.1 and Section 3.2 are ω = 3 16 and ω = 4 n 21 n + 1 , respectively. These results not only confirm that our framework improves upon existing real-coefficient implementations but also enable new capabilities for handling more sophisticated quantum states, further expanding the applicability of our approach. handling more sophisticated quantum states, further expanding the applicability of our approach.
Next, We briefly address the security of our protocols, which relies entirely on the secure pre-sharing of entanglement among the authorized participants. This refers to the security of the entangled resource during the distribution process. By using well-established and comprehensive inspection strategies [47,48] for other similar quantum tasks, any external malicious attack or internal deception is easily detectable. For simplicity, we omit further discussion on this. Therefore, we can conclude that our protocols are fully secure. Additionally, since all our schemes are controlled, it ensures that no communicator can reconstruct the desired states without the supervisor’s consent, thereby providing an extra layer of security. The security analysis is consistent with previous findings on entanglement robustness in noisy environments. As demonstrated by Hu [49], the decoherence characteristics of multipartite entangled states directly determine their viability as quantum channels. Our protocol relies on pre-shared entanglement resources, which aligns with their conclusions about entanglement persistence under controlled conditions. Furthermore, as shown by Jung et al. [50], the choice of entanglement structure plays a key role in the robustness of quantum teleportation through noisy channels. This further reinforces the reliability of the entanglement resources we depend on in practical quantum communication scenarios.
Taking the scheme outlined in Section 3.1 as an example, we examine the control power [45,51,52] of the supervisor David [38,42]. Suppose Alice’s measurement outcomes are | ϵ 00 A 1 A 2 | ω 01 ( 00 ) A 1 A 2 and | ζ 01 A 3 A 4 | ς 00 ( 01 ) A 3 A 4 , Bob’s results are | ϵ 00 B 1 B 2 | ω ^ 10 ( 00 ) B 1 B 2 and | ζ 00 B 3 B 4 | ς ^ 00 ( 00 ) B 3 B 4 , and Charlie’s outcomes are | ϵ 10 C 1 C 2 | ω ¯ 00 ( 10 ) C 1 C 2 and | ζ 00 C 7 C 8 | ς ¯ 01 00 C 7 C 8 . Based on Equation (A5) from Appendix A, it can be deduced that the entire system state will collapse into
1 256 2 { ( a 11 e i θ 1 | 00 a 12 e i θ 2 | 01 + a 13 e i θ 3 | 10 a 14 e i θ 4 | 11 ) B 5 B 6 ( a 22 e i θ 2 | 00 + a 21 e i θ 1 | 01 a 24 e i θ 4 | 10 a 23 e i θ 3 | 11 ) C 7 C 8 ( b 11 e i α 1 | 00 b 12 e i α 2 | 01 b 13 e i α 3 | 10 + b 14 e i α 4 | 11 ) C 5 C 6 ( b 21 e i α 1 | 00 b 22 e i α 2 | 01 + b 23 e i α 3 | 10 b 24 e i α 4 | 11 ) A 7 A 8 ( c 13 e i β 3 | 00 c 14 e i β 4 | 01 c 11 e i β 1 | 10 + c 12 e i β 2 | 11 ) A 5 A 6 ( c 21 e i β 1 | 00 + c 22 e i β 2 | 01 + c 23 e i β 3 | 10 + c 24 e i β 4 | 11 ) B 7 B 8 | 0 D + ( a 11 e i θ 1 | 11 + a 12 e i θ 2 | 10 a 13 e i θ 3 | 01 a 14 e i θ 4 | 00 ) B 5 B 6 ( a 22 e i θ 2 | 11 a 21 e i θ 1 | 10 + a 24 e i θ 4 | 01 a 23 e i θ 3 | 00 ) C 7 C 8 ( b 11 e i α 1 | 11 + b 12 e i α 2 | 10 + b 13 e i α 3 | 01 + b 14 e i α 4 | 00 ) C 5 C 6 ( b 21 e i α 1 | 11 + b 22 e i α 2 | 10 b 23 e i α 3 | 01 b 24 e i α 4 | 00 ) A 7 A 8 ( c 13 e i β 3 | 11 + c 14 e i β 4 | 10 + c 11 e i β 1 | 01 + c 12 e i β 2 | 00 ) A 5 A 6 ( c 21 e i β 1 | 11 c 22 e i β 2 | 10 c 23 e i β 3 | 01 + c 24 e i β 4 | 00 ) B 7 B 8 | 1 D .
After that, Alice, Bob, and Charlie implement suitable unitary operations:
U t o t = [ σ B 5 ( 0 , 0 ) σ B 6 ( 1 , 1 ) ] [ σ C 7 ( 1 , 1 ) σ C 8 ( 0 , 1 ) ] [ σ C 5 ( 1 , 1 ) σ C 6 ( 1 , 1 ) ] [ σ A 7 ( 0 , 0 ) σ A 8 ( 1 , 1 ) ] [ σ A 5 ( 1 , 0 ) σ A 6 ( 1 , 1 ) ] [ σ B 7 ( 0 , 0 ) σ B 8 ( 0 , 0 ) ] σ D ( 0 , 0 ) ,
and then the combined state in Equation (22) transforms into
| F B 5 B 6 C 7 C 8 C 5 C 6 A 7 A 8 A 5 A 6 B 7 B 8 D = 1 256 2 ( | ϕ 1 B 5 B 6 | ϕ 2 C 7 C 8 | ψ 1 C 5 C 6 | ψ 2 A 7 A 8 | χ 1 A 5 A 6 | χ 2 B 7 B 8 | 0 D | ϕ 1 B 5 B 6 | ϕ 2 C 7 C 8 | ψ 1 C 5 C 6 | ψ 2 A 7 A 8 | χ 1 A 5 A 6 | χ 2 B 7 B 8 | 1 D
where | ϕ k , | ψ k , and | χ k ( k = 0 , 1 ) are the same as shown in Equation (10), and Alice’s state | ϕ 1 can be expressed as
| ϕ 1 = a 11 e i θ 1 | 11 a 12 e i θ 2 | 10 a 13 e i θ 3 | 01 + a 14 e i θ 4 | 00 .
The second state, | ϕ 2 , has a similar structure to | ϕ 1 but is derived by replacing the coefficients a 1 j with a 2 j for j = 1 , 2 , 3 , 4 , while keeping the phase factors θ j unchanged and preserving the same sign pattern. For Bob and Charlie, their states share a similar structure with | ϕ k and can be derived by substituting coefficients and phase factors. Specifically, Bob’s states | ψ k can be obtained by replacing Alice’s coefficients a i j with b i j and the phase factors θ j with α j , resulting in | ψ 1 and | ψ 2 . Similarly, Charlie’s states | χ k are derived by substituting a i j with c i j and θ j with β j , yielding | χ 1 and | χ 2 . To avoid lengthy formulaic descriptions, the explicit expressions for Bob’s and Charlie’s states are omitted here.
If the supervisor David does not grant permission, the state of the system after measurements by Alice, Bob, and Charlie collapses into a mixed state. This mixed state can be represented using a density operator:
ρ B C A = t r D ( ρ B C A D ) = t r D ( | F F | ) = 1 131072 | Φ 1 Φ 1 | + | Φ 2 Φ 2 | ,
where
| Φ 1 = | ϕ 1 B 5 B 6 | ϕ 2 C 7 C 8 | ψ 1 C 5 C 6 | ψ 2 A 7 A 8 | χ 1 A 5 A 6 | χ 2 B 7 B 8 .
The state | Φ 2 shares a similar structure to | Φ 1 . Specifically, | Φ 2 is obtained by replacing the states | ϕ k , | ψ k , and | χ k in | Φ 1 with their primed counterparts | ϕ k , | ψ k , and | χ k , respectively. The density matrix ρ B C A = ρ B 5 B 6 C 7 C 8 C 5 C 6 A 7 A 8 A 5 A 6 B 7 B 8 is composed of two orthogonal states, | Φ 1 and | Φ 2 , combined through their outer products. Here, t r D ( · ) denotes the partial trace over particle D. In this way, we are able to calculate the average fidelity of the composite state shared among the three communicators and deduce David’s control capability as follows (for the detailed calculation process, please refer to Appendix B):
f ¯ A B C = 1 131072 [ 1 + ( 1 6 ) 6 ]
and
P D = 1 f ¯ A B C = 1 1 131072 [ 1 + ( 1 6 ) 6 ] ,
respectively.
As highlighted in reference [52], the supervisor’s control power must satisfy the following condition:
P 2 N 1 2 N + 1 ,
where N represents the number of qubits being teleported. It can be readily verified that the control power achieved by David in Section 3.1 fulfils P D > ( 2 12 1 ) / ( 2 12 + 1 ) . This demonstrates that, from the supervisor’sperspective, the protocol described in Section 3.1 is both reasonable and feasible.
Turning our attention to the feasibility of the proposed schemes, it is evident that their implementation involves fundamental quantum operations, including Bell-state measurements, single-particle measurements, and the application of quantum gates such as the Hadamard gate, CNOT gate, and Pauli gates. These operations have been successfully realized across a variety of experimental quantum platforms, including the cavity QED system [53], ion trap system [54], and optical systems [55], among others. Given the maturity of these technologies, the protocols proposed in this work are experimentally viable and can be implemented with current advancements in quantum technology.
In summary, in this work, we constructed a 25-particle entangled state based on Hadamard and CNOT gates to serve as a quantum channel, and on this basis, proposed two novel four-party CDDC schemes tailored for QT and RSP. In the QT scheme, under the controller’s authorization, three communicators each transmit two arbitrary unknown two-particle states to the other two communicators. In this process, each communicator performs only four Bell-state measurements, while, with the controller’s approval, a single-particle Z-basis measurement is performed to achieve bidirectional transmission of the two unknown two-particle states. The receivers can deterministically reconstruct the target states by selecting the corresponding unitary operations based on the measurement outcomes. For the RSP scenario, under the supervision of the controller, each communicator, with the assistance of the other communicators, can prepare two different arbitrary two-particle states. To accomplish this, each communicator introduces four auxiliary qubits and performs four CNOT gate operations, and then, by combining a feedforward strategy, cleverly constructs different measurement bases to perform two two-particle measurements. Subsequently, the controller measures their particle in the Z-basis, after which each receiver perfectly recovers the target state by applying the appropriate Pauli operations based on the measurement results of the other three participants. Both schemes achieve a theoretical success rate of 100%. Furthermore, we have extended the two proposed four-party CDDC quantum communication schemes to the case of n communicators and one supervisor, i.e., an n + 1 party scenario, where n is greater than 3. Since the extended scheme follows a similar procedure and operational approach as the previous schemes—wherein each communicator, under supervisory control, can simultaneously transmit two different arbitrary two-particle states to the other parties, thereby achieving controlled quantum cyclic communication in both clockwise and counterclockwise directions and ultimately realizing a 100% success rate—we provide a general mathematical formulation for bidirectional cyclic quantum communication with multi-particle states applicable to each scheme. This offers a scalable operational framework for multi-particle bidirectional cyclic communication. Moreover, we evaluated the inherent efficiency, security, and controllability of the proposed schemes. Compared with previous studies, our schemes are efficient, controllable, secure, and experimentally feasible. With the continuous advancement of quantum technologies, the schemes proposed in this study can be further expanded to meet more complex communication requirements. Through innovations in communication protocols, mathematical formulations, and the extension of the schemes, this research provides theoretical and technical support for the ongoing development of multi-particle quantum communication, aiming to enhance security, capacity, and meet the diverse needs of future quantum network scenarios.

Author Contributions

N.M. and Z.C. contributed equally as co-first authors, playing major roles in the conceptualization, formal analysis, data curation, validation, and writing of the original draft. J.P., as the corresponding author, was primarily responsible for methodology, resources, supervision, project administration, funding acquisition, and writing—review and editing. Y.A. and J.T. contributed to software development and visualization. All authors have read and agreed to the published version of the manuscript.

Funding

This work is supported by the Kashi University Flexible Introduction Research Initiation Fund (No. 022024077), and by the Kashgar University School-level General Research Project (No: (2023) 1835). Sponsored by the Natural Science Foundation of Xinjiang Uygur Autonomous Region (No. 2024D01A10). Supported by the Scientific Research Project of the Fundamental Research Funds for Higher Education Institutions in Xinjiang Uygur Autonomous Region. Sponsored by the Natural Science Foundation of Xinjiang Uygur Autonomous Region (No. 2024D01C196). Supported by the Key University-Level Project of Ili Normal University (No. 2024YSZD001).

Data Availability Statement

The data sets generated during and/or analysed during the current study are available from the corresponding author on reasonable request.

Conflicts of Interest

No potential conflicts of interest were reported by the authors. All authors of this manuscript have read and approved the final version submitted, and contents of this manuscript have not been copyrighted or published previously, nor is this paper under consideration for publication elsewhere.

Appendix A. Detailed Derivation of the Relevant Equations

In this appendix, we provide the explicit forms of the eight-particle maximally entangled states | φ 1 8 and | φ 2 8 , which are used in Section 2.1 to construct the 25-particle maximally entangled quantum channel state for the implementation of the four-party DDC controlled QT scheme. These states are critical components in extending Yu’s protocol [15] to the 25-particle maximally entangled state framework. The explicit expressions for | φ 1 8 and | φ 2 8 are as follows:
| φ 1 8 = 1 4 ( | 00000000 + | 00010001 + | 00100010 | 00110011 + | 01000100 + | 01010101 + | 01100110 | 01110111 + | 10001000 + | 10011001 + | 10101010 | 10111011 + | 11001100 + | 11011101 + | 11101110 | 11111111 )
and
| φ 2 8 = 1 4 ( | 00001111 | 00011110 | 00101101 | 00111100 | 01001011 + | 01011010 + | 01101001 + | 01111000 | 10000111 + | 10010110 + | 10100101 + | 10110100 + | 11000011 | 11010010 | 11100001 | 11110000 ) .
Suppose Alice intends to simultaneously send the unknown two-particle state | ϵ 1 A 1 A ^ 1 to Bob and the unknown two-particle state | ϵ 2 A 2 A ^ 2 to Charlie. At the same time, Bob plans to transmit the unknown two-particle state | ω 1 B 1 B ^ 1 to Charlie and the unknown two-particle state | ω 2 B 2 B ^ 2 to Alice. Additionally, Charlie aims to teleport the unknown two-particle state | λ 1 C 1 C ^ 1 to Alice and the unknown two-particle state | λ 2 C 2 C ^ 2 to Bob, all under the supervision of David. These arbitrary unknown two-particle states can be expressed as
| ϵ k X k X ^ k = i = 1 4 x k i | j 1 j 2 X k X ^ k , k { 1 , 2 } , X { A , B , C } ,
where x k i are the corresponding coefficients, and j 1 , j 2 { 0 , 1 } represent the quantum bit states. Specifically, the general mathematical expressions for the six quantum states are
| ϵ 1 A 1 A ^ 1 = ( x 11 | 00 + x 12 | 01 + x 13 | 10 + x 14 | 11 ) A 1 A ^ 1 , | ϵ 2 A 2 A ^ 2 = ( x 21 | 00 + x 22 | 01 + x 23 | 10 + x 24 | 11 ) A 2 A ^ 2 , | ω 1 B 1 B ^ 1 = ( y 11 | 00 + y 12 | 01 + y 13 | 10 + y 14 | 11 ) B 1 B ^ 1 , | ω 2 B 2 B ^ 2 = ( y 21 | 00 + y 22 | 01 + y 23 | 10 + y 24 | 11 ) B 2 B ^ 2 , | λ 1 C 1 C ^ 1 = ( z 11 | 00 + z 12 | 01 + z 13 | 10 + z 14 | 11 ) C 1 C ^ 1 , | λ 2 C 2 C ^ 2 = ( z 21 | 00 + z 22 | 01 + z 23 | 10 + z 24 | 11 ) C 2 C ^ 2 .
The measurement outcomes of Alice, Bob, and Charlie become mutually entangled, leading to the formation of the multipartite quantum entangled state | T , which is explicitly expressed as follows:
| T = 1 256 2 { f , g , h , t = 0 1 u , v , p , q = 0 1 | B f g A 1 A 1 | B h t A ^ 1 A 2 | B u v A 2 A 3 | B p q A ^ 2 A 4 · F ( f , h , g , t , x ) B 5 B 6 · G ( u , p , v , q , x ) C 7 C 8 + f , g , h , t = 0 1 u , v , p , q = 0 1 | B f g B 1 B 1 | B h t B ^ 1 B 2 | B u v B 2 B 3 | B p q B ^ 2 B 4 · F ( f , h , g , t , y ) C 5 C 6 · G ( u , p , v , q , y ) A 7 A 8 + f , g , h , t = 0 1 u , v , p , q = 0 1 | B f g C 1 C 1 | B h t C ^ 1 C 2 | B u v C 2 C 3 | B p q C ^ 2 C 4 · F ( f , h , g , t , z ) A 5 A 6 · G ( u , p , v , q , z ) B 7 B 8 } | 0 D 1 256 2 { f , g , h , t = 0 1 u , v , p , q = 0 1 | B f g A 1 A 1 | B h t A ^ 1 A 2 | B u v A 2 A 3 | B p q A ^ 2 A 4 · F ( f , h , g , t , x ) B 5 B 6 · G ( u , p , v , q , x ) C 7 C 8 + f , g , h , t = 0 1 u , v , p , q = 0 1 | B f g B 1 B 1 | B h t B ^ 1 B 2 | B u v B 2 B 3 | B p q B ^ 2 B 4 · F ( f , h , g , t , y ) C 5 C 6 · G ( u , p , v , q , y ) A 7 A 8
+ f , g , h , t = 0 1 u , v , p , q = 0 1 | B f g C 1 C 1 | B h t C ^ 1 C 2 | B u v C 2 C 3 | B p q C ^ 2 C 4 · F ( f , h , g , t , z ) A 5 A 6 · G ( u , p , v , q , z ) B 7 B 8 } | 1 D ,
where
F ( f , h , g , t , x ) = x 11 | f , h + ( 1 ) t x 12 | f , 1 h + ( 1 ) g x 13 | 1 f , h + ( 1 ) g + t x 14 | 1 f , 1 h .
F ( f , h , g , t , x ) = x 11 | 1 f , 1 h + ( 1 ) t x 12 | 1 f , h + ( 1 ) g x 13 | f , 1 h + ( 1 ) g + t x 14 | f , h .
G ( u , p , v , q , x ) = ( 1 ) u p x 21 | u , p + ( 1 ) u ( 1 p ) + q x 22 | u , 1 p + ( 1 ) v + ( 1 u ) p x 23 | 1 u , p + ( 1 ) ( 1 u ) ( 1 p ) + v + q x 24 | 1 u , 1 p ,
G ( u , p , v , q , x ) = ( 1 ) ( 1 u ) ( 1 p ) x 21 | 1 u , 1 p + ( 1 ) ( 1 u ) p + q x 22 | 1 u , p + ( 1 ) v + u ( 1 p ) x 23 | u , 1 p + ( 1 ) u p + v + q x 24 | u , p .
The quantum state after Alice, Bob, and Charlie share their respective measurement outcomes can be described as the post-measurement entangled state | T , which is expressed explicitly as follows:
| T = 1 2 [ F ( f , h , x , t , g ) B 5 B 6 G ( u , p , x , g , q ) C 7 C 8 H ( f , h , y , t , g ) C 5 C 6 I ( u , p , y , v , q ) A 7 A 8 J ( f , h , z , t , g ) A 5 A 6 K ( u , p , z , v , q ) B 7 B 8 ] | 0 D 1 2 [ F ( 1 f , 1 h , x , t , g ) B 5 B 6 G ( 1 u , 1 p , x , g , q ) C 7 C 8 H ( 1 f , 1 h , y , t , g ) C 5 C 6 I ( 1 u , 1 p , y , v , q ) A 7 A 8 J ( 1 f , 1 h , z , t , g ) A 5 A 6 K ( 1 u , 1 p , z , v , q ) B 7 B 8 ] | 1 D ,
where
F ( f , h , x , t , g ) = x 11 | f , h + ( 1 ) t x 12 | f , 1 h + ( 1 ) g x 13 | 1 f , h + ( 1 ) g + t x 14 | 1 f , 1 h ,
G ( u , p , x , g , q ) = ( 1 ) u p x 21 | u , p + ( 1 ) u ( 1 p ) + g x 22 | u , 1 p + ( 1 ) v + ( 1 u ) p x 23 | 1 u , p + ( 1 ) ( 1 u ) ( 1 p ) + v + q x 24 | 1 u , 1 p
H ( f , h , y , t , g ) = y 11 | f , h + ( 1 ) t y 12 | f , 1 h + ( 1 ) g y 13 | 1 f , h + ( 1 ) g + t y 14 | 1 f , 1 h
I ( u , p , y , v , q ) = ( 1 ) u p y 21 | u , p + ( 1 ) u ( 1 p ) + q y 22 | u , 1 p + ( 1 ) v + ( 1 u ) p y 23 | 1 u , p + ( 1 ) ( 1 u ) ( 1 p ) + v + q y 24 | 1 u , 1 p
J ( f , h , z , t , g ) = z 11 | f , h + ( 1 ) t z 12 | f , 1 h + ( 1 ) g z 13 | 1 f , h + ( 1 ) g + t z 14 | 1 f , 1 h
K ( u , p , z , v , q ) = ( 1 ) u p z 21 | u , p + ( 1 ) u ( 1 p ) + q z 22 | u , 1 p + ( 1 ) v + ( 1 u ) p z 23 | 1 u , p + ( 1 ) ( 1 u ) ( 1 p ) + v + q z 24 | 1 u , 1 p
In the main text, we discussed the unitary operations required to reconstruct the target quantum states in this protocol. Specifically, after receiving all the measurement outcomes, Alice, Bob, and Charlie are expected to carry out the appropriate unitary operations based on their measurement outcomes in order to restore the original quantum states. These operations can be represented in a unified manner as follows:
U ( X ) = ( 1 w ) U ( X ) U ^ ( X ) + w U ( X ) U ^ ( X ) ,
where X { A , B , C } represent the different participants Alice, Bob, and Charlie. The specific forms of U ( X ) , U ^ ( X ) , U ( X ) , and U ^ ( X ) are as follows:
U ( A ) = ( 1 w ) [ U ( A ) U ^ ( A ) ] + w [ U ( A ) U ^ ( A ) ] , U ( B ) = ( 1 w ) [ U ( B ) U ^ ( B ) ] + w [ U ( B ) U ^ ( B ) ] , U ( C ) = ( 1 w ) [ U ( C ) U ^ ( C ) ] + w [ U ( C ) U ¨ ( C ) ] .
The unitary matrices U X , U ^ X , U X and U ^ X are defined as follows:
U ( B ) = | 00 f , h | + ( 1 ) t | 01 f , 1 h | + ( 1 ) g | 10 1 f , h | + ( 1 ) g + t | 11 1 f , 1 h | , U ^ ( C ) = ( 1 ) u p | 00 u , p | + ( 1 ) u ( 1 p ) + q | 01 u , 1 p | + ( 1 ) v + ( 1 u ) p | 10 1 u , p | + ( 1 ) ( 1 u ) ( 1 p ) + v + q | 11 1 u , 1 p | , U ( C ) = | 00 f , h | + ( 1 ) t | 01 f , 1 h | + ( 1 ) g | 10 1 f , h | + ( 1 ) g + t | 11 1 f , 1 h | , U ^ ( A ) = ( 1 ) u p | 00 u , p | + ( 1 ) u ( 1 p ) + q | 01 u , 1 p | + ( 1 ) v + ( 1 u ) p | 10 1 u , p | + ( 1 ) ( 1 u ) ( 1 p ) + v + q | 11 1 u , 1 p | , U ( A ) = | 00 f , h | + ( 1 ) t | 01 f , 1 h | + ( 1 ) g | 10 1 f , h | + ( 1 ) g + t | 11 1 f , 1 h | , U ^ ( B ) = ( 1 ) u p | 00 u , p | + ( 1 ) u ( 1 p ) + q | 01 u , 1 p | + ( 1 ) v + ( 1 u ) p | 10 1 u , p | + ( 1 ) ( 1 u ) ( 1 p ) + v + q | 11 1 u , 1 p | , U ( B ) = | 00 1 f , 1 h | + ( 1 ) t | 01 1 f , h | + ( 1 ) g | 10 f , 1 h | + ( 1 ) g + t | 11 f , h | ,
U ^ ( C ) = ( 1 ) ( 1 u ) ( 1 p ) | 00 1 u , 1 p | + ( 1 ) ( 1 u ) p + q | 01 1 u , p | + ( 1 ) v + u ( 1 p ) | 10 u , 1 p | + ( 1 ) u p + v + q | 11 u , p | , U ( C ) = | 00 1 f , 1 h | + ( 1 ) t | 01 1 f , h | + ( 1 ) g | 10 f , 1 h | + ( 1 ) g + t | 11 f , h | , U ^ ( A ) = ( 1 ) ( 1 u ) ( 1 p ) | 00 1 u , 1 p | + ( 1 ) ( 1 u ) p + q | 01 1 u , p | + ( 1 ) v + u ( 1 p ) | 10 u , 1 p | + ( 1 ) u p + v + q | 10 u , p | , U ( A ) = | 00 1 f , 1 h | + ( 1 ) t | 01 1 f , h | + ( 1 ) g | 10 f , 1 h | + ( 1 ) g + t | 11 f , h | , U ^ ( B ) = ( 1 ) ( 1 u ) ( 1 p ) | 10 1 u , 1 p | + ( 1 ) ( 1 u ) p + q | 01 1 u , p | + ( 1 ) v + u ( 1 p ) | 10 u , 1 p | + ( 1 ) u p + v + q | 11 u , p | .
In the main text, by performing CNOT operations on the respective particle groups, we obtained the quantum state | T in Equation (14), which is expressed as a superposition of two types of 12-particle maximally entangled states, | φ 1 12 and | φ 2 12 . For clarity and further analysis, the explicit forms of these two entangled states are provided below:
| φ 1 12 = 1 4 ( | 000000000000 + | 000001010001 + | 000010100010 | 000011110011 + | 010100000100 + | 010101010101 + | 010110100110 | 010111110111 + | 101000001000 + | 101001011001 + | 101010101010 | 101011111011 + | 111100001100 + | 111101011101 + | 111110101110 | 111111111111
| φ 2 12 = 1 4 ( | 000000001111 | 000001011110 | 000010101101 | 000011111100 | 010100001011 + | 010101011010 + | 010110101001 + | 010111111000 | 101000000111 + | 101001010110 + | 101010100101 + | 101011110100 + | 111100000011 | 111101010010 | 111110100001 | 111111110000 .
In Equation (12) of the main text, the quantum state | T was introduced in its basic form. This state is obtained through a series of measurements performed by Alice, Bob, and Charlie on their respective particle pairs, followed by the exchange of measurement results among them. Each participant constructs measurement bases specific to their role, and the resulting states form the components of the expanded | T . By applying the above six sets of measurement bases, the quantum state | T can be explicitly expanded into a detailed mathematical form. The following equation presents the full structure of | T , accompanied by the definitions of the functions F, F , G, and G . These functions encode the weight distributions and phase adjustments of the basis states.
| T = 1 256 2 { u , v , s , t = 0 | ϵ u v A 1 A 2 | ω s t ( u v ) A ¯ 1 A ¯ 2 · F ( u , v , s , t ; θ , a ) B 5 B 6 p , q , m , r = 0 | ζ p q A 3 A 4 | ς m r ( p q ) A ¯ 3 A ¯ 4 · G ( p , q , m , r ; θ , a ) C 7 C 8 u , v , s , t = 0 | ϵ u v B 1 B 2 | ω ^ s t ( u v ) B ¯ 1 B ¯ 2 · F ( u , v , s , t ; α , b ) C 5 C 6 p , q , m , r = 0 | ζ p q B 3 B 4 | ς ^ m r ( p q ) B ¯ 3 B ¯ 4 · G ( p , q , m , r ; α , b ) A 7 A 8 u , v , s , t = 0 | ϵ u v C 1 C 2 | ω ¯ s t ( u v ) C ¯ 1 C ¯ 2 · F ( u , v , s , t ; β , c ) A 5 A 6 p , q , m , r = 0 | ζ p q C 3 C 4 | ς ¯ m r ( p q ) C ¯ 3 C ¯ 4 · G ( p , q , m , r ; β , c ) B 7 B 8 } | 0 D + 1 256 2 { u , v , s , t = 0 | ϵ u v A 1 A 2 | ω s t ( u v ) A ¯ 1 A ¯ 2 · F ( u , v , s , t ; θ , a ) B 5 B 6 p , q , m , r = 0 | ζ p q A 3 A 4 | ς m r ( p q ) A ¯ 3 A ¯ 4 · G ( p , q , m , r ; θ , a ) C 7 C 8 u , v , s , t = 0 | ϵ u v B 1 B 2 | ω ^ s t ( u v ) B ¯ 1 B ¯ 2 · F ( u , v , s , t ; α , b ) C 5 C 6 p , q , m , r = 0 | ζ p q B 3 B 4 | ς ^ m r ( p q ) B ¯ 3 B ¯ 4 · G ( p , q , m , r ; α , b ) A 7 A 8 u , v , s , t = 0 | ϵ u v C 1 C 2 | ω ¯ s t ( u v ) C ¯ 1 C ¯ 2 · F ( u , v , s , t ; β , c ) A 5 A 6 p , q , m , r = 0 | ζ p q C 3 C 4 | ς ¯ m r ( p q ) C ¯ 3 C ¯ 4 · G ( p , q , m , r ; β , c ) B 7 B 8 } | 1 D ,
where u , v , s , t , p , q , m , r { 0 , 1 } and the functions are defined as follows:
F ( u , v , s , t ; θ , a ) = a 1 , 2 u + v + 1 e i θ 2 u + v + 1 | 00 + ( 1 ) u + v + s + t a 1 , 2 u + v + 1 + ( 1 ) v e i θ 2 u + v + 1 + ( 1 ) v | 01 + ( 1 ) u + s a 1 , 2 u + v + 1 + 2 ( 1 ) u e i θ 2 u + v + 1 + 2 ( 1 ) u | 10 + ( 1 ) v + t a 1 , 4 2 u v e i θ 4 2 u v | 11 ,
F ( u , v , s , t ; θ , a ) = a 1 , 2 u + v + 1 e i θ 2 u + v + 1 | 11 + ( 1 ) u + v + s + t + 1 a 1 , 2 u + v + 1 + ( 1 ) v e i θ 2 u + v + 1 + ( 1 ) v | 10 + ( 1 ) u + s + 1 a 1 , 2 u + v + 1 + 2 ( 1 ) u e i θ 2 u + v + 1 + 2 ( 1 ) u | 01 + ( 1 ) v + t a 1 , 4 2 u v e i θ 4 2 u v | 00 ,
Similarly, F ( u , v , s , t ; θ , b ) and F ( u , v , s , t ; θ , c ) can be obtained by simply replacing a in F ( u , v , s , t ; θ , a ) with b and c, respectively. The expression for G ( p , q , m , r ; θ , a ) is structurally similar to F ( u , v , s , t ; θ , a ) . It can be be derived by replacing u , v , s , t in F ( u , v , s , t ; θ , a ) with p , q , m , r and substituting the coefficients a 1 , k with a 2 , k . Likewise, the form of G ( p , q , m , r ; θ , a ) is analogous to F ( u , v , s , t ; θ , a ) . This can be achieved by replacing u , v , s , t in F ( u , v , s , t ; θ , a ) with p , q , m , r , and substituting a 1 , k with a 2 , k . Similarly, G ( p , q , m , r ; θ , b ) and G ( p , q , m , r ; θ , c ) can be obtained by simply replacing a in G ( p , q , m , r ; θ , a ) with b and c, respectively.

Appendix B. Detailed Fidelity Derivation

The fidelity of the combined state shared by the three communicators can be expressed as
f A B C = ϱ | ρ B C A | ϱ = 1 131072 1 + 2 12 X { A , B , C } k = 1 , 2 F X ( k ) 2 ,
where | ϱ = | ϕ 1 | ϕ 2 | ψ 1 | ψ 2 | χ 1 | χ 2 , and X { A , B , C } represent the three communicators (Alice, Bob, and Charlie), and k = 1 , 2 correspond to the two states for each participant. The function F X ( k ) is defined as F X ( k ) = x k 1 x k 4 cos ( θ 1 θ 4 ) x k 2 x k 3 cos ( θ 2 θ 3 ) , where x i j are the coefficients and θ j are the phase factors specific to each communicator. For Alice ( X = A ), the coefficients and phase factors are x i j = a i j and θ j = θ j , respectively. For Bob ( X = B ), they are x i j = b i j and θ j = α j , and for Charlie ( X = C ), they are x i j = c i j and θ j = β j .
To compute the average fidelity of the joint state shared among the three communicators, we represent the coefficients a k j , b k j and c k j ( k = 1 , 2 ; j = 1 , 2 , 3 , 4 ) using spherical parameterizations as follows:
a k 1 = cos ϑ k , a k 2 = sin ϑ k cos δ k , a k 3 = sin ϑ k sin δ k cos ε k , a k 4 = sin ϑ k sin δ k sin ε k ,
where the corresponding coefficients b k j and c k j for Bob and Charlie take on the same structural form but are defined by their respective angular parameters ( ϑ 3 , δ 3 , ε 3 , , ϑ 6 , δ 6 , ε 6 ) . Here, ϑ k , δ k [ 0 , π ] and ε k [ 0 , 2 π ] for all k { 1 , 2 , 3 , 4 , 5 , 6 } .
By substituting these spherical coordinates into the general fidelity expression previously defined, the average fidelity of the composite state shared by the three communicators can be expressed as a function of these angular parameters. This formulation naturally encapsulates the contributions of all participants (Alice, Bob, and Charlie) while maintaining the inherent symmetry of the system. The explicit relationships between the angular parameters and the fidelity ensure that the optimization of fidelity becomes a geometric problem in the parameter space, reflecting the interplay between amplitudes and phases encoded in the states.
For clarity and conciseness, the detailed intermediate derivations are omitted here but follow directly from substituting the parameterized coefficients into the fidelity equation. This approach highlights the role of the angular parameters in determining the fidelity and provides a compact representation suitable for further analysis or optimization in quantum communication protocols. Therefore, the average fidelity of the composite state shared by the three communicators can be expressed as
f ¯ A B C = 1 131072 1 + 2 12 X { A , B , C } k = 1 , 2 I X ( k ) 2 ,
where the integral term I X ( k ) is expressed as
I X ( k ) = 1 2 5 π 6 0 2 π 0 π 0 π 0 2 π 0 2 π 0 2 π 0 2 π sin 2 ϑ k sin δ k x k 1 x k 4 cos ( θ 1 θ 4 ) x k 2 x k 3 cos ( θ 2 θ 3 ) 2 d ϑ k d δ k d ε k d θ 1 d θ 2 d θ 3 d θ 4 .
Here, I X ( k ) corresponds to the contributions from each communicator, where X = A , B , C represent Alice, Bob, and Charlie, respectively, and k = 1 , 2 denotes the two states for each participant. The coefficients and phase parameters differ for each communicator: for Alice ( X = A ), x i j = a i j , θ j = θ j ; for Bob ( X = B ), x i j = b i j , θ j = α j ; and for Charlie ( X = C ), x i j = c i j , θ j = β j .
By substituting Equation (A12) into Equation (A13), this average fidelity and David’s control power are
f ¯ A B C = 1 131072 [ 1 + ( 1 6 ) 6 ]
and
P D = 1 f ¯ A B C = 1 1 131072 [ 1 + ( 1 6 ) 6 ] ,
respectively.

References

  1. Bennett, C.H.; Brassard, G.; Crépeau, C.; Jozsa, R.; Peres, A.; Wootters, W.K. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett. 1993, 70, 1895–1899. [Google Scholar] [CrossRef] [PubMed]
  2. Zhou, P.; Li, X.H.; Deng, F.G.; Zhou, H.Y. Multiparty-controlled teleportation of an arbitrary m-qubit state with a pure entangled quantum channel. J. Phys. A Math. Theor. 2007, 40, 13121–13130. [Google Scholar] [CrossRef]
  3. Gangopadhyay, S.; Wang, T.; Mashatan, A.; Ghose, S. Controlled quantum teleportation in the presence of an adversary. Phys. Rev. A 2022, 106, 052433. [Google Scholar] [CrossRef]
  4. Kumar, A.; Haddadi, S.; Pourkarimi, M.R.; Behera, B.K.; Panigrahi, P.K. Experimental realization of controlled quantum teleportation of arbitrary qubit states via cluster states. Sci. Rep. 2020, 10, 13608. [Google Scholar] [CrossRef]
  5. Hassanpour, S.; Houshm, M. Bidirectional teleportation of a pure EPR state by using GHZ states. Quantum Inf. Process. 2016, 15, 905–912. [Google Scholar] [CrossRef]
  6. Yang, G.; Lian, B.W.; Nie, M.; Jin, J. Bidirectional multi-qubit quantum teleportation in noisy channel aided with weak measurement. Chin. Phys. B 2017, 26, 040305. [Google Scholar] [CrossRef]
  7. Yang, Y.Q.; Zha, X.W.; Yu, Y. Asymmetric bidirectional controlled teleportation via seven-qubit cluster state. Int. J. Theor. Phys. 2016, 55, 4197–4204. [Google Scholar] [CrossRef]
  8. Jiang, S.X.; Zhou, R.G.; Luo, G.F.; Liang, X.Z.; Fan, P. Controlled bidirectional quantum teleportation of arbitrary single qubit via a non-maximally entangled state. Int. J. Theor. Phys. 2020, 59, 2966–2983. [Google Scholar] [CrossRef]
  9. Wu, F.; Bai, M.Q.; Zhang, Y.C.; Liu, R.J.; Mo, Z.W. Cyclic quantum teleportation of an unknown multi-particle high-dimension state. Mod. Phys. Lett. B 2020, 34, 2050073. [Google Scholar] [CrossRef]
  10. Zhou, R.G.; Qian, C.; Lan, H. Cyclic and bidirectional quantum teleportation via pseudo multi-qubit states. IEEE Access 2019, 7, 42445–42449. [Google Scholar] [CrossRef]
  11. Sang, Z.W. Cyclic controlled teleportation by using a seven-qubit entangled state. Int. J. Theor. Phys. 2019, 57, 3835–3838. [Google Scholar] [CrossRef]
  12. Yang, B. Hierarchical controlled cyclic quantum teleportation. Phys. Scr. 2023, 98, 115125. [Google Scholar] [CrossRef]
  13. Peng, J.Y.; He, Y. Annular controlled teleportation. Int. J. Theor. Phys. 2019, 58, 3271–3281. [Google Scholar] [CrossRef]
  14. 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]
  15. Yu, Y.; Zhao, N.; Pei, C.X. Multicast-based multiparty remote state prepartion schemes of two-qubit states. Quantum Inf. Process. 2019, 18, 319. [Google Scholar] [CrossRef]
  16. 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]
  17. Ma, P.C.; Chen, G.B.; Li, X.W.; Zhan, Y.B. Hierarchically controlled remote state preparation of an arbitrary single-qubit state by using a four-qubit |χ〉 entangled state. Quantum Inf. Process. 2018, 17, 105. [Google Scholar] [CrossRef]
  18. An, N.B.; Kim, J. Joint remote state preparation. J. Phys. B At. Mol. Opt. Phys. 2008, 41, 095501. [Google Scholar]
  19. Peng, J.Y.; Luo, M.X.; Mo, Z.W.; Liu, H.W. Flexible deterministic joint remote state preparation of some states. Int. J. Quantum Inf. 2013, 11, 1350044. [Google Scholar] [CrossRef]
  20. Peng, J.Y.; Bai, M.Q.; Mo, Z.W. Joint remote state preparation of arbitrary two-particle states via GHZ-type states. Quantum Inf. Process. 2013, 12, 2325–2342. [Google Scholar] [CrossRef]
  21. Shukla, C.; Thapliyal, K.; Pathak, A. Hierarchical joint remote state preparation in noisy environment. Quantum Inf. Process. 2017, 16, 205. [Google Scholar] [CrossRef]
  22. Peng, J.Y.; Bai, M.Q.; Mo, Z.W. Joint remote state preparation of a four-dimensional quantum stste. Chin. Phys. Lett. 2014, 31, 010301. [Google Scholar] [CrossRef]
  23. Lv, S.X.; Zhao, Z.W.; Zhou, P. Multiparty-controlled joint remote preparation of an arbitrary m-qubit state with d-dimensional Greenberger-Horne-Zeilinger states. Int. J. Theor. Phys. 2018, 57, 148–158. [Google Scholar] [CrossRef]
  24. Zhang, D.; Zha, X.W.; Duan, Y.J.; Yang, Y.Q. Deterministic controlled bidirectional remote state preparation via a six-qubit entangled state. Quantum Inf. Process. 2016, 15, 2169. [Google Scholar] [CrossRef]
  25. 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]
  26. 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]
  27. Gu, J.R.; Liu, J.M. Deterministic controlled bidirectional remote state preparation in dissipative environments. Commun. Theor. Phys. 2022, 74, 075101. [Google Scholar] [CrossRef]
  28. Kimble, H.J. The quantum internet. Nature 2008, 453, 1023–1030. [Google Scholar] [CrossRef]
  29. Jiang, J.L.; Luo, M.X.; Ma, S.Y. The network capacity of entangled quantum Internet. IEEE J. Sel. Area Commun. 2024, 42, 1900–1918. [Google Scholar] [CrossRef]
  30. Luo, M.X. Computationally Efficient Nonlinear Bell Inequalities for Quantum Networks. Phys. Rev. Lett. 2018, 120, 140402. [Google Scholar] [CrossRef]
  31. Azuma, K.; Economou, S.E.; Elkouss, D.; Hilaire, P.; Jiang, L.; Lo, H.K.; Tzitrin, I. Quantum repeaters: From quantum networks to the quantum internet. Rev. Mod. Phys. 2023, 95, 045006. [Google Scholar] [CrossRef]
  32. Castelvecchi, D. The quantum internet has arrived (and it hasn’t). Nature 2018, 554, 289–292. [Google Scholar] [CrossRef]
  33. Luo, M.X. Fully device-independent model on quantum networks. Phys. Rev. Res. 2022, 4, 013203. [Google Scholar] [CrossRef]
  34. Chen, Y.X.; Du, J.; Liu, S.Y.; Wang, X.H. Cyclic quantum teleportation. Quantum Inf. Process. 2017, 16, 201. [Google Scholar] [CrossRef]
  35. Shao, Z.L.; Long, Y.X. Circular controlled quantum teleportation by a genuine seven-qubit entangled state. Int. J. Theor. Phys. 2019, 58, 1957–1967. [Google Scholar] [CrossRef]
  36. Verma, V. Symmetric and asymmetric cyclic controlled quantum teleportation via nine-qubit entangled state. Mod. Phys. Lett. B 2021, 35, 2150249. [Google Scholar] [CrossRef]
  37. Peng, J.Y.; Lei, H.X. Cyclic remote state preparation. Int. J. Theor. Phys. 2021, 60, 1593–1602. [Google Scholar]
  38. Zhang, C.Y.; Bai, M.Q.; Zhou, S.Q. Cyclic joint remote state preparation in noisy environment. Quantum Inf. Process. 2018, 17, 146. [Google Scholar] [CrossRef]
  39. Wang, M.M.; Yang, C.; Mousoli, R. Controlled cyclic remote state preparation of arbitrary qubit states. CMC-Comput. Mater. Contin. 2018, 55, 321–329. [Google Scholar]
  40. Houshm, M.; Jami, S.; Haghparast, M. General controlled cyclic remote state preparations and their analysis. Quantum Inf. Process. 2024, 23, 372. [Google Scholar] [CrossRef]
  41. Jiang, S.X.; Zhou, R.G.; Xu, R.Q.; Luo, G.F. Cyclic hybrid double-channel quantum communication via Bell-state and GHZ-state in noisy environments. IEEE Access 2019, 7, 80530–80541. [Google Scholar] [CrossRef]
  42. Sun, S.Y.; Zhang, H.S. Quantum double-direction cyclic controlled communication via a thirteen-qubit entangled state. Quantum Inf. Process. 2020, 19, 120. [Google Scholar] [CrossRef]
  43. Yu, Y.; Zhao, N. General quantum broadcast and multi-cast communications based on entanglement. Opt. Express 2018, 26, 29296–29310. [Google Scholar] [CrossRef] [PubMed]
  44. Peng, J.Y.; Liu, M.; Yang, Z.; Tang, L.; Tang, J.G. Double-direction cyclic controlled quantum communication of single-particle states. Phys. A Stat. Mech. Its Appl. 2023, 632, 129343. [Google Scholar] [CrossRef]
  45. Sun, S.Y.; Zhang, H.S. Double-direction quantum cyclic controlled remote state preparation of two-qubit states. Quantum Inf. Process. 2021, 20, 211. [Google Scholar] [CrossRef]
  46. Yuan, H.; Liu, Y.M.; Zhang, W.; Zhang, Z.J. Optimizing resource con sumption, operation complexity and efficiency in quantum-state sharing. J. Phys. B At. Mol. Opt. Phys. 2008, 41, 145506. [Google Scholar] [CrossRef]
  47. Yang, C.; Guo, G.C. Disentanglement-free state of two pairs of two-level atoms. Phys. Rev. A 1999, 59, 4217. [Google Scholar] [CrossRef]
  48. Deng, F.G.; Long, G.L.; Liu, X.S. Two-step quantum direct communication protocol using the Einstein-Podolsky-Rosen pair block. Phys. Rev. A 2003, 68, 042317. [Google Scholar] [CrossRef]
  49. Hu, M.L. Disentanglement, Bell-nonlocality violation and teleportation capacity of the decaying tripartite states. Ann. Phys. 2012, 327, 2332–2342. [Google Scholar]
  50. Jung, E.; Hwang, M.R.; Ju, Y.H.; Kim, M.S.; Yoo, S.K.; Kim, H.; Park, D.; Son, J.W.; Tamaryan, S.; Cha, S.K. Greenberger-Horne-Zeilinger versus W states: Quantum teleportation through noisy channels. Phys. Rev. A At. Mol. Opt. Phys. 2008, 78, 012312. [Google Scholar]
  51. Li, X.H.; Ghose, S. Control power in perfect controlled teleportation via partially entangled channels. Phys. Rev. A 2014, 90, 052305. [Google Scholar] [CrossRef]
  52. Li, X.H.; Ghose, S. Analysis of control power in controlled remote state preparation schemes. Int. J. Theor. Phys. 2017, 56, 667–677. [Google Scholar] [CrossRef]
  53. Ikram, M.; Zhu, S.Y.; Zubairy, M.S. Quantum teleportation of an entangled state. Phys. Rev. A 2000, 62, 022307. [Google Scholar] [CrossRef]
  54. Riebe, M.; Häffner, H.; Roos, C.F.; Hänsel, W.; Benhelm, J.; Lancaster, G.P.T.; Körber, T.W.; Becher, C.; Schmidt-Kaler, F.; James, D.F.V.; et al. Deterministic quantum teleportation with atoms. Nature 2004, 429, 734. [Google Scholar] [CrossRef] [PubMed]
  55. Boschi, D.; Branca, S.; Martini, F.D.; Hardy, L.; Popescu, S. Experimental realization of teleporting an unknown pur quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett. 1998, 80, 1121. [Google Scholar] [CrossRef]
Figure 1. The relationship between the three communicators and one supervisor. The blue and red lines with arrows represent the quantum states to be transmitted, while the green straight line with an arrow represents the transmission of supervisor information.
Figure 1. The relationship between the three communicators and one supervisor. The blue and red lines with arrows represent the quantum states to be transmitted, while the green straight line with an arrow represents the transmission of supervisor information.
Entropy 27 00292 g001
Figure 2. The quantum circuit for constructing the 25-qubit entangled channel, where H represents the Hadamard gate operation, and the solid black “·” and “⊕” together form a CNOT operation. The Hadamard gate is used to transform the qubit into a superposition state, while the CNOT gate is used to create entanglement between two qubits.
Figure 2. The quantum circuit for constructing the 25-qubit entangled channel, where H represents the Hadamard gate operation, and the solid black “·” and “⊕” together form a CNOT operation. The Hadamard gate is used to transform the qubit into a superposition state, while the CNOT gate is used to create entanglement between two qubits.
Entropy 27 00292 g002
Figure 3. The relationship between n communicators and one supervisor. The red and blue straight lines with arrows represent the quantum states to be transmitted, while the black straight line with an arrow represents the transmission of supervisor information.
Figure 3. The relationship between n communicators and one supervisor. The red and blue straight lines with arrows represent the quantum states to be transmitted, while the black straight line with an arrow represents the transmission of supervisor information.
Entropy 27 00292 g003
Table 1. Comparison of IE for DDC quantum communication schemes.
Table 1. Comparison of IE for DDC quantum communication schemes.
Scheme q t q c + b c ω ω
Ref. [44] (Single-particle)613 + 15 3 / 14 0.214
Ref. [44] (Multiparty) 2 n ( 4 n + 1 ) + 5 n 2 n / ( 9 n + 1 ) 2 / 9 0.222
the schemes in Section 2.21225 + 15 3 / 10 = 0.3
the schemes in Section 2.3 4 n ( 8 n + 1 ) + 5 n 4 n / ( 13 n + 1 ) 4 / 13 0.308
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Maihemuti, N.; Chen, Z.; Peng, J.; Aisan, Y.; Tang, J. Controlled Double-Direction Cyclic Quantum Communication of Arbitrary Two-Particle States. Entropy 2025, 27, 292. https://doi.org/10.3390/e27030292

AMA Style

Maihemuti N, Chen Z, Peng J, Aisan Y, Tang J. Controlled Double-Direction Cyclic Quantum Communication of Arbitrary Two-Particle States. Entropy. 2025; 27(3):292. https://doi.org/10.3390/e27030292

Chicago/Turabian Style

Maihemuti, Nueraminaimu, Zhanheng Chen, Jiayin Peng, Yimamujiang Aisan, and Jiangang Tang. 2025. "Controlled Double-Direction Cyclic Quantum Communication of Arbitrary Two-Particle States" Entropy 27, no. 3: 292. https://doi.org/10.3390/e27030292

APA Style

Maihemuti, N., Chen, Z., Peng, J., Aisan, Y., & Tang, J. (2025). Controlled Double-Direction Cyclic Quantum Communication of Arbitrary Two-Particle States. Entropy, 27(3), 292. https://doi.org/10.3390/e27030292

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