In this paper, two schemes for cyclic quantum teleportation (CQT) and cyclic controlled quantum teleportation (CCQT) in a high-dimension system are proposed. In the first scheme, three distant agents, Alice, Bob and Charlie, are not only the senders but also the receivers, and via the six-qutrit entangled state as the quantum channel, Alice can transfer her quantum information to Bob, at the same time, Bob can transfer his quantum information to Charlie and Charlie can transfer his quantum information to Alice. While for the second scheme, there is one controller David, and only with the help of him can the teleportation be accomplished via the seven-qutrit entangled state as the quantum channel. These schemes can be generalized to realize the teleportation with [Formula: see text] agents. Furthermore, the resource consumption and feasibility of the schemes are investigated at the end of the paper.
In this paper, two schemes for cyclic quantum teleportation (CQT) and cyclic controlled quantum teleportation (CCQT) in a high-dimension system are proposed. In the first scheme, three distant agents, Alice, Bob and Charlie, are not only the senders but also the receivers, and via the six-qutrit entangled state as the quantum channel, Alice can transfer her quantum information to Bob, at the same time, Bob can transfer his quantum information to Charlie and Charlie can transfer his quantum information to Alice. While for the second scheme, there is one controller David, and only with the help of him can the teleportation be accomplished via the seven-qutrit entangled state as the quantum channel. These schemes can be generalized to realize the teleportation with [Formula: see text] agents. Furthermore, the resource consumption and feasibility of the schemes are investigated at the end of the paper.
In order to explore multi-directional quantum communication in a three-dimensional (3D) system, five-, seven- and [Formula: see text]-qutrit entangled states are constructed by 3D-Hadamard gates and 3D-controlled-NOT gates in this paper. Then a new scheme of controlled bidirectional quantum teleportation (QT) via five-qutrit entangled channel is proposed, where two observers can exchange their unknown single-qutrit states at the same time under the control of the supervisor. Along this mental, we propose a novel theoretical scheme to fulfil four-party controlled cyclic QT by using a seven-qutrit entangled state as the quantum channel, in which Alice can teleport an arbitrary unknown single-qutrit state to Bob, Bob can transmit an arbitrary single-qutrit state to Charlie, at the same time, Charlie can also teleport an arbitrary unknown single-qutrit state to Alice with the permission of the supervisor. In these schemes, only specific two-qutrit 3D-Bell state measurements, single-qutrit 3D-Z-basis measurements and suitable 3D-Weyl operators are needed, which can be implemented in physics easily. Moreover, the proposed four-party controlled cyclic scheme can be generalized into the case containing [Formula: see text] ([Formula: see text]) observers by using a [Formula: see text]-qutrit entangled channel. Analysis shows that the success probability of our schemes can reach 1. Through detailed discussion, we find that the security of our schemes and the control power of the supervisors can be guaranteed, and the intrinsic efficiency of the proposed schemes is relatively high.
In this paper, by utilizing a nine-qubit entangled state as a quantum channel, we propose new schemes for symmetric and asymmetric cyclic controlled quantum teleportation (CYCQT). In our proposed schemes, four participants Alice, Bob, Charlie and David teleport their unknown quantum states cyclically among themselves with the help of a controller Eve. No participants can reconstruct the original states sent from the respective senders without the permission of the controller. Also, by considering same nine-qubit entangled state as a quantum channel, we propose a generalized scheme for CYCQT of multi-qubit states. In contrast to the previous CYCQT schemes involving three communicators and a controller, there are four communicators and a controller in the proposed schemes. Also, compared with previous CYCQT schemes, our proposed CYCQT schemes require less consumption of quantum resource and the intrinsic efficiency of the generalized scheme increases with the increase of number of qubits in the information states.
Following the work of Chen et al. [Quantum Inf. Process. 16, 201 (2017)] and Zhang [Mod. Phys. Lett. A 34, 1950290 (2019)], we propose a scheme for cyclic quantum teleportation (CYQT) in which three participants Alice, Bob and Charlie can teleport three arbitrary single-qubit information states cyclically among themselves by using GHZ-like states. Chen et al. and Zhang proposed schemes for CYQT and bidirectional quantum teleportation (BQT) involving three participants, respectively. In the scheme of Chen et al., the quantum teleportation (QT) can be realized successfully between any two participants without the help of third participants and in Zhang’s scheme, two unknown single-qubit states are teleported bidirectionally between two participants with the help of a third participant. On the other hand, in our proposed scheme, all the three participants are controller as well as sender and receiver. The teleportation processes Alice [Formula: see text] Bob, Bob [Formula: see text] Charlie and Charlie [Formula: see text] Alice are controlled by Charlie, Alice and Bob, respectively, and hence the CYQT could not be realized successfully without the cooperation of all three participants. If any one participant denies to cooperate with other two participants, then the CYQT cannot be realized successfully.
In this paper, two three-party cyclic teleportation schemes for real arbitrary quantum states of a single particle and two particles are proposed for the first time. In the first ([Formula: see text]) scheme, Alice sends any single particle state to Bob, Bob sends any two-particle states to Charlie, and meanwhile Charlie sends any single particle state to Alice. In the second ([Formula: see text]) scheme, with the help of the controller David, Alice sends any two-particle states to Bob, Bob sends any two-particle states to Charlie, and Charlie sends any single particle state to Alice simultaneously. Based on the maximum entangled quantum channel shared in advance, the communication participants carry out some Bell state measurement (BSM) measurements and carry out corresponding unitary transformation according to the results published by each other. After that, the cyclic teleportation of predetermined quantum information can be successfully realized. The success probability of teleportation of both schemes can reach 100%. Finally, this paper briefly analyzes the security of the two schemes and compares them with some previously published schemes from the perspective of inherent efficiency. The results show that the two schemes proposed in this paper are safe and have high inherent efficiency. Different from the previous symmetric cyclic quantum teleportation methods, the asymmetric cyclic quantum teleportation schemes proposed in this paper are more universal.
In the existing research on cyclic teleportation protocols, it is generally discussed that the teleportation of single particle, two particle unknown quantum states with symmetrical structure or asymmetric special unknown quantum states (such as GHZ state) with three or four participants. In contrast, the scheme proposed in this paper has universality and stronger practicability. In this paper, we propose a novel scheme of asymmetric cyclic controlled teleportation. In our scheme, Alice can teleport an arbitrary single-qubit entangled state to Charlie, Charlie can teleport an arbitrary three-qubit entangled state to Bob and at the same time Bob can teleport an arbitrary two-qubit entangled state to Alice under the control of a controller David. It only needs Bell measurement and local unitary operation, and can realize three-party cyclic transmission with probability 1 by using a quantum channel composed of any six of the 16 G states.
A scheme is proposed for cyclic-controlled quantum operation teleportation (CCQOT) for three sides with EPR and cluster states. Under the control of David, Alice can implement an unknown single-qubit unitary operation on the remote Bob’s quantum system, while Bob can execute a single-qubit unitary operation on Charlie’s quantum system and Charlie can also perform an unknown single-qubit unitary operation on Alice’s quantum system. Our scheme can be generalized to [Formula: see text]) agents involved in the cycle to realize the transmission of single-qubit operations. Moreover, by replacing the quantum channels, we can change the cyclic direction of controlled qunatum operation teleportation (CQOT) from clockwise to counterclockwise. In addition, we discuss our scheme in four types of noisy environments (amplitude-damping, phase-damping, bit-flip and phase-flip noisy environment), and use fidelity to analyze the amount of information lost in the process of CCQOT due to noise. The results show that the fidelity is determined by decoherence rate and amplitude parameters of the final state.