Port-based teleportation in arbitrary dimension

Port-based teleportation (PBT), introduced in 2008, is a type of quantum teleportation protocol which transmits the state to the receiver without requiring any corrections on the receiver’s side. Evaluating the performance of PBT was computationally intractable and previous attempts succeeded only with small systems. We study PBT protocols and fully characterize their performance for arbitrary dimensions and number of ports. We develop new mathematical tools to study the symmetries of the measurement operators that arise in these protocols and belong to the algebra of partially transposed permutation operators. First, we develop the representation theory of the mentioned algebra which provides an elegant way of understanding the properties of subsystems of a large system with general symmetries. In particular, we introduce the theory of the partially reduced irreducible representations which we use to obtain a simpler representation of the algebra of partially transposed permutation operators and thus explicitly determine the properties of any port-based teleportation scheme for fixed dimension in polynomial time.

Quantum teleportation is one of the most important primitives in the Quantum Information Processing 1 . This technique allows to transfer the state of an unknown quantum system from the sender to the receiver without having to exchange the physical system. It has led to a large number of theoretical advances in quantum information theory and quantum computing [2][3][4][5][6][7][8][9] .
The first teleportation protocol involved two parties, Alice and Bob, each sharing a half of the maximally entangled state 1 . We will further refer to it as a 'resource state' . Alice wants to send an (unknown) state of a subsystem in her possession to Bob. She performs a projective measurement on her subsystem and the half of the maximally entangled state and communicates its classical outcome to Bob. He then reliably recovers the state which Alice communicated by applying a unitary correction operation conditioned on Alice's message.
In 2008, a breakthrough result from Ishizaka and Hiroshima introduced a novel port-based teleportation protocol (PBT) which does not require the last step in the sequence 10 . In this setup, parties share a large resource state consisting of N copies of the maximally entangled states Ψ − ⊗N , where each singlet is a two-qubit state, termed port. Alice performs a joint measurement X on the unknown state θ which she wishes to teleport and her half of the resource state, communicating the outcome to Bob. The outcome of the measurement points to the subsystem where the state has been teleported to. To obtain the teleported state Bob discards all ports except for the one indicated by Alice's outcome. There are two versions of the PBT protocol, depending on the exact set of measurements used by Alice. The first type, so-called deterministic teleportation, is described by the set of N POVM elements X = Π = { } a a N 1 . Upon measuring a-th element the teleported state ends up in the a-th port on Bob's side. He then traces out all but a-th subsystem which contains the teleported state. The second type, probabilistic PBT, consists of a measurement with N + 1 POVM elements Π = { } a a N 0 , where Π 0 indicates a failure of the teleportation. In this protocol, when Alice obtains the input ∈ … a N {1, , }, the parties proceed as above. When she obtains 0, then they abort the protocol.
In the probabilistic PBT the state of a qubit always gets teleported to Bob, but it decoheres during the process. The lower bound on the fidelity of the teleported state tends to 1 as the number of ports → ∞ N . In the deterministic case protocol, the state always gets teleported to Bob with perfect fidelity, but with some probability (which vanishes in the limit → ∞ N ) Alice aborts.
PBT schemes found novel applications in the areas where the existing teleportation schemes fell short of. They provided new architecture for the universal programmable quantum processor performing computation by teleportation with the property of it being composable 11 . In position-based cryptography, PBT schemes were used to engineer efficient protocols for instantaneous implementation of measurement and computation. It resulted in new attacks on the cryptographic primitives, reducing the amount of consumable entanglement from doubly exponential to exponential 12 .
Recently, the composable nature of the qubit PBT schemes made it possible to connect the field of communication complexity and a Bell inequality violation 13 . It allowed to show that any quantum advantage obtained by a protocol for an arbitrary communication complexity problem resulted in the violation of a Bell inequality, certifying the quantum nature of the advantage.
The full characterization of the qubit PBT schemes was used to obtain the performance of the square-root measurements for mixed states obtaining explicit probabilities of success when the set of states to be discriminated has certain symmetries and POVMs are of nearly maximal rank 12 .
Evaluating the performance of the PBT is tantamount to determining the spectral properties of the measurement operators X. To determine them, authors in ref. 10 viewed N + 1 qubits (with one extra qubit representing the teleported state) as spins, recursively building a basis for constituents of X making the use of the Clebsch-Gordan (CG) coefficients and with the painstaking amount of effort determined their eigenvalues. This approach has been successful for studying systems of N + 1 qubits and relied on the existence of the closed form for the CG coefficients and therefore was limited to ⊗ SU(2) N . In the case of ⊗ SU d ( ) N , with d > 2 there exists no closed form of the CG coefficients and thus it is impossible to obtain the spectrum of X without incurring an exponential overhead in d and N. It is however possible to obtain a closed-form lower bound on the performance of deterministic PBT, but it only works in the regime  N d. Moreover, no bound is known for the probabilistic PBT.
By using graphical variant of Temperley-Lieb algebra, authors obtained an explicit closed-form expressions for the fidelity and success probability of PBT for an arbitrary d and ∈ N {2, 3, 4} 14 . Here too the mathematical formulae contain the number of different terms which grows exponentially in N.
In our work we develop new mathematical tools to study the symmetries of X which enable us to efficiently evaluate the performance of any PBT scheme for arbitrary N and d. Our first contribution is the theory of the partially reduced irreducible representations (PRIR). They provide an elegant way of understanding the properties of subsystems of a large system which has general symmetries. We further use these techniques to provide a simple way to approach to the representation of the algebra of the partially transposed permutation operators. Remarkably, the operators describing measurements in any PBT scheme possess the exact symmetries of an element of this algebra. By exploring these symmetries in a principled way we are able to fully analyze all teleportation schemes.
We thus characterize the performance of the main PBT schemes and find exact expressions for the fidelity of the teleportation and the probability of success in the deterministic and probabilistic schemes respectively. Moreover, we describe the spectral properties of the POVMs and exhibit polynomial algorithms to efficiently calculate the properties of quantum systems with similar symmetries using our framework.

Setting and Main Results
In this section we introduce the setting and outline the results obtained by new mathematical techniques developed in our work.
Consider a probabilistic protocol defined by a d-dimensional maximally entangled resource state ⊗ |Φ 〉 a a between systems C and A a , and 1 A a is identity operator on all subsystems A except A a . We will henceforth refer to ρ as the PBT operator. Alice wishes to teleport a qudit θ C to Bob. After she measures X and communicates the classical outcome i to Bob, he performs one of the following actions: (a) if ∈ … i N {1, , } he traces out all but the i-th port which contains the teleported state with perfect fidelity; (b) if i = 0 he aborts. The schematic representation is shown in Fig. 1 is one-to-one correspondence between Young diagrams made up of n boxes and inequivalent irreps of the symmetric group S(n) we use symbols α, μ etc. interchangeably for Young diagrams and irreps whenever it is clear from the context. Probabilistic PBT. In this scheme the teleported state reaches the recipient with high probability and one distinguishes two different protocols each with perfect teleportation fidelity. In the first type we consider a resource state which consists of a number of maximally entangled states, and in the second type we obtain the resource state as well set of POVMs as a result of the optimization procedure. In the former case, the probability of success is given by Young diagrams  α − n 2 by adding a single box in a proper way and γ α µ ( ) is given in Proposition 2. In the latter case, the probability of success is given by

Theorem 4. The optimal state in the probabilistic PBT is given by
corresponding optimal probability is of the , where N is the number of ports, and d is the dimension of the local Hilbert space. Figure 2 depicts the success probability computed by our algorithm for both cases.
Deterministic PBT. The deterministic version of the PBT guarantees that the teleported state always reaches the recipient, but at a cost of being distorted. It is described by Tr 0 a is required to ensure that  . For simplicity, we take θ C to be a half of the maximally entangled state. As described in the introduction, the sender, Alice, performs a joint measurement Π = { } a a N 1 on θ C and her share of the resource state. She then communicates the classical outcome ∈ … i N {1, , } to Bob, who then traces out all but the i-th port which contains the teleported state.
The entanglement fidelity of the protocol for any ≥ d 2, ≥ N 2 is given by:

Theorem 12. The fidelity for Port-Based Teleportation is given by
, where sums over α and μ are taken, whenever number of rows in corresponding Young diagrams is not greater than the dimension of the local Hilbert space d.
From the entanglement fidelity computed in Theorem 12 one can easily obtain the average fidelity using Figure 3 shows the performance of the deterministic PBT when Alice wishes to teleport higher-dimensional states.
Discussion and open questions. We found explicit expressions for the performance of all variations of the PBT in arbitrary dimension with any number of ports. We expect the tools and techniques introduced here to find a number of applications ranging from the study of quantum states with restricted symmetries and calculating properties of the antiferromagnetic systems to problems in the quantum measurement theory.
Our successful approach to studying properties of the port-based teleportation may be replicated for the study of arbitrary systems with partial symmetries. First, one needs to classify the symmetries of the system ( − S n ( 1) and − S n ( 2) in the case of the PBT). Next, to identify and study the structure and the natural representation of the algebra corresponding to the elements with these symmetries ( d ( ) in the case of the PBT). Finally, to compute various tracial quantities of interest efficiently one needs to adjust the theory PRIRs to account for the symmetries of the system in question.
We now mention some open questions. Firstly, how to characterize entanglement content in the resource state after one run of any PBT protocol for d > 2. We know that in the qubit case the residual entanglement may be recycled to teleport more states 15 . In addition, when probabilistic PBT fails, Alice can nevertheless make use of the standard teleportation protocol reliably 16 . One might wonder if it is possible to similarly utilize the residual entanglement of the resource state in the qudit case. In particular, to show that such higher-dimensional teleportation scheme works one needs to extend our analysis to the properties of the left ideal S depicted in Fig. 4.
Second, for the probabilistic PBT protocol we have shown that the measurement operators are optimal for a fixed resource state of the form Φ + ⊗N . We do not know whether this holds for the deterministic PBT in our case. From refs 10, 11, 17 we know that for both the KLM scheme and the PBT protocols teleporting qubits, the resource state and the corresponding measurement differ when optimized simultaneously.
Another important problem is to determine the asymptotic performance of the PBT in arbitrary dimension. This presents a challenging task in particular because the asymptotic representation theory for the regime → d N / 0 is still in its infancy.

Methods
Structure of the port-based teleportation operator. In order to quantify the effect of measurement X one has to find the spectral properties of ρ. To simplify the analysis, we represent ρ in a different form. First, observe that every unnormalised projector + P CA a can be written as = a denotes a permutation operator between systems C and A a , and t C denotes a transposition with respect to subsystem C. Therefore, ρ in Eqn. (1) may be written in terms of partially transposed permutation operators:

Every element
acts as a permutation operator on a full = + n N 1-particle (we will use n − 1 and N interchangeably) When it is clear from the context, we denote every operator The above form enables us to identify ρ as the element of a recently studied algebra of partially transposed permutation operators  d ( ) decomposes into a direct sum of two types of left ideals (A left ideal of an algebra  is a subalgebra  where t n denotes a partial transposition on the n th subsystem, and (a, n) is a permutation between subsystems a and n. Here, the subsystem C is labelled by n. To evaluate the performance of the PBT scheme explicitly, we need to characterize the spectral properties of the above operator given in (3). For = d 2 and ≥ N 2 this was done in ref. 10 using the CG coefficients. The constraint for the dimension cannot be improved because the CG formalism does not admit closed-form solutions beyond = d 2. Our first contribution is the operator decomposition of η which leads to a universal decomposition method which works for all ≥ d 2 and ≥ N 2. Theorem 1. The operator η = ∑ = − V a n ( , ) a n t 1 1 n has the form: n n n n a n t where α, μ run over Young diagrams whose heights are not greater then the dimension d of a single system, µ α ∈ denotes a valid Young diagram μ obtained from α by adding one box in a proper way, µ α P P , denote Young projectors onto irreps of   V a n V n nV a n V a n PV n n V a n V a n E V n n V a n v ( , 1) ( 1, ) ( , 1) , and this results in the following decomposition: All of the structural properties above are derived solely from the properties of the underlying algebra, and are thus independent of representation. It is known that for any representation =  (10) or equivalently: (11) By α µ m m , we denote multiplicities of α, μ of S(n -2) S (n -1) respectively in the natural representation, by α µ d d , the respective dimensions, and by χ χ µ α (12), (12) the characters calculated on the transposition (12) of the corresponding irreps. By μ we denote Young diagrams obtained from Young diagrams α of n−2 boxes by adding a single box in a proper way. We take Young diagrams α,μ whose height is not greater then dimension d of the local Hilbert space.
Proof. From Theorem 1 we know that In the last step we need to compute η α µ Tr ( ). Using the decomposition given in equation (4) and Fact 20 from Appendix C we can simplify: Plugging (13) into (12) we obtain first statement of the proposition given in equation (10).
To prove (11) we use (12) and (13) express γ α µ ( ) as: Using Fact 19 from Appendix C to obtain the decomposition of P μ and simplifying it further we get: n m n a n V a n F P n m n d a n F P where Finally, using Corollary 18 from Appendix B we obtain the second statement of the proposition. Thus, the eigenvalues of the PBT operator ρ given in Eqn. (1) are the rescaled version of the above: N N Probabilistic version of the protocol. In the following two subsections we find maximal average success probability when a resource state is the maximally entangled state and then show how to find optimal resource state and POVMs simultaneously.
To prove the optimality in the above cases, we formulate the question as a semidefinite program. We prove the main theorems by presenting feasible solutions for a primal and a dual semidefinite problem. By establishing the solution to a primal problem we obtain an achievable lower bound for the success probability; the corresponding solution to the dual yields the upper bound. Observing that the respective bounds coincide we arrive at the optimal probability of success P opt .
Maximally entangled state as a resource state. From ref. 12 it follows that the optimal POVMs for the probabilistic PBT coincides with the ones for distinguishing the set of states  subject to: a n a n , , where = … − a n 1, , 1 , Ω acts on n systems the identity 1 is defined on n − 2 systems, and + P a n , is projector onto maximally entangled state between respective subsystems. We choose the operator Ω by a linear combination of the projectors α µ F ( ) defined in Theorem 1 where  µ − * n 1 denotes the Young diagram obtained from α Combining Lemma 4 with Lemma 6 we formulate the following proposition: are the optimal POVMs for the maximally entangled state as a resource state.
Optimisation over a resource state. We now turn to the case when both the optimal POVMs and a resource state are optimized simultaneously. We thus look for a set of POVMs Π = ⊗ Θ  , where N is the number of ports, and d is the dimension of the local Hilbert space.
We prove the above theorem by presenting feasible solutions to a primal (Lemma 9), auxiliary lemma (Lemma 10) and dual semidefinite problem (Lemma 11). Proofs can be found in Appendix G.4, G.5 and G.6 respectively. Defining again a feasible value of the primal problem as in (19), but with respect to constraints (25) we have. Lemma 9. The primal is feasible with , where N is the number of ports, and d is the dimension of the local Hilbert space.
The dual problem is of minimizing = 1 Tr 0, (28) a n a n n n N a , , 1 are defined on − n 2 and − n 1 systems respectively, and + P a n , is a projector onto maximally entangled state between respective subsystems. As in the case of the maximally entangled state we assume the general form of Ω to be given as a linear combination of the projectors α µ F ( ) defined in Theorem 1 where µ − n 1  denotes the Young diagram obtained from the Young diagram α − n 2  by adding one box in a proper way. From the definition of the constraints (28) and the symmetries of the projectors α µ F ( ) we calculate its partial trace in terms of µ P : Lemma 10. , where N is the number of ports, and d is the dimension of the local Hilbert space.
By combining Lemma 9 and Lemma 11 we find that = ⁎ ⁎ p p , so we conclude that Θ a for = … a N 1, 2, , given in (108) are the optimal POVMs with the optimal state given by (109), concluding the proof of Theorem 8.
One important consequence of Theorem 8 is that the optimal probability of success in probabilistic performance of port-based teleportation is given only in terms of 'global' parameters such as the number of ports N and the dimension of a local Hilbert space d, ≡ p p d N ( , ). Thus, for any fixed dimension d we get = →∞ p d N lim ( , ) 1 N , which shows that in the asymptotic limit our protocol achieves a unit success probability. Moreover, for fixed number of ports N we have . For simplicity, we take θ C to be a half of the maximally entangled state. As described in the introduction, the sender, Alice, performs a joint measurement Π = { } a a N 1 on θ C and her share of the resource state. The entanglement fidelity of the protocol for any ≥ d 2, N ≥ 2d ≥ 2, N ≥ 2 is given by: . In this proof P + is an unnormalized projector onto a maximally entangled state between − n ( 1)-th and n-th subsystem -we will use notation P + and − V n n ( 1, ) t n interchangeably. Using Theorem 1 we get: