# Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels.

@article{Bennett1993TeleportingAU, title={Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels.}, author={Bennett and Brassard and Cr{\'e}peau and J{\'o}zsa and P{\'e}r{\`e}s and Wootters}, journal={Physical review letters}, year={1993}, volume={70 13}, pages={ 1895-1899 } }

An unknown quantum state \ensuremath{\Vert}\ensuremath{\varphi}〉 can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical Einstein-Podolsky-Rosen (EPR) correlations. To do so the sender, ``Alice,'' and the receiver, ``Bob,'' must prearrange the sharing of an EPR-correlated pair of particles. Alice makes a joint measurement on her EPR particle and the unknown quantum system, and sends Bob the classical result of this measurement. Knowing this…

## 9,503 Citations

### Activating hidden teleportation power: Theory and experiment

- Physics
- 2021

Ideal quantum teleportation transfers an unknown quantum state intact from one party Alice to the other Bob via the use of a maximally entangled state and the communication of classical information.…

### Quantum Teleportation and Quantum Computation Based on Cavity QED

- Physics
- 1995

Recently, Bennett et al. I have proposed a scheme for "teleporting" an unknown quantum state by splitting it up into a purely classical channel and a purely quantum channel. The quantum channel…

### DESCRIBING QUANTUM TELEPORTATION OF MIXED STATES WITH CONTINUUM VARIABLES BY THE ENTANGLED STATE REPRESENTATION

- Physics
- 2010

By virtue of the entangled state representation, we show that the quantum teleportated state in Bob, after Alice makes an Einstein–Podolsky–Rosen measurement and Bob makes an appropriate unitary…

### Quantum Information Teleportation without Entanglement: Non-Zero Quantum Discord Suffices

- Physics
- 2011

We present a method to teleport the quantum information contained in a single qubit via shared quantum correlations that are weaker than the usual requirement of strong entanglement. A two-qubit,…

### All-quantum teleportation

- Physics
- 2017

I propose to replace the dual classical and nonlocal channels used for teleporting unknown quantum states in the original protocol (OP) [Bennett, C. H., et al. Phys. Rev. Lett. 70 1895 (1993)] by…

### Multi-state Quantum Teleportation via One Entanglement State

- Physics
- 2008

A multi-sender-controlled quantum teleportation scheme is proposed to teleport several secret quan- tum states from different senders to a distance receiver based on only one Einstein-Podolsky-Rosen…

### Probabilistic Controlled Teleportation of Two-Particle Entangled State via the Optimal Quantum State

- Computer Science
- 2013

Via a non-maximally entangled state as the optimal quantum channel, the probabilistic controlled teleportation of two-particle anti-correlation entangled state of GHZ state is discussed.

### Teleportation of N-Particle Entangled GHZ State via Entanglement Swapping

- Physics
- 2006

In this scheme, N non-maximally entangled particle pairs are used as quantum channel to teleport an unknown N-particle entangled GHZ state via entanglement swapping. In order to realize this…

### Experimental Realization of Continuous Variable Teleportation

- Physics
- 2002

In quantum teleportation, Alice and Bob neatly circumvent constraints that would otherwise be imposed on Alice's state measurement and Bob's state generation, and are thereby able to reconstruct the original state at Bob’s place.

### Probabilistic teleportation of an arbitrary GHZ-class state with a pure entangled two-particle quantum channel and its application in quantum state sharing

- Physics
- 2007

This paper presents a scheme for probabilistic teleportation of an arbitrary GHZ-class state with a pure entangled two-particle quantum channel. The sender Alice first teleports the coefficients of…

## References

SHOWING 1-5 OF 5 REFERENCES

### Oracle Quantum Computing

- Computer ScienceWorkshop on Physics and Computation
- 1992

Oracles are constructed relative to which there is a decision problem that can be solved with certainty in worst-case polynomial time on the quantum computer, yet it cannot be solved classically in probabilistic expected polynometric time if errors are not tolerated.

### Physics (Long Island City

- N. Y.) 1, 195 (1964); J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, Phys. Rev. Lett. 23, 880
- 1969

### Found

- Phys. 1, 23
- 1970

### Nature (London) 299

- 802
- 1982