We proposed a scheme of teleported arbitrary four-qubit states from four participants cyclically. In this scheme, Alice sends an arbitrary qubit state to Bob. Bob sends an arbitrary qubit to Charli. At the same time, Charli sends his arbitrary qubit state to David while David sends his arbitrary qubit state to Alice. The teleportation scheme is carried out cyclically via a nine-qubit entangled channel with Eve’s assistance as a controller and Bell’s measurements.
We proposed a scheme of teleported arbitrary four-qubit states from four participants cyclically. In this scheme, Alice sends an arbitrary qubit state to Bob. Bob sends an arbitrary qubit to Charli. At the same time, Charli sends his arbitrary qubit state to David while David sends his arbitrary qubit state to Alice. The teleportation scheme is carried out cyclically via a nine-qubit entangled channel with Eve’s assistance as a controller and Bell’s measurements.
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 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, 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.
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.
A novel scheme is proposed in this paper, which realizes the cyclic and bidirectional teleportation via pseudo multi-qubit entangled states. To realize the teleportation completely, it utilizes controlled-NOT operation to obtain a quantum channel whose number of qubits reaches twelve. In this scheme, Alice can teleport her qubits to Bob and Charlie, Bob can teleport his qubits to Alice and Charlie while Charlie teleports his qubits to Alice and Bob, respectively, they reconstruct the original state and make the scheme perfectly by performing Bell-state measurement and appropriate unitary operation.