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

Abstract

In this paper, we present the 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 acting on $n$ systems is connected in a very simple way with the spectrum of the corresponding Jucys-Murphy operator for the symmetric group $S(n-1)\subset S(n)$. This shows on the technical level relation between teleporation and one of the basic objects from the point of view of the 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. In particular, we present a new expression for the eigenvalues of the Jucys-Murphy operators based on the irreducible characters of the symmetric group. As an additional but not trivial result, we give also purely matrix proof of the Frobenius reciprocity theorem for characters with explicit construction of the unitary matrix that realizes the reduction of the natural basis of induced representation to the reduced one.

arXiv comment17 pages, 5 figures, 1 table

References in corpus (18)

• 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
• Optimal probabilistic storage and retrieval of unitary channels
• Quantum communication complexity advantage implies violation of a Bell inequality
• Port-based teleportation in arbitrary dimension
• Optimal Port-based Teleportation
• Complexity and entanglement in non-local computation and holography
• Asymptotic performance of port-based teleportation
• Efficient multi port-based teleportation schemes
• Generalized teleportation and entanglement recycling
• Simplified formalism of the algebra of partially transposed permutation operators with applications
• Characterising port-based teleportation as a universal simulator of qubit channels
• Higher-dimensional performance of port-based teleportation
• Optimality of the pretty good measurement for port-based teleportation
• Optimal Multi-port-based Teleportation Schemes
• On subgroup adapted bases for representations of the symmetric group

Cited by in corpus (1)

• A resource theory of asynchronous quantum information processing