From port-based teleportation to Frobenius reciprocity theorem: partially reduced irreducible representations and their applications

In this paper, we present a connection of two concepts as induced representation and partially reduced irreducible representations (PRIR) appear in the context of port-based teleportation protocols. Namely, for a given finite group G with arbitrary subgroup H , we consider a particular case of matrix irreducible representations, whose restriction to the subgroup H , as a matrix representation of H , is completely reduced to diagonal block form with an irreducible representation of H in the blocks. The basic properties of such representations are given. Then as an application of this concept, we show that the spectrum of the port-based teleportation operator is connected in a very simple way with the spectrum of the corresponding Jucys-Murphy operator for symmetric groups S ( m − 1 ) ⊂ S ( m ) - basic objects from the point of view of representation theory of the symmetric group. This shows a deep connection between the central object describing properties of deterministic PBT schemes and objects appearing naturally in the abstract representation theory of the symmetric group. As an additional but not trivial result, we give also purely matrix proof of the Frobenius reciprocity theorem for characters.


I. INTRODUCTION
Port-based teleportation (PBT) [1,2] is a remarkable protocol possessing a counter-intuitive emanating in that the teleported state requires no unitary correction and is ready for use after the sender performs a measurement and sends classical communication.No-unitary correction property has attracted wide attention from the community resulting in intensive research in the field of the PBT resulting in the development of quantum information theory.First, the PBT scheme offers a model of a universal programmable quantum processor [1], it gives a connection with quantum cryptography and instantaneous non-local computation [3].PBT protocols were instrumental in establishing a link between interaction complexity and entanglement in non-local computation and holography [4], between quantum communication complexity advantage and a violation of a Bell inequality [5], deriving fundamental bounds for quantum channels discrimination by designing PBT stretching protocols [6], and many other interesting results [7][8][9].Describing the efficiency of the PBT protocol was a very complex task and for a long time satisfactory description, in particular, a description in higher dimensions and asymptotic behavior was missing.Difficulties came mostly from the point of view of mathematical methods and much effort was put into optimizing the protocol and its variants by developing a proper mathematical tool-kit [10][11][12][13][14][15][16] and recently in [17].
In this paper, we start from Section II with a general description of the basic properties of PBT-operator, an object crucial for describing the efficiency of the deterministic PBT.We shortly remind its connection with the representation theory of the symmetric group.In particular, we focus on the aspect of the occurrence of induced representation and connection of the PBT-operator with Jucys-Murphy elements and partial transposition.We focus here also on the case of the multi-port-based teleportation protocols [18] where we have to consider many layers of the induction process.Next, in Section III we on the above-mentioned connection more formal.We present rigorously the concept of Partially Reduced Irreducible Representations (PRIRs) -a notion related to subgroup adapted basis [19] -and we discuss their properties and their role in induced representation.As an application of developed techniques, we show how the spectrum of famous Jucys-Murphy elements [20,21] acting on n − 1 systems is connected with the spectrum of the PBT operator acting on n systems.In particular, in Corollary 12 we present new expressions for the spectrum of the Jucys-Murphy of the symmetric group by use of the irreducible characters.In this regard in Proposition 10, we present fully analytical expressions for the mentioned eigenvalues, in the natural representation of the Jucys-Murphy elements, when the dimension of the underlying space is 2.This is possible, since then we have analytical expressions for corresponding irreducible characters which are labeled by Young frames with up to two rows, see Lemma 9.In the same section, we also contain, up to our best knowledge, a completely unknown previously orthogonality relation.It is contained in Proposition 3. Finally, we present purely matrix proof of the celebrated Frobenius reciprocity theorem for characters which was not known earlier in the literature.As an additional result, we give the explicit form of the unitary matrix U(β) which realizes the reduction of the natural basis of induced representation to the reduced one.These results are contained in Theorem 24, preceded by auxiliary considerations.

II. FROM PBT OPERATOR TO INDUCED REPRESENTATION AND PRIR
In this section, we will show (based on our previous papers) how the two concepts: the induced representation and PRIR appears in the context of port-based teleportation.We shall then show how this leads to the proof of the Frobenius reciprocity theorem for a subgroup of the symmetric group.

A. Algebra of the symmetric group and partial transposition
For the symmetric group S(n), we can define its natural representation V n d : S(n) → (C d ) ⊗n by the following action on the set of basis vectors {|i⟩} d i=1 , where d stand for the local dimension: The representation V n d (S(n)) is defined in a given basis of the space C d , so it is a matrix representation, and operators V n d (σ) just permute basis vectors according to the given permutation σ.Whenever the numbers n, d are clear from the context, we will write just simply V(σ) instead of V n d (σ) to simplify the notation.For later purposes, we can introduce a matrix algebra A d (n) spanned by the operators V(σ) as follows: The above matrix algebra is just a natural representation of an abstract algebra C[S(n)] of the symmetric group S(n).Having definition of the group algebra C[S(n)] in equation ( 2), we can naturally introduce the algebra of partially transposed operators with respect to the last subsystem A t n n (d) in the following way: Definition 1.For A n (d) := span C {V(σ) : σ ∈ S(n)} we define a new complex algebra where the symbol T n denotes the partial transposition with respect to the last subsystem in the space Hom((C d ) ⊗n ).
Definition 1 can be extended to a larger number of partial transpositions, see for example [17,18].The considered algebra A T n n (d) is in fact a matrix representation of a diagram algebra called walled Brauer algebra B δ p,q , where p, q ≤ 0, p + q = n, and δ ∈ C, introduced and analyzed in an abstract way in [22][23][24][25][26].The abstract algebra B δ p,q is composed of formal combinations of diagrams.Each diagram has two rows with p + q nodes, associated with a vertical wall between the first p and the last q nodes.These nodes are connected up in pairs in such a way that: 1. if both nodes are in the same row, they must lie on different sides of the wall, 2. if both nodes are in different rows, they must lie on the same side of the wall.We illustrate the above construction with the notion of composition of such diagrams in Figure 1.For any diagram from B δ p,q , the partial transposition T can be understood by exchanging the nodes on the right-hand side of the wall.This procedure is illustrated in Figure 2. To get matrix representation (3) we set p = n − 1, q = 1, and δ = d.In this case of two systems the following relation between transposition V((1, 2)) and unnormaalised projector on maximally entangled state P + = |ϕ + ⟩ 1,2 ⟨ϕ + | between systems 1 and 2: where |ϕ + ⟩ = ∑ d i=1 |i 1 ⟩|i 2 ⟩.This relation will be exploited extensively in the further parts of this manuscript.This particular case is illustrated on the diagram level also in Figure 3.

B. PBT operator and induced representation
One of the key ingredients of most of the results on port-based teleportation was understanding an operator that can be called PBT operator.For standard port-based teleportation it acts on n = N + 1 systems, where N is the number of shared ports, and it is of the form: where V(σ) is the operator that permutes systems according to permutation σ, P + = |ϕ + ⟩ N,N+1 ⟨ϕ + | is unnormalized projector on the unnormalized maximally entangled state between systems N and N + 1, and 1 ⊗N−1 is the identity operator on rest of the systems.
For generalization of the port-based teleportation for sending composite quantum systems [11,[28][29][30] the relevant operator is a direct generalization of the above one: where l is the number of systems to be teleported, and S(N) is the symmetric group over N elements.From Fig. 4 it is easy to see on what systems identities and are acting.The factor 1/(N − l)! is to remove overcounting.Thus the operator ρ is sum of operators, for which N − l systems are identity, while the other 2l are occupied by maximally entangled states.In [14] it was noted that the operator is tightly related to the notion of induced representation as well as with PRIR ("partially reduced irreducible representation").
To see how they arise, let us first notice how permutation from S(N) acts on the state.For each particular constituent of ρ an effect will be the following: the ends of maximally entangled states that lie to the left of the "wall" will be redistributed, and permuted, and the same happens to the free systems.Let us start with one  4).This is a special case of the walled Brauer algebra B δ p,q with p = q = 1 and δ = d, where d is the local dimension.constituent of the state -the one where all free systems are on the left: Let us split the identity into projectors onto irreps of S(N − l): where α are all irreps of S(N − l) which are present in the representation that permutes the "free" systems.Now, if we apply some permutation σ from S(N), then we see that P α is put to different systems, but still it becomes P α as it is invariant under permutations.The same happens to any other constituent of ρ.Thus we can split ρ into a direct sum of ρ α 's which instead of identity will have P α : with Thus ρ is block diagonal, and the blocks are subspaces H α , that are spanned by vectors of the form where i = 1, . . ., d α with d α being dimension of irrep α; σ ∈ S(N).However, in the above equation we have much more vectors than needed to span H α .Indeed, a permutation σ acting on |ϕ α i ⟩|ϕ + ⟩ ⊗l does the following: it changes the configuration of legs and applies some permutation on the free systems, see Fig. 5.
We see, that if we have some permutation σ then all other permutations σ ′ which have the same permutation on free systems are not needed -as the resulting vectors will have the same configuration of legs, and will differ only by permutation on free systems, which will enlarge dimension.Indeed on free systems, we have anyway full irrep basis, and permuting it we shall not go outside of the space.
Thus since we are not interested in action instead of all σ from S(N) it is enough to take only ones from transversal, the quotient S(N)/S(N − l), which we shall denote by t k , k = 1, . . ., N!/(N − l)!: We are now in a position to examine the action of our group S(N) on the space H α .For σ ∈ S(N) We write Now we use that there is unique element t p of transversal, which satisfies: where h ∈ S(N − l), so that However this is nothing but one of the definitions of the induced representation: it permutes elements of transversal, and applies an element from the subgroup to the irrep α (cf.( 68)) Thus we have seen that if we apply permutation σ ∈ S(N) to the total system, on the space H α it acts as the induced representation by irrep α.Such representation is reducible, and the Frobenius reciprocity theorem says that the multiplicity of each irrep µ is equal to the multiplicity of the so-called, reduced representation α in µ (see below for definition of reduced representation).

C. PRIR and proof of Frobenius theorem for symmetric group
Suppose now that we do not know the Frobenius theorem, and let us proceed with setting orthonormal basis in H α .Such basis was derived in [18] in the form of matrix basis, on space H α including multiplicity, which is given by m α -the multiplicity of irrep α in the natural representation of the symmetric group in N − l systems (by natural we mean that it is given by operators V(σ) which permute the systems, i.e. this is Schur-Weyl setup).To write it down we need a bit of preparation.First, for irrep µ of S(N) we define the natural representation of the matrix basis (or matrix units) for the irrep µ including multiplicities as follows Here φ µ ji (σ −1 ) are matrix elements of irrep of σ −1 ∈ S(N) and i, j = 1, . . ., d µ , where d µ is dimension of the irrep µ.Now consider subgroup S(N − l) ⊂ S(N).If in our irrep µ we restrict to this subgroup, we obtain representation called reduced representation.It is reducible, and let α labels its irreducible components within irrep µ, determining blocks.Further, each copy of irrep α can appear with multiplicity, which we shall denote by m α/µ .Now we can always assume that the basis in which the matrix elements of φ µ (σ) are written are chosen in such a way that the basis of ( 17) is compatible with the α blocks.This is what we call partially reduced irreducible representation.Now the label i µ can be alternatively written by means of a triple i µ = (α, r µ/α , i α ).Namely, the index α tells in which irrep α we are, the index r µ/α tells in which copy of irrep α we are, and finally, the index i α denotes the position in that copy (in the same way as i µ denotes position in irrep µ).One can use even shorter notation i µ = (r µ/α , i α ).We are now prepared to write the promised basis that appeared earlier in Theorem 11 [18] where m α is multiplicity of irrep α in natural representation of S(N − l) and and m µ , m ν are multiplicities of natural representation of S(N), and we have written one of the index of the operators E in the partially reduced notation: Here 1 α represents some arbitrarily fixed label -the operator does not depend on its choice.Now [18] the operator projects onto irrep µ within H α , which is the space for representation of S(N) induced by irrep α of its subgroup S(N − l).Thus we see here explicitly, how the indices r that originally count multiplicity of α within reduced representation of µ, now count multiplicity of µ within the induced representation.Equation ( 18) is a special case of the more general result presented in Theorem 1.4 in [31].This is just the contents of the Frobenius reciprocity theorem in the special case for the symmetric group.In the following, inspired by this example, we shall prove the Frobenius reciprocity theorem for general group and subgroup.

D. Duality between induced and reduced representation via PBT operator versus Jucys-Murphy operator for l = 1
The dualism of reduced and induced representation manifested by the Frobenius theorem is indeed very directly seen in our above derivation of the theorem.In this section, we shall present this dualism in yet another way.To do so let us define the Jucys-Murphy operator [20,21,32], which in the natural representation, is given by where V((a, N)) are as before operators that permute N systems according to permutation (a, N).It is clear from its definition that the operator J N belongs to the matrix algebra A N (d) defined through (2).Due to the discussion presented in Section II A, the operator J N is the matrix representation of the element from the Brauer algebra B d N .The Jucys-Murphy elements play an important role in the representation theory of the symmetric group.In principle, they have found an application to an alternative approach in the construction of irreducible representations of S(n) called Okounkov-Vershik approach [32][33][34].The spectrum of the Jucys-Murphy elements is known and discussed for example in Section 4.5 of [17].Now let us consider the operator J N+1 and apply to it partial transpose on (N + 1)−th system.Now, since the partially transposed swap operator is equal to dP + we see that PBT operator ρ is just a partially transposed Jucys-Murphy operator on N + 1 systems Clearly, the above operator belongs to the algebra of partially transposed permutation operators A T N+1 N+1 (d) defined through Definition 1.In other words, the operator ρ is the matrix representation of the element from the walled Brauer algebra B d N,1 , according to the discussion presented in Section II A. The eigenvalues of this operator were found in [12] and are given by operator eigenvalue multiplicity collects relations between the eigenvalues of Jucys-Murphy operator J N and partially transposed Jucys-Murphy operator (J N+1 ) T N+1 , or equivalently the PBT operator ρ, see (22).We see that the spectrum of ρ is just shifted by d spectrum of the Jucys-Murphy element J N .Notice that operators ρ and J N are defined for the different number of systems, i.e. they differ by one system.Here µ labels irreps of S(N) that can be induced from irreps α of S(N − 1).
and multiplicity of the eigenvalue is d µ m α .In the rest of the paper, we shall find eigenvalues of ordinary Jucys-Murphy operator J N (see Corollary 16).They are given by and multiplicity of the eigenvalue is m µ d α .We have summarised this in Table I The discussion in the previous section shows how the multiplicity for transposed Jucys-Murphy element ρ = (J N+1 ) T N+1 is related to induced representation.Namely, m α term in multiplicity comes from the fact that space H α is labeled by α, which repeats m α times.And the multiplicity m µ comes from the fact, that ρ is invariant under µ, hence by Schur lemma, is proportional to identity on irreps of µ.
Similarly, it is easy to understand the opposite formula for the multiplicity of the Jucys-Murphy operator J N .First, since it is a combination of permutations, it is a direct sum over irreps µ with multiplicity m µ .Next, within irrep µ, it is constant on irrep α of subgroup S(N − 1), hence we have term d α .

we have a coset decomposition
where the last decomposition of g ∈ G is unique.Now, let us consider an arbitrary unitary irreducible representation (irrep) ψ µ of G, which also will be denoted briefly as µ ∈ G where the latter is the set of all irreps of the group G.The irrep ψ µ can be always unitarily transformed to a partially reduced form, such that where α labels the type of irrep of H and a α is a number of irrep type α in the decomposition (26), and 26) is not unique.We will assume that irreps φ β(b β ) of subgroup H are identical, i.e. we have Definition 2. A unitary matrix irrep ψ µ of G, with partially reduced form (26), i.e. which on the subgroup H has block diagonal form, we call Partially Reduced Irreducible Representation (PRIR).
From the above, it follows that the diagonal blocks in the decomposition (26) are labeled and in fact ordered by the index α(a α ) and inside diagonal blocks the matrix elements are labelled by indices j α = 1, . . ., dim φ α = d α of irrep φ α(a α ) of the subgroup H, which is included in irrep ψ µ of G, so in matrix notation we have The block structure of this reduced representation allows us to introduce such a block indexation for irrep ψ µ for all elements of where the indices k µ , l µ are standard matrix indices, so in PRIR the standard matrix indices are replaced by indexation directly connected with irreps of subgroup H included in irrep ψ µ of G.Note that the diagonal blocks are square, whereas the off-diagonal blocks in general need not be square.Thus we see that PRIR ′ s have two main features: 1.They are partially reduced on subgroup H.
Note that in definition of PRIR we do not assume that Res ↓ G H (ψ µ ) is simply reducible, which is important because it allows us to give a new proof of the Frobenius reciprocity theorem (see Thm. 24).Actually, if we have an inclusion chain of subgroups so that each inclusion is multiplicity-free, then we obtain a chain of PRIRs which are multiplicity-free, which leads to the well-known Gelfand-Tsetlin basis.As said, we are interested in PRIR that is not necessarily multiplicity-free.As a matter of fact, PRIR is strictly related to subgroup adapted basis [19].The latter is the basis in the irreducible representation of a group whose elements are basis vectors from individual irreps of the subgroup (which are subspaces of the irrep of the group).Now PRIR is simply irreducible representation of the group written in subgroup-adapted basis.On the level of matrices, this is equivalent to saying that PRIRs are block diagonal on the subgroup as in eq. ( 26).
The above-introduced indexation of PRIRs is more complicated than the standard one but, for example, it allows to derive some important new relations among matrix elements of PRIRs which would be difficult to rewrite in standard indexation -see Proposition 3 below).
Using equation (28) we get From this, it follows that multiplication by a matrix representing elements of subgroup H is simpler than in non-PRIR representations.Now we may formulate the first important property of PRIRs, which is a kind of orthogonality relation for matrix elements of transversal T.

Proposition 3. Suppose that
Then the matrix elements of PRIR ′ s ψ µ R and ϕ ν R of G satisfy the following sum rule where The proof is based on the classical orthogonality relations for irreps, which in PRIR notation takes the form which means, that even if α = γ, i.e. these representations are of the same type, but a α ̸ = c γ , the RHS of ( 33) is equal to zero.Similarly, if the indices b β , b ′ β which enumerate irreps β are not equal, then RHS of ( 33) is equal to zero.This follows from the fact that in the classical orthogonality relations if corresponding indices of irreps are not equal, then the RHS of the orthogonality relations is equal to zero, and in PRIR notation the irreps φ α of subgroup H and their indices i α play the role of indices in irrepss ψ µ R .The next part of the proof is a simple generalization of the proof of Proposition 17 in [14].
Remark 4 From the form of LHS of equation (33) in the thesis of Proposition 3, in particular from the fact that the second sum in LHS runs over a lower part of multi-index ( i.e. on RHS we have a block diagonal matrix, such that the diagonal blocks are unit matrices multiplied by numbers η µ (α).
These numbers do not depend on the form of PRIR ψ µ R , i.e. for all possible choices of PRIR representation, satisfying the above assumptions, these numbers are the same.
Proof.We give here a sketch of the proof.The assumption of simple reducibility and condition (34) together with classical Schur Lemma for irreps implies that equation (35) must hold.This result is easy to see due to the PRIR blocks indexation of PRIR ψ µ R .From Proposition 5 we get immediately: and the numbers η µ (α) form the spectrum of the operator ψ µ R (Υ).Multiplicity of eigenvalue η µ (α) is equal to dim φ α = d α .Decomposing arbitrary representation Ψ of the group G into PRIR ′ s ψ µ R and using Proposition 5 we get the spectral decomposition of the transversal operator Ψ(Υ).

As an important example of application of
where χ µ is the character of ψ µ R and χ α s the character of φ α .We see that numbers η µ (α) depend only on the pure characteristics of irreps Proof.The starting point in this proof is the following equation where 1 d µ is the unit matrix of dimension d µ and on LHS we have the sum of all transpositions in S(n) which forms an equivalence class.This equation follows from the fact that the famous Schur lemma implies that the sum of all elements of any the equivalence class of an arbitrary group in any irrep is proportional to the unit matrix.
Taking trace we derive the coefficient of proportionality.Next we rewrite LHS as follows so in the second sum on RHS the summation is over all equivalence class of transpositions but in the subgroup S(n − 1).Therefore, from definition of PRIRs matrix of the second sum is block diagonal matrix and in the diagonal blocks we have irreps of S(n − 1) included in ψ µ R .Again from the Schur lemma we get in each diagonal block in the last sum for any irrep φ α of S(n − 1) included in ψ µ R , so we see that diagonal blocks in matrix ∑ n−1 a<b (ψ µ R )(ab) are also diagonal.Shifting the diagonal matrix ∑ n−1 a<b (ψ µ R )(ab) on RHS of the first equation we get the result.In the above proof, we see that the defining property of PRIRs, i.e. partial reduction plays an essential role in it.Example 8 In the simplest case, i.e. for identity irrep µ = id, we have In general the above formulae for eigenvalues η µ (α) of the transversal operator Υ are not entirely analytical because for natural characteristics of irreps characters χ µ and corresponding dimension d µ there are not analytical expressions.However, for particular irreps of group S(n) there exists purely analytical formulae for these quantities.Namely, we have Lemma 9 (see [35]).
2 n be a two-row partition of irrep of S(n), then and where where Using Lemma 9 and expressions (45), (46), we derive purely analytical formulae for the eigenvalues of the transversal operator Υ in two rows PRIRs of the group S(n).
2 n be a two row partition of irrep of S(n), then 1.If n − k > k the transversal operator Υ = ∑ a=1,...,n (an) takes in PRIR ψ µ k diagonal form with two different eigenvalues , and a=1 (an) is called Jucys-Murphy element (JM element) in the group algebra C[S(n)] and together with reduced JM element J k = ∑ k−1 a=1 (ak), k = 2, . . ., n it plays an important role in the representation theory of symmetric group S(n) [20,21,33,36].
In general, calculating analytically the spectrum of JM elements in the group algebra C[S(n)] is not easy (see [36]).Using Proposition 5 together with the above example we get Corollary 12.In any PRIR ψ µ R of the symmetric group S(n) we have the following spectral decomposition JM operator J n = ∑ n−1 a=1 (an) where and multiplicity of the eigenvalue γ µ (α) is equal to d α .
Again, knowing the spectrum of the operator J n in any PRIR, one can determine the spectrum of J n in any representation.As an example let us consider the natural permutation representation of symmetric as it is defined in (1).It is known [35] that then for d = 2, we have the following where m id = n + 1, and m µ k = n − 2k + 1 are the multiplicities of corresponding irreps which are assumed to be PRIRs.Now using the above results we may derive the spectrum of the J M operator in the natural representation V n d=2 .
Proposition 13.The spectrum of the operator V n d=2 (J n ) acting in the space (C 2 ) ⊗n is the following 1.If µ k = id, then with multiplicity n + 1.
, and It is well known that any group algebra C[G] (G is finite) has the following decomposition into irreps where m µ = dim ψ µ .From this and Corollary 12 we get: Proposition 14.The spectrum of JM element J n = ∑ n−1 a=1 (an), acting on the group algebra C[S(n)], i.e in regular representation is given by numbers γ µ (α) and multiplicity of eigenvalue γ µ (α) is equal to m µ d α .
We see that by using the PRIR concept one can express the eigenvalues of the JM element J n = ∑ n−1 a=1 (an) via characters of irreps of the groups S(n) and S(n − 1), which are basic characteristics of irreps.Their multiplicities are also expressed by basic group representation parameters.Obtained expressions for the spectrum of the JM elements are of a different nature than in [33,34,36].
One very efficient application of PRIR concept was dedicated studies on PBT-operator in deterministic portbased teleportation scheme, see ( 5) and ( 7).Hereunder we use original notation and we denote the total number of systems (number of ports + teleported state) by n, while the number of ports by N, and we have of course n = N + 1.The algebraic structure of the port-based teleportation scheme is connected with the algebra of partially transposed operators A t n n (d) acting in n-fold tensor product of d−dimensional vector space.This algebra is not isomorphic (except when d = 2) with standard permutational representation of symmetric group S(n) in the Schur-Weyl construction.Due to the application of properties of PRIR's it was possible to derive elegant expression for the spectrum of PBT-operator and to derive entanglement fidelity for deterministic PBT-scheme in all variants.The result for the mentioned eigenvalues are contained in [12,14].Proposition 15.The eigenvalues λ µ (α) of PBT-operator with N = n − 1 ports are of the following form In this way, we get, from PBT formalism, another (up to our best knowledge not known earlier) expression for the spectrum of the JM element J n−1 .Another expression for the numbers η µ (α), so also for the eigenvalues γ µ (α) of J n−1 , is given in [14].
Remark 17 Note that although we have very simple relation between PBT operator ρ and JM operator J n : the spectrum of the operator ρ is in very simple 'shift' relation with the spectrum of the 'shorter' JM operator J n−1 , see equation (57).Let us remind basic properties of the regular representation of a group algebra C[G] for finite a finite group G.
Proposition 18.Let ψ µ be any irrep (not necessarily PRIR) of a finite group G, then the operators have the following properties where Now we consider, in the regular representation of the group algebra C[G], a construction of induced representation Ind ↑ G H (φ α ), where φ α ∈ H is an arbitrary irrep of the subgroup H ⊂ G.We have (for simplicity we omit label β in indices i, j): Proposition 19.Consider the standard matrix algebra generated by the irrep φ β = (φ β ij ) ∈ H (here for simplicity we write omit label β in indices i, j) and the transversal T = {t k : k = where the summation over t p ∈ T is taken over such t p ∈ T, that t −1 p gt k ∈ H [37]. From the uniqueness of coset decomposition, eq.(25) we get that such an element t p ∈ T is unique and we have t Now it is well known that the induced representation Ind ↑ G H (φ α ) of the group G is in general reducible.It appears that the reduction of Ind ↑ G H (φ α ) onto the direct product of irreps of the group G may be achieved using PRIR ′ s.Using such a PRIR matrices ψ µ R we define the following matrices Definition 21.Let φ β ∈ H be an irrep and all and it is known that if a matrix is unitary with respect to the columns, then it is also unitary with respect to the rows, so the matrix U( where it is enough to use the definition of the matrix operators E (see Eq. ( 65)) together with equation (30).The second part of Theorem 24 is the famous Frobenius reciprocity theorem [36,38].This classical theorem is usually proved using group character properties and this proof seems to be the simplest.Our proof of the theorem is technically much more complicated, but its first result gives in eq.(77) a unitary matrix U(β) which realizes the reduction of the natural basis of induced representation to the reduced one, and this is the most complicated part of our proof.To our knowledge, this is a new result.The standard, character proof of the Frobenius theorem does not give such representation reduction (via unitary matrix) because that proof is independent of matrix form of considered representations (which is obtained by use of character theory).The second statement of Theorem 24, i.e. the Frobenius theorem itself is a relatively simple corollary from the multi-index structure of the matrix U(β).

IV. DISCUSSION
In this paper we discuss the appearance of induced representation in port-based teleportation protocols, focusing on its deterministic version.First, we define the concept of partially reduced irreducible representation for an arbitrary group G and its subgroup H and discuss the most important properties of the introduced concept.This part is presented on the most possible abstract level, i.e. we do not restrict ourselves to a specific choice of the group G. Afterward, we choose G to be a symmetric group S(n) with subgroup H = S(n − 1) -groups naturally appearing in all variants of the PBT.This restriction allows us to show the relation between basic objects for representation theory for the symmetric group, so-called Jucys-Murphy elements, and the PBT operator ρ.In particular, we prove a linear connection between the spectra of these two objects, presenting two different expressions.Spectra of the JM element J n−1 and n−particle PBT operator are related by a simple shift by factor d. In particular, we give new expression for the eigenvalues of the Jucys-Murphy elements based on the irreducible character of the symmetric group, and new orthogonality relations exploiting the concept of PRIRS.In the special case, when one considers the natural representation of Jucys-Murphy elements in dimension 2, we present fully analytical expressions for the mentioned spectrum.Evaluated spectra are crucial in determining entanglement fidelity in deterministic PBT schemes.At the end, we present a matrix proof of the famous Frobenius reciprocity theorem for characters, and we give the explicit construction of the unitary matrix that realizes the reduction of the natural basis of induced representation to the reduced one.

FIG. 1 : 2 .FIG. 2 :
FIG.1:The left-hand side graphic presents an element from the walled Brauer algebra B δ 3,2 .On the right-hand side, we illustrate the composition of two diagrams σ, π ∈ B δ 3,2 .When we identify a closed loop (red color), we multiply the resulting diagram by a scalar δ ∈ C. We see that the resulting composition σπ also belongs to B δ 3,2 .

FIG. 3 :
FIG. 3: Graphic illustrates on the diagram-level relation given in equation (4).This is a special case of the walled Brauer algebra B δ p,q with p = q = 1 and δ = d, where d is the local dimension.

FIG. 4 :
FIG. 4: For l = 1 the operator ρ is a sum of the depicted operators in (a); here N = 4.For l > 1, ρ is the sum of operators of type of those depicted in (b).Here N = 7 and l = 3.

Proposition 7 .
PRIRs we have the following: Let G = S(n) and H = S(n − 1) with standard transversal T = {(an) : a = 1, . . ., n}, which satisfy the assumptions of Proposition 5. Then for any PRIR ψ µ R of the group S(n) we have n

Corollary 16 .
where d α , d µ are dimensions of irreps ψ µ ∈ S(n − 1), φ α ∈ S(n − 2) and m µ , m α are corresponding multiplicities is the standard swap representation of S(n − 1) and S(n − 1) respectively.Comparing Proposition 15 with Corollary 12 we get The eigenvalues λ µ (α) of PBT-operator with N = n − 1 ports and eigenvalues γ µ (α) of Jucys-Murphy element J n−1 are related in a very simple way λ µ (α) − d = (n − 1) is a direct sum of non-isomorphic matrix algebras and for any fixed j = 1, . . .,d µ set of d µ vectors E µ ij : i = 1, . . ., d µ form a basis of irrep ψ µ contained in C[G].Each subalgebra E µ contains d µ such irreps.If the ψ µ ∈ C[G] are PRIR ′ s, then we may rewrite the expressions from Proposition 18 as follows so the left multi-index R = µ β α(a α ) b β l α , which includes four indices, runs over all µ β , over PRIR indices α(a α ), l α inside PRIR ′ s ψ µ β R , as well over index b β , which enumerates the copies of the irrep φ β in ψ µ β R .The right muli-index L = t k k β runs over the natural indices of the induced representation Ind

Proposition 22 .
) Matrix U(β) is determined by irrep φ β ∈ H because, by assumption irrep φ β determines all irreps µ β ∈ G, which must satisfy φ β ∈ Res ↓ G H (ψ µ R ).Note that the matrix U(β) is not proportional to some PRIR ′ s matrix ψ µ(β) R , the coefficients of the matrix U(β) are equal to corresponding coefficients of the different matrices ψ µ(β) R .In general the matrices U(β) and ψ µ(β) R have different dimension.Directly from Definition 21 and the sum rule for PRIRs in Proposition 3 we get The matrix U(β) is unitary with respect to the induced multi-indices I = t k k β , i.e. we have

)
are standard matrix operators of the group algebra C[G], defined by the irrep ψ µ R in the PRIR version included in I β j β , the representation Ind ↑ G H (φ β ).Proof.In order to prove the equation |G| |H| d

FromTheorem 24 . 2 .
equation (74) in Lemma 23 we see that each irrep φ β(b β ) of H, where β(b β ) = 1, . . ., j β is fixed) with basis vectors indexed by the left pair of PRIR indices α(a α ) l α in the element (E µ ) α(a α )β(b β ) l α j β and this correspondence is one-to-one from the invertibility of the matrix U(β).From this as a corollary we get Let φ β ∈ H, I β j β ⊂ C[G] be the corresponding representation space for Ind ↑ G H (φ β ) with natural basis {t p E β k β j β } and U(β) be an unitary PRIR matrix determined by φ β , then 1. the transformation of the natural basis of the representation Ind ↑ G H (φ β ) in C[G] to the reduced one is realised by the PRIR unitary matrix U(β) in the following way U(β) : t k E β i β j β from this one can deduce the following decomposition of the induced representations Ind ↑ G H (φ β ) = representation Ind ↑ G H (φ β ) with multiplicity equal to the multiplicity m µ β of irrep φ β in Res ↓ notation is essential to formulate and prove this result.Next result concerns properties of the transversal T = {t k : k = 1, . . ., |G| |H| ≡ s} of the subgroup H ⊂ G and transversal element Υ = ∑ s k=1 t k in the group algebra C[G].It is well known that any irrep of any group G is also an irrep the corresponding group algebra C[G], so we may use the concept of PRIR ′ s in the group algebra.Suppose that {t k } is any transversal of a group G with respect to subgroup H (25), ψ s 1, . . ., |G| |H| ≡ s}, then for any fixed value of j = 1, . . ., d β , the sd β vectors −1p gt k = h = h k ∈ H so the above equation may written equivalently ∀g ∈ G g.t k E where gt k = t p h k is the unique coset decomposition.Thus we see that the main feature of the induced representation is that the action of g ∈ G on basis vectors {t k E β ij } permutes the transversal vectors {t k : k = 1, ...,|G||H| ≡ s} and transforms vectors {Eβ ij : i = 1, . .., d β } (j is fixed) according irrep φ β .= 1, . .., d β , j β = 1, . .., d β (69)are representation spaces for representation Ind ↑ G H (φ β ).From the above we get Corollary 20.We have the following decomposition of algebra ⊂ C[G]with fixed label j β = 1, d β , a representation space for Ind ↑ G H (φ β ), which in general, as representation of G is reducible.It appears that matrix U(β) realize reduction of natural basis Let φ β ∈ H be an irrep and let us fix label j β = 1, . . ., d β .Then the unitary matrix U(β) transforms the natural basis {t k E ⊂ C[G], representation space for Ind ↑ G H (φ β ) onto a reduced basis of this representation space, that is we have β) : φ β ∈ H is unitary and has dimension d β |G| |H| .