Probabilistic teleportation without loss of information
We found a scheme for teleporting probabilistically an unknown pure state with optimal probability and without losing the information of the state to be teleported. Accordingly, without having to have copies of the unknown state, the teleportation process can be repeated as many times as one has ava...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
4 February 2015
|
| In: |
Physical review. A, Atomic, molecular, and optical physics
Year: 2015, Volume: 91, Issue: 1 |
| ISSN: | 1094-1622 |
| DOI: | 10.1103/PhysRevA.91.012344 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1103/PhysRevA.91.012344 Verlag, lizenzpflichtig, Volltext: https://link.aps.org/doi/10.1103/PhysRevA.91.012344 
|
| Author Notes: | Luis Roa, Caspar Groiseau |
| Summary: | We found a scheme for teleporting probabilistically an unknown pure state with optimal probability and without losing the information of the state to be teleported. Accordingly, without having to have copies of the unknown state, the teleportation process can be repeated as many times as one has available quantum channels. Thus, although the quantum channels have a weak entanglement, teleportation is achievable with a high number of repetitions, whereas for channels with strong entanglement only a small number of repetitions are required to guarantee successful teleportation. |
|---|---|
| Item Description: | Published 30 January 2015, corrected 4 February 2015 Gesehen am 02.07.2020 |
| Physical Description: | Online Resource |
| ISSN: | 1094-1622 |
| DOI: | 10.1103/PhysRevA.91.012344 |