In 2017, Chen et al. [Quantum Inf. Process. 16 (2017) 201] proposed a scheme for cyclic quantum teleportation (CYQT) of three single-qubit information states among three participants by using six-qubit entangled state as a quantum channel. Following the work of Chen et al., we propose a new scheme for CYQT in which four participants cyclically teleport four arbitrary single-qubit information states among themselves by using two [Formula: see text]-states as a quantum channel. In our scheme, reverse CYQT can also be realized throughout changing the qubit pairs to be measured by each participant. We also generalize our scheme for CYQT of [Formula: see text]-qubit entangled states.
In 2017, Chen et al. [Quantum Inf. Process. 16 (2017) 201] proposed a scheme for cyclic quantum teleportation (CYQT) of three single-qubit information states among three participants by using six-qubit entangled state as a quantum channel. Following the work of Chen et al., we propose a new scheme for CYQT in which four participants cyclically teleport four arbitrary single-qubit information states among themselves by using two [Formula: see text]-states as a quantum channel. In our scheme, reverse CYQT can also be realized throughout changing the qubit pairs to be measured by each participant. We also generalize our scheme for CYQT of [Formula: see text]-qubit entangled 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.
Abstract Cyclic quantum teleportation schemes requires at least the existence of three collaborators acting all as senders and receivers of quantum information, each one of them has an information to be transmitted to the next neighbour in a circular manner. Here, new cyclic quantum teleportation scheme is proposed for perfectly transmitting cyclically three arbitrary unknown two-qubit states ( α α , β β and γ γ ) among the three collaborators. In this scheme, Alice can send to Bob the quantum information contained in her two-qubit state α α and receive from Charlie the quantum information contained in the two-qubit state in his possession γ γ and similarly, Bob can transmit to Charlie the quantum information contained in his two-qubit state β β through a quantum channel of twelve-qubit state consisting of a six-qubit cluster state and a six-qubit entangled state by sequentially and cyclically performing Bell state measurements. Subsequently, each one of the three participants can afterwards retrieve his own desired two-qubit state using classical channel and by performing appropriate unitary Pauli operators and we have shown that our proposed scheme performs efficiently.
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.
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.
In this paper, we present a deterministic four-party quantum cyclic controlled teleportation (QCYCT) scheme, by using a multi-qubit partially entangled state as the quantum channel. In this scheme, Alice can teleport an arbitrary [Formula: see text]-qubit state to Bob, Bob can teleport an arbitrary [Formula: see text]-qubit state to Charlie and Charlie can teleport an arbitrary [Formula: see text]-qubit state to Alice under the control of the supervisor David. We utilize rotation gate, Hadamard gates and controlled-NOT (CNOT) gates to construct the multi-qubit partially entangled channel. Only Bell-state measurements, single-qubit von-Neumann measurement and proper unitary operations are required in this scheme, which can be realized in practice easily based on the present quantum experiment technologies. The direction of cyclic controlled teleportation of arbitrary multi-qubit states can also be changed by altering the quantum channel. Analysis demonstrates that the success probability of the proposed scheme can still reach 100% although the quantum channel is non-maximally entangled. Furthermore, the proposed four-party scheme can be generalized into the case involving [Formula: see text] correspondents, which is more suitable for quantum communication networks. We also calculate the intrinsic efficiency and discuss the security of the proposed scheme. Compared with the existing QCYCT schemes which realized cyclic controlled teleportation of arbitrary single-qubit states, specific two-qubit and three-qubit states, the proposed scheme is of general significance.
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.