Multiport based teleportation -- transmission of a large amount of quantum information

Abstract

We analyse the problem of transmitting a number of unknown quantum states or one composite system in one go. We derive a lower bound on the performance of such process, measured in the entanglement fidelity. The obtained bound is effectively computable and outperforms the explicit values of the entanglement fidelity calculated for the pre-existing variants of the port-based protocols, allowing for teleportation of a much larger amount of quantum information. The comparison with the exact formulas and similar analysis for the probabilistic scheme is also discussed. In particular, we present the closed-form expressions for the entanglement fidelity and for the probability of success in the probabilistic scheme in the qubit case in the picture of the spin angular momentum.

23 pages

References in corpus (5)

• Asymptotic teleportation scheme as a universal programmable quantum processor
• Quantum teleportation scheme by selecting one of multiple output ports
• Generalized teleportation and entanglement recycling
• Optimal Multi-port-based Teleportation Schemes
• Enumeration of Standard Young Tableaux

Cited by in corpus (10)

• Efficient multi port-based teleportation schemes
• Quantum information
• Optimality of the pretty good measurement for port-based teleportation
• Optimal Multi-port-based Teleportation Schemes
• On the Duality of Teleportation and Dense Coding
• Linear programming with unitary-equivariant constraints
• Teleportation of Post-Selected Quantum States
• Quantum Advantage in Storage and Retrieval of Isometry Channels
• Square-root measurements and degradation of the resource state in port-based teleportation scheme
• A resource theory of asynchronous quantum information processing