In this paper, we introduce optimal versions of a multi-port based teleportation scheme allowing to send a large amount of quantum information. We fully characterise probabilistic and deterministic case by presenting expressions for the average probability of success and entanglement fidelity. In the probabilistic case, the final expression depends only on global parameters describing the problem, such as the number of ports N, the number of teleported systems k, and local dimension d. It allows us to show square improvement in the number of ports with respect to the non-optimal case. We also show that the number of teleported systems can grow when the number N of ports increases as o(N) still giving high efficiency. In the deterministic case, we connect entanglement fidelity with the maximal eigenvalue of a generalised teleportation matrix. In both cases the optimal set of measurements and the optimal state shared between sender and receiver is presented. All the results are obtained by formulating and solving primal and dual SDP problems, which due to existing symmetries can be solved analytically. We use extensively tools from representation theory and formulate new results that could be of the separate interest for the potential readers.

In this paper, we discuss positive maps induced by (irreducibly) covariant linear operators for finite groups. The application of group theory methods allows deriving some new results of a different kind. In particular, a family of necessary conditions for positivity, for such objects is derived, stemming either from the definition of a positive map or the novel method inspired by the inverse reduction map. In the low-dimensional cases, for the permutation group S(3) and the quaternion group Q, the necessary and sufficient conditions are given, together with the discussion on their decomposability. In higher dimensions, we present positive maps induced by a three-dimensional irreducible representation of the permutation group S(4) and d-dimensional representation of the monomial unitary group MU(d). In the latter case, we deliver if and only if condition for the positivity and compare the results with the method inspired by the inverse reduction. We show that the generalised Choi map can be obtained by considered covariant maps induced by the monomial unitary group. As an additional result, a novel interpretation of the Fujiwara–Algolet conditions for positivity and complete positivity is presented. Finally, in the end, a new form of an irreducible representation of the symmetric group S(n) is constructed, allowing us to simplify the form of certain Choi–Jamiołkowski images derived for irreducible representations of the symmetric group.

No 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\geq 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.

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.