Quantum mechanics shows superiority than classical mechanics in many aspects and quantum entanglement plays an essential role in information processing and some computational tasks such as quantum teleportation (QT). QT was proposed to transmit the unknown states, in which EPR pairs, the entangled states, can be used as quantum channels. In this paper, we present two simple schemes for teleporting a product state of two arbitrary single-particle and an arbitrary two-particle pure entangled state respectively. Alice and Bob have shared an entangle state. Two Bell states are used as quantum channels. Then after Alice measuring her qubits and informing Bob her measurement results, Bob can perfectly reconstruct the original state by performing corresponding unitary operators on his qubits. It shown that a product state of two arbitrary single-particle and an arbitrary two-particle pure entangled state can be teleported perfectly, i.e. the success probabilities of our schemes are both 1.
Quantum mechanics shows superiority than classical mechanics in many aspects and quantum entanglement plays an essential role in information processing and some computational tasks such as quantum teleportation (QT). QT was proposed to transmit the unknown states, in which EPR pairs, the entangled states, can be used as quantum channels. In this paper, we present two simple schemes for teleporting a product state of two arbitrary single-particle and an arbitrary two-particle pure entangled state respectively. Alice and Bob have shared an entangle state. Two Bell states are used as quantum channels. Then after Alice measuring her qubits and informing Bob her measurement results, Bob can perfectly reconstruct the original state by performing corresponding unitary operators on his qubits. It shown that a product state of two arbitrary single-particle and an arbitrary two-particle pure entangled state can be teleported perfectly, i.e. the success probabilities of our schemes are both 1.
In this paper, we present two different quantum teleportation schemes of an arbitrary single-particle, one is perfect teleportation and the other is probabilistic teleportation.In the first scheme, a four-particle maximally entangled state is used as the quantum channel.Besides, Bob needs to apply appropriate unitary transformations according to Alice's measurement results to recover the unknown state and the success probability is 1.In the latter scheme, the quantum channel is a four-particle non-maximally entangled state, which is a more general state.Furthermore, Bob needs to introduce an auxiliary qubit so that he can reconstruct the unknown state with the success probability of ( ).
It is shown that a maximally seven-qubit state can be utilized for perfect teleportation of arbitrary three qubit systems and controlled teleportation of an arbitrary three qubit state. For perfect teleportation, the sender first performs a Von-Neumann measurement on her qubits, then the sender(Alice) tells the measurement result to the receiver(Bob) via a classical channel, the receiver can reconstruct the original state by performing appropriate unitary transformations on his qubits at hand. For controlled teleportation, the sender firstly carries out proper Bell-state measurements and the controller(charlie) needs to operate a single-qubit measurement, the receiver can reconstruct the original state by applying appropriate unitary transformations on his qubits after he knows the measurement results of both the sender and controller. Besides, the two teleportation schemes can be realized with the maximal probability.
Quantum teleportation provides a way to transfer unknown quantum states from one system to another via an entangled state as a quantum channel without physical transmission of the object itself. The entangled channel, measurement performed by the sender (Alice), and classical information sent to the receiver (Bob) are three key ingredients in the procedure, which need to cooperate with each other. To study the relationship among the three parts, we propose a scheme for perfect teleportation of a qubit through a high-dimensional quantum channel in a pure state with two equal largest Schmidt coefficients. The scheme requires less entanglement of Alice's measurement but more classical bits than the original scheme via a Bell state. The two quantities increase with the entanglement of the quantum channel when its dimension is fixed and thereby can be regard as Alice's necessary capabilities to use the quantum channel. And the two capabilities appear complementary to each other.
Since the first protocol of quantum teleportation based on an EPR pair was presented by Bennett et al. in 1993, it has become a hot topic in quantum communication. It is known that entanglement plays a key role in quantum teleportation. Various schemes of controlled quantum teleportation and bidirectional controlled quantum teleportation have been developed by using all kinds of multi-parties entangled states as a quantum channel, e.g. GHZ states, W states, 5-qubit cluster states, 6-qubit cluster states, 7-qubit cluster states, maximally entangled 5-qubit states, maximally entangled 6-qubit states, genuine entangled 6-qubit states, genuine entangled 7-qubit states, genuine entangled 8-qubit states. In this paper, a genuine entangled 9-qubit state is used as channel of quantum teleportation, and two schemes of bidirectional controlled quantum teleportation are proposed. One scheme is that with the control of Charlie Alice can transmit an arbitrary unknown qubit state to Bob and Bob can transmit an arbitrary unknown 3-qubit state to Alice in the same time. Another scheme is that with the control of Charlie Alice and Bob can transmit an arbitrary unknown 2-qubit to each other simultaneously. Compared with the existed schemes, our scheme can transmit more qubits of arbitrary state in total by an entangled state, and the intrinsic efficiency of our scheme is maybe the best. Moreover, the genuine entangled 9-qubit state used in our scheme can be produced through some simple quantum unitary gates.
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.
This paper uses a special two-particle entangled state as a quantum channel to achieve invisibility unknown arbitrary two-particle quantum state teleportation. It makes contrast with Yuan, who makes use of χ-type entangled states to achieve two any unknown quantum state teleportation scheme. The scheme uses two sub-channels and Bell-based measurements, as well as special unitary operation successfully completing message teleportation. The program uses fewer resources,and the obtained probability of an original information is 1.