Quantum teleportation allows one to transmit an arbitrary qubit from point A to point B using a pair of (pre-shared) entangled qubits and classical bits of information. The conventional protocol for teleportation uses two bits of classical information and assumes that the sender has access to only one copy of the arbitrary qubit to be sent. Here, we ask whether we can do better than two bits of classical information if the sender has access to multiple copies of the qubit to be teleported. We place no restrictions on the qubit states. Consequently, we propose a modified quantum teleportation protocol that allows Alice to reset the state of the entangled pair to its initial state using only local operations. As a result, the proposed teleportation protocol requires the transmission of only one classical bit with a probability greater than one-half. This has implications for efficient quantum communications and the security of quantum cryptographic protocols based on quantum entanglement.
Quantum teleportation allows one to transmit an arbitrary qubit from point A to point B using a pair of (pre-shared) entangled qubits and classical bits of information. The conventional protocol for teleportation uses two bits of classical information and assumes that the sender has access to only one copy of the arbitrary qubit to be sent. Here, we ask whether we can do better than two bits of classical information if the sender has access to multiple copies of the qubit to be teleported. We place no restrictions on the qubit states. Consequently, we propose a modified quantum teleportation protocol that allows Alice to reset the state of the entangled pair to its initial state using only local operations. As a result, the proposed teleportation protocol requires the transmission of only one classical bit with a probability greater than one-half. This has implications for efficient quantum communications and the security of quantum cryptographic protocols based on quantum entanglement.
We proposed an N-qubit GHZ-like state quantum teleportation protocol using a two-qubit entangled quantum channel state assisted with only one classical bit. In this protocol, we use CNOT gates and a reset procedure, assuming the sender has many copies of the state that will be teleported. The CNOT gates can reduce the number of N-qubit to only one qubit, while the reset procedure may reduce the number of classical bits required to only one classical bit. Lastly, we show that the teleportation success probability depends on the state of the N-qubit state’s coefficients and is generally more than one-half.
Recently, there is much interest in the study of quantum teleportation. Its marvelous security property makes it particularly attractive as potential means for future communication. Uncertain principal and no-cloning theories of quantum mechanics forbid exact copy of quantum states. To solve the problem, quantum teleportation devides message state into two parts: classical message and quantum message which are transmitted through relevant classical and quantum channels from a sender Alice to a distant receiver Bob, respectively. According to both message states, Bob can recover the original message state with certain possibility. Utilizing the general quantum teleportation protocol, in this scheme, a new method is presented by which multi-qubit quantum information can be teleported in a much easier way. It has been extended to teleportation of an arbitrary N-qubit state via entanglement swapping and probabilistic teleportation is investigated as well, which has a more general meaning. N non-maximally entangled triplet GHZ states (Greenberger-Home-Zeilinger), taking the place of the previous EPR states (Einstein-Podolsky-Rosen), serve as quantum channels, which avoids introducing extra auxiliary qubit. In order to complete the teleportation, Alice has to devide all qubits into N parts and make Bell-State measurement on qubit pair (i, x(subscript i)) and tell Bob the measurement result through classical channel, then Bob perform some simple local operations on qubits (y(subscript i), z(subscript i)) to finish teleporting the i-th qubit. Conditioned on N-times similar repeat, Bob can faithfully reconstruct the initial state. Results show that, in this method, the identification difficulty of entangled states is considerably reduced, the new method is more feasible in technique. And the total possibility of successful teleportation is (The equation is abbreviated). As a special case, teleportation of an arbitrary two-qubit state is proposed.
Abstract In this study, we propose an encrypted quantum teleportation broadcast scheme using a 6-qubit entangled channel and an encrypted quantum teleportation scheme with a controller via a 7-qubit entangled channel. The quantum state of Alice, to be transmitted, is first encrypted into two distinct states that satisfy certain conditions. As the main sender, Alice designates two agents to transmit encrypted states to two receivers. She shares a 6-qubit entangled state with each party and provides the receivers with a 1-bit classical information containing the chosen encryption. After the agents perform measurements on the corresponding orthogonal bases and send the results to the receivers, each receiver can reconstruct the original state sent by Alice. To enhance security for the receivers, the scheme introduces Alice as a controller. The receivers can reconstruct the original state only if Alice performs a measurement and shares her measurement outcome. The use of encryption ensures that even if an agent’s qubit is intercepted, the actual state remains secure. Alice, as the controller, can also terminate the transmission if a security threat is detected or she change her mind to finish the transmission. The teleportation performance depends on how the qubit is encrypted. For a specific input state used as an example, the protocol obtained a teleportation success probability of 0.9608.
Classical teleportation is defined as a scenario where the sender is given the classical description of an arbitrary quantum state while the receiver simulates any measurement on it. This scenario is shown to be achievable by transmitting only a few classical bits if the sender and receiver initially share local hidden variables. Specifically, a communication of 2.19 bits is sufficient on average for the classical teleportation of a qubit, when restricted to von Neumann measurements. The generalization to positive-operator-valued measurements is also discussed.
Quantum teleportation provides a “bodiless” way of transmitting the quantum state from one object to another, at a distant location, using a classical communication channel and a previously shared entangled state. In this paper, we present a tripartite scheme for probabilistic teleportation of an arbitrary single qubit state, without losing the information of the state being teleported, via a fourqubit cluster state of the form | ϕ > 1234 = α |0000>+ β |1010>+ γ |0101>- η |1111>, as the quantum channel, where the nonzero real numbers α , β , γ , and η satisfy the relation j α j2 + | β | 2 + | γ | 2 + | η | 2 = 1. With the introduction of an auxiliary qubit with state |0>, using a suitable unitary transformation and a positive-operator valued measure (POVM), the receiver can recreate the state of the original qubit. An important advantage of the teleportation scheme demonstrated here is that, if the teleportation fails, it can be repeated without teleporting copies of the unknown quantum state, if the concerned parties share another pair of entangled qubit. We also present a protocol for quantum information splitting of an arbitrary two-particle system via the aforementioned cluster state and a Bell-state as the quantum channel. Problems related to security attacks were examined for both the cases and it was found that this protocol is secure. This protocol is highly efficient and easy to implement.
In this work, we consider two stages one qubit quantum teleportation protocol via an arbitrary entangled two qubits state. In the first stage, Alice use XOR gate and computational basis measurement, while for the second stage, Alice use Hadamard gate and another computational basis measurement. Alice sent measurement result to Bob via one classical bit each. As the result, we show that this teleportation can has unit fidelity if the channel used has non-zero two terms and maximally entangled. Then the protocol is applicable if the channel is one of four Bell's state.