2008/10/31 by Joanna Modlawska, Joanna Modławska, Andrzej Grudka
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physreva.79.064302
published as Phys. Rev. A 79, 064302 (2009) · 4 pages, 1 figure
openalex publication_date 2009/06/05 · arxiv created 2009/06/07 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We consider multiple teleportation in the Knill-Laflamme-Milburn (KLM) scheme. We introduce adaptive teleportation, i.e., such that the choice of entangled state used in the next teleportation depends on the results of the measurements performed during the previous teleportations. We show that adaptive teleportation enables an increase in the probability of faithful multiple teleportation in the KLM scheme. In particular if a qubit is to be teleported more than once then it is better to use nonmaximally entangled states than maximally entangled ones in order to achieve the highest probability of faithful teleportation.