Generalized teleportation and entanglement recycling.

We introduce new teleportation protocols which are generalizations of the original teleportation protocols that use the Pauli group and the port-based teleportation protocols, introduced by Hiroshima and Ishizaka, that use the symmetric permutation group. We derive sufficient conditions for a set of operations, which in general need not form a group, to give rise to a teleportation protocol and provide examples of such schemes. This generalization leads to protocols with novel properties and is needed to push forward new schemes of computation based on them. Port-based teleportation protocols and our generalizations use a large resource state consisting of N singlets to teleport only a single qubit state reliably. We provide two distinct protocols which recycle the resource state to teleport multiple states with error linearly increasing with their number. The first protocol consists of sequentially teleporting qubit states, and the second teleports them in a bulk.

[1]  Serge Fehr,et al.  The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography , 2011, ArXiv.

[2]  Satoshi Ishizaka,et al.  Quantum teleportation scheme by selecting one of multiple output ports , 2009, 0901.2975.

[3]  Debbie W. Leung,et al.  Remote preparation of quantum states , 2005, IEEE Transactions on Information Theory.

[4]  Christoph Simon,et al.  Probabilistic instantaneous quantum computation , 2003 .

[5]  Gilles Brassard,et al.  Quantum information: The conundrum of secure positioning , 2011, Nature.

[6]  A. Winter,et al.  Randomizing Quantum States: Constructions and Applications , 2003, quant-ph/0307104.

[7]  Adrian Kent,et al.  Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints , 2010, ArXiv.

[8]  R. Werner.  All teleportation and dense coding schemes , 2000, quant-ph/0003070.

[9]  Rafail Ostrovsky,et al.  Position-Based Quantum Cryptography: Impossibility and Constructions , 2011, IACR Cryptol. ePrint Arch..

[10]  I. Chuang,et al.  Programmable Quantum Gate Arrays , 1997, quant-ph/9703032.

[11]  Satoshi Ishizaka,et al.  Asymptotic teleportation scheme as a universal programmable quantum processor. , 2008, Physical review letters.

[12]  Christoph Dankert,et al.  Exact and approximate unitary 2-designs and their application to fidelity estimation , 2009 .

[13]  Salman Beigi,et al.  Simplified instantaneous non-local quantum computation with applications to position-based cryptography , 2011, 1101.1065.

[14]  Isaac L. Chuang,et al.  Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations , 1999, Nature.

[15]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.