Quantum teleportation requires 2 cbits to be sent from Alice to Bob in order to transmit an {\\em unknown} qubit provided they share an entangled EPR pair. Classical teleportation requires 2.19 cbits to be sent from Alice to Bob in order to transmit a {\\em known} qubit provided they share local hidden variables. We show that there is a simple scheme which requires 1 cbit to be sent from Alice to Bob for transmitting a {\\em known} qubit provided they share an entangled EPR pair. This suggests that the classical teleportation should be compared with the present scheme for comparing the cbit cost (1.19 cbits more) and the use of entanglement versus local hidden variables.
Quantum teleportation requires 2 cbits to be sent from Alice to Bob in order to transmit an {\em unknown} qubit provided they share an entangled EPR pair. Classical teleportation requires 2.19 cbits to be sent from Alice to Bob in order to transmit a {\em known} qubit provided they share local hidden variables. We show that there is a simple scheme which requires 1 cbit to be sent from Alice to Bob for transmitting a {\em known} qubit provided they share an entangled EPR pair. This suggests that the classical teleportation should be compared with the present scheme for comparing the cbit cost (1.19 cbits more) and the use of entanglement versus local hidden variables.
A scheme to teleport an unknown two qubit state from Alice (the sender) to Bob (the receiver) using two Einstein Podolsky Rosen (EPR) pairs is presented, each EPR pair being shared by both Alice and Bob. Firstly, Alice combines each of the two particles in the teleported state with an EPR particle and makes Bell state measurement on each combination. Then she transmits the outcomes of her measurements to Bob classically. According to Alice′s measurement results, Bob can perform appropriate unitary operations on his two EPR particles to retrieve the initial state.
We investigate whether it is possible to teleport the coherence of an unknown quantum state from Alice to Bob by communicating a lesser number of classical bits in comparison to what is required for teleporting an unknown quantum state. We find that we cannot achieve perfect teleportation of coherence with one bit of classical communication for an arbitrary qubit. However, we find that if the qubit is partially known, i.e., chosen from the equatorial and polar circles of the Bloch sphere, then teleportation of coherence is possible with the transfer of one cbit of information when we have maximally entangled states as a shared resource. In the case of the resource being a non-maximally entangled state, we can teleport the coherence with a certain probability of success. In a general teleportation protocol for coherence, we derive a compact formula for the final state at Bob's lab in terms of the composition of the completely positive maps corresponding to the shared resource state and joint POVM performed by Alice on her qubit and the unknown state. Using this formula, we show that teleportation of the coherence of a partially known state with real matrix elements is possible perfectly with the help of a maximally entangled state as a resource. Furthermore, we explore the teleportation of coherence with the Werner states and show that even when the Werner states become separable, the amount of teleported coherence is non-zero, implying the possibility of teleportation of coherence without entanglement.
We investigate whether it is possible to teleport the coherence of an unknown quantum state from Alice to Bob by communicating a smaller number of classical bits in comparison to what is required for teleporting an unknown quantum state. We find that we cannot achieve perfect teleportation of coherence with one bit of classical communication for an arbitrary qubit. However, we find that if the qubit is partially known, i.e., chosen from the equatorial and polar circles of the Bloch sphere, then teleportation of coherence is possible with the transfer of one cbit of information when we have maximally entangled states as a shared resource. In the case of the resource being a nonmaximally entangled state, we can teleport the coherence with a certain probability of success. In a general teleportation protocol for coherence, we derive a compact formula for the final state at Bob's laboratory in terms of the composition of the completely positive maps corresponding to the shared resource state and a joint positive operator-valued measure (POVM) performed by Alice on her qubit and the unknown state. Using this formula, we show that teleportation of the coherence of a partially known state with real matrix elements is perfectly possible with the help of a maximally entangled state as a resource. Furthermore, we explore the teleportation of coherence with Werner states and show that even when Werner states become separable, the amount of teleported coherence is nonzero, implying the possibility of teleportation of coherence without 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.
Summary form only given. Characterizing the entanglement of a general bipartite quantum system is a difficult problem. Most measures involve difficult extremizations and their physical motivation is not always clear. In this paper we propose an experimental measure of entanglement based on a modified version of the familiar teleportation protocol of Bennett et al. (1993). Briefly, teleportation traditionally involves two parties, Alice and Bob. Initially, Alice has a qubit in an unknown quantum state which she would like to communicate to Bob and Bob has two qubits in an entangled Einstein-Podolsky-Rosen (EPR) pair. To accomplish this transfer, Bob shares one qubit of his EPR pair with Alice. She then performs a joint measurement or Bell measurement on her two qubits and relays this information back to Bob over a classical channel. Bob then uses the outcome of Alice's Bell measurement to transform his qubit, with a local unitary transformation, into the original quantum state, always with a fidelity of one.
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.