Square-root measurements and degradation of the resource state in port-based teleportation scheme

Abstract

Port-based teleportation (PBT) is a protocol of quantum teleportation in which a receiver does not have to apply correction to the transmitted state. In this protocol two spatially separated parties can teleport an unknown quantum state only by exploiting joint measurements on number of shared $d-$dimensional maximally entangled states (resource state) together with a state to be teleported and one way classical communication. In this paper we analyse for the first time the recycling protocol for the deterministic PBT beyond the qubit case. In the recycling protocol the main idea is to re-use the remaining resource state after one or many rounds of PBT for further processes of teleportation. The key property is to learn how much the underlying resource state degrades after every round of the teleportation process. We measure this by evaluating quantum fidelity between respective resource states. To do so we first present analysis of the square-root measurements used by the sender in PBT by exploiting the symmetries of the system. In particular, we show how to effectively evaluate their square-roots and composition. These findings allow us to present the explicit formula for the recycling fidelity involving only group-theoretic parameters describing irreducible representations in the Schur-Weyl duality. For the first time, we also analyse the degradation of the resource state for the optimal PBT scheme and show its degradation for all $d\ge 2$. In the both versions, the qubit case is discussed separately resulting in compact expression for fidelity, depending only on the number of shared entangled pairs.

References in corpus (26)

• Quantum Teleportation is a Universal Computational Primitive
• Experimental Realization of Teleporting an Unknown Pure Quantum State via Dual Classical and Einstein-Podolski-Rosen Channels
• Advances in Quantum Teleportation
• Quantum telecloning and multiparticle entanglement
• Programmable quantum gate arrays
• Novel schemes for measurement-based quantum computation
• Asymptotic teleportation scheme as a universal programmable quantum processor
• Simplified instantaneous non-local quantum computation with applications to position-based cryptography
• Fundamental limits to quantum channel discrimination
• Quantum teleportation scheme by selecting one of multiple output ports
• Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations
• Optimal probabilistic storage and retrieval of unitary channels
• Quantum communication complexity advantage implies violation of a Bell inequality
• Port-based teleportation in arbitrary dimension
• Quantum speedup in the identification of cause-effect relations
• Optimal Port-based Teleportation
• Optimization and learning of quantum programs
• Convex optimization of programmable quantum computers
• Asymptotic performance of port-based teleportation
• Generalized teleportation and entanglement recycling
• Simplified formalism of the algebra of partially transposed permutation operators with applications
• Structure and properties of the algebra of partially transposed permutation operators
• Characterising port-based teleportation as a universal simulator of qubit channels
• Generalization of port-based teleportation and controlled teleportation capability
• Multiport based teleportation -- transmission of a large amount of quantum information
• Optimal Multi-port-based Teleportation Schemes