Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2310.16423 · Letters in Mathematical Physics

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

Marek Mozrzymas, Michał Horodecki, Michał Studziński

Published Apr 16, 2024• 1 citation
arXivHTMLPDF

Abstract

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)$$ S ( n - 1 ) ⊂ 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 in the natural basis of induced representation to the reduced one.

DOI
10.1007/s11005-024-01800-4

Related papers

A simplified formalism of the algebra of partially transposed permutation operators with applications

Marek Mozrzymas, Michał Studziński, Michał Horodecki

Abstract Herein we continue the study of the representation theory of the algebra of permutation operators acting on the n -fold tensor product space, partially transposed on the last subsystem. We develop the concept of partially reduced irreducible representations, which allows us to significantly simplify previously proved theorems and, most importantly, derive new results for irreducible representations of the mentioned algebra. In our analysis we are able to reduce the complexity of the central expressions by getting rid of sums over all permutations from the symmetric group, obtaining equations which are much more handy in practical applications. We also find relatively simple matrix representations for the generators of the underlying algebra. The obtained simplifications and developments are applied to derive the characteristics of a deterministic port-based teleportation scheme written purely in terms of irreducible representations of the studied algebra. We solve an eigenproblem for the generators of the algebra, which is the first step towards a hybrid port-based teleportation scheme and gives us new proofs of the asymptotic behaviour of teleportation fidelity. We also show a connection between the density operator characterising port-based teleportation and a particular matrix composed of an irreducible representation of the symmetric group, which encodes properties of the investigated algebra.

arXiv:1708.02434•Journal of Physics A Mathematical and Theoretical•Feb 6, 2018•23 citations

Efficient Multi Port-Based Teleportation Schemes

Michał Studziński, Marek Mozrzymas, Piotr Kopszak +1 more

In this manuscript we analyse generalised port-based teleportation (PBT) schemes, allowing for transmitting more than one unknown quantum state (or a composite quantum state) in one go, where the state ends up in several ports at Bob’s side. We investigate the efficiency of our scheme discussing both deterministic and probabilistic case, where parties share maximally entangled states. It turns out that the new scheme gives better performance than various variants of the optimal PBT protocol used for the same task. All the results are presented in group-theoretic manner depending on such quantities like dimensions and multiplicities of irreducible representations in the Schur-Weyl duality. The presented analysis was possible by considering the algebra of permutation operators acting on$n$systems distorted by the action of partial transposition acting on more than one subsystem. Considering its action on the$n-$fold tensor product of the Hilbert space with finite dimension, we present construction of the respective irreducible matrix representations, which are in fact matrix irreducible representations of the Walled Brauer Algebra. I turns out that the introduced formalism, and symmetries beneath it, appears in many aspects of theoretical physics and mathematics - theory of anti ferromagnetism, aspects of gravity theory or in the problem of designing quantum circuits for special task like for example inverting an unknown unitary.

arXiv:2008.00984•IEEE Transactions on Information Theory•Jul 5, 2022•22 citations

Port-based teleportation in arbitrary dimension

Michał Studziński, Sergii Strelchuk, Marek Mozrzymas +1 more

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.

arXiv:1612.09260•Scientific Reports•Sep 1, 2017•49 citations

Asymptotic Performance of Port-Based Teleportation

Matthias Christandl, Felix Leditzky, Christian Majenz +3 more

Abstract Quantum teleportation is one of the fundamental building blocks of quantum Shannon theory. While ordinary teleportation is simple and efficient, port-based teleportation (PBT) enables applications such as universal programmable quantum processors, instantaneous non-local quantum computation and attacks on position-based quantum cryptography. In this work, we determine the fundamental limit on the performance of PBT: for arbitrary fixed input dimension and a large number N of ports, the error of the optimal protocol is proportional to the inverse square of N . We prove this by deriving an achievability bound, obtained by relating the corresponding optimization problem to the lowest Dirichlet eigenvalue of the Laplacian on the ordered simplex. We also give an improved converse bound of matching order in the number of ports. In addition, we determine the leading-order asymptotics of PBT variants defined in terms of maximally entangled resource states. The proofs of these results rely on connecting recently-derived representation-theoretic formulas to random matrix theory. Along the way, we refine a convergence result for the fluctuations of the Schur–Weyl distribution by Johansson, which might be of independent interest.

arXiv:1809.10751•Communications in Mathematical Physics•Nov 20, 2020•30 citations

Efficient multi-port teleportation schemes

Michał Studziński, Marek Mozrzymas, Piotr Kopszak +1 more

In our work we propose a generalization of the port-based teleportation scheme, allowing for transmitting more than one unknown quantum state (or a composite quantum state) in one go, where the state ends up in several ports at Bob's side. We investigate the efficiency of our scheme discussing both deterministic and probabilistic case, where the resource state is maximally entangled. It turns out that the new scheme gives better performance than the optimal PBT protocol with the respective larger dimension of the port. We exploit the same number of maximally entangled states in the resource state as in the ordinary port-based teleportation with a number of measurements scaling polynomially in the number of shared maximally entangled states. To obtain our results, i.e. explicit expressions for the performance of the new scheme, we deliver novel mathematical tools concerning representation theory of the algebra of partially transposed permutation operators, where the transposition acts on more than one subsystem.

•Aug 3, 2020•7 citations

Group-Adapted Irreducible Matrix Units for the Walled Brauer Algebra

Michał Studziński, Tomasz Młynik, Marek Mozrzymas +2 more

This paper investigates the representation theory of the algebra of partially transposed permutation operators, $\mathcal{A}^d_{p,p}$, which provides a matrix representation for the abstract walled Brauer algebra. This algebra has recently gained significant attention due to its relevance in quantum information theory, particularly in the efficient quantum circuit implementation of the mixed Schur-Weyl transform. In contrast to previous Gelfand-Tsetlin type approaches, our main technical contribution is the explicit construction of irreducible matrix units in the second-highest ideal that are group-adapted to the action of $\mathbb{C}[S_p]\times \mathbb{C}[S_p]$ subalgebra, where $S_p$ is the symmetric group. This approach suggests a recursive method for constructing irreducible matrix units in the remaining ideals of the algebra. The framework is general and applies to systems with arbitrary numbers of components and local dimensions. In addition, we present a complementary construction method based on tensor networks of Clebsch-Gordan coefficients of the unitary group. This approach enables the construction of all group-adapted irreducible matrix units, but requires knowledge of certain Littlewood-Richardson coefficients. This method can be successfully applied for a reasonably small number of particles with the support of dedicated software. The obtained results are applied to a special class of operators motivated by the mathematical formalism appearing in all variants of the port-based teleportation protocols through the mixed Schur-Weyl duality. We demonstrate that the given irreducible matrix units are, in fact, eigenoperators for the considered class.

arXiv:2501.13067•Jan 22, 2025•0 citations
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)⊂S(n)S(n-1)\subset S(n)S(n−1)⊂S(n) S ( n - 1 ) ⊂ 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 in the natural basis of induced representation to the reduced one.
Abstract Herein we continue the study of the representation theory of the algebra of permutation operators acting on the n -fold tensor product space, partially transposed on the last subsystem. We develop the concept of partially reduced irreducible representations, which allows us to significantly simplify previously proved theorems and, most importantly, derive new results for irreducible representations of the mentioned algebra. In our analysis we are able to reduce the complexity of the central expressions by getting rid of sums over all permutations from the symmetric group, obtaining equations which are much more handy in practical applications. We also find relatively simple matrix representations for the generators of the underlying algebra. The obtained simplifications and developments are applied to derive the characteristics of a deterministic port-based teleportation scheme written purely in terms of irreducible representations of the studied algebra. We solve an eigenproblem for the generators of the algebra, which is the first step towards a hybrid port-based teleportation scheme and gives us new proofs of the asymptotic behaviour of teleportation fidelity. We also show a connection between the density operator characterising port-based teleportation and a particular matrix composed of an irreducible representation of the symmetric group, which encodes properties of the investigated algebra.
In this manuscript we analyse generalised port-based teleportation (PBT) schemes, allowing for transmitting more than one unknown quantum state (or a composite quantum state) in one go, where the state ends up in several ports at Bob’s side. We investigate the efficiency of our scheme discussing both deterministic and probabilistic case, where parties share maximally entangled states. It turns out that the new scheme gives better performance than various variants of the optimal PBT protocol used for the same task. All the results are presented in group-theoretic manner depending on such quantities like dimensions and multiplicities of irreducible representations in the Schur-Weyl duality. The presented analysis was possible by considering the algebra of permutation operators acting onnnnsystems distorted by the action of partial transposition acting on more than one subsystem. Considering its action on then−n-n−fold tensor product of the Hilbert space with finite dimension, we present construction of the respective irreducible matrix representations, which are in fact matrix irreducible representations of the Walled Brauer Algebra. I turns out that the introduced formalism, and symmetries beneath it, appears in many aspects of theoretical physics and mathematics - theory of anti ferromagnetism, aspects of gravity theory or in the problem of designing quantum circuits for special task like for example inverting an unknown unitary.
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.
Abstract Quantum teleportation is one of the fundamental building blocks of quantum Shannon theory. While ordinary teleportation is simple and efficient, port-based teleportation (PBT) enables applications such as universal programmable quantum processors, instantaneous non-local quantum computation and attacks on position-based quantum cryptography. In this work, we determine the fundamental limit on the performance of PBT: for arbitrary fixed input dimension and a large number N of ports, the error of the optimal protocol is proportional to the inverse square of N . We prove this by deriving an achievability bound, obtained by relating the corresponding optimization problem to the lowest Dirichlet eigenvalue of the Laplacian on the ordered simplex. We also give an improved converse bound of matching order in the number of ports. In addition, we determine the leading-order asymptotics of PBT variants defined in terms of maximally entangled resource states. The proofs of these results rely on connecting recently-derived representation-theoretic formulas to random matrix theory. Along the way, we refine a convergence result for the fluctuations of the Schur–Weyl distribution by Johansson, which might be of independent interest.
In our work we propose a generalization of the port-based teleportation scheme, allowing for transmitting more than one unknown quantum state (or a composite quantum state) in one go, where the state ends up in several ports at Bob's side. We investigate the efficiency of our scheme discussing both deterministic and probabilistic case, where the resource state is maximally entangled. It turns out that the new scheme gives better performance than the optimal PBT protocol with the respective larger dimension of the port. We exploit the same number of maximally entangled states in the resource state as in the ordinary port-based teleportation with a number of measurements scaling polynomially in the number of shared maximally entangled states. To obtain our results, i.e. explicit expressions for the performance of the new scheme, we deliver novel mathematical tools concerning representation theory of the algebra of partially transposed permutation operators, where the transposition acts on more than one subsystem.
This paper investigates the representation theory of the algebra of partially transposed permutation operators, Ap,pd\mathcal{A}^d_{p,p}Ap,pd​, which provides a matrix representation for the abstract walled Brauer algebra. This algebra has recently gained significant attention due to its relevance in quantum information theory, particularly in the efficient quantum circuit implementation of the mixed Schur-Weyl transform. In contrast to previous Gelfand-Tsetlin type approaches, our main technical contribution is the explicit construction of irreducible matrix units in the second-highest ideal that are group-adapted to the action of C[Sp]×C[Sp]\mathbb{C}[S_p]\times \mathbb{C}[S_p]C[Sp​]×C[Sp​] subalgebra, where SpS_pSp​ is the symmetric group. This approach suggests a recursive method for constructing irreducible matrix units in the remaining ideals of the algebra. The framework is general and applies to systems with arbitrary numbers of components and local dimensions. In addition, we present a complementary construction method based on tensor networks of Clebsch-Gordan coefficients of the unitary group. This approach enables the construction of all group-adapted irreducible matrix units, but requires knowledge of certain Littlewood-Richardson coefficients. This method can be successfully applied for a reasonably small number of particles with the support of dedicated software. The obtained results are applied to a special class of operators motivated by the mathematical formalism appearing in all variants of the port-based teleportation protocols through the mixed Schur-Weyl duality. We demonstrate that the given irreducible matrix units are, in fact, eigenoperators for the considered class.