Searcharxiv⌕ Search

arXiv subjects

Marek Mozrzymas

Publications and source records attributed to Marek Mozrzymas.

At least 19 recordsLinked to original sources

Iterative construction of $\mathfrak{S}_p \times \mathfrak{S}_p$ group-adapted irreducible matrix units for the walled Brauer algebra

In this work, we present an algorithmic treatment of the representation theory of the algebra of partially transposed permutation operators, denoted by $\mathcal{A}^d_{p,p}$, which is a matrix representation of the abstract walled Brauer algebra. We provide an explicit and fully developed framework for constructing irreducible matrix units within the algebra. In contrast to the established earlier Gelfand-Tsetlin type constructions, the presented matrix units are adapted to the action of the subalgebra $\mathbb{C}[\mathfrak{S}_p] \times \mathbb{C}[\mathfrak{S}_p]$, where $\mathfrak{S}_p$ is the symmetric group. What is more, the basis is constructed in such a way that it produces the decomposition of the algebra into a direct sum of ideals, in contrast to its nested structure considered before. The decomposition of this kind has not been considered before in full generality. Our method reveals a recursive scheme for generating irreducible matrix units in all ideals of $\mathcal{A}^d_{p,p}$, offering a systematic approach that applies to small system sizes and arbitrary local dimensions. We apply the developed formalism to the algebra $\mathcal{A}^d_{2,2}$ and illustrate the algorithm in practice. In addition, using the constructed basis, we proved a novel contraction theorem for the elements from $\mathcal{A}^d_{3,3}$, which is the starting point for further investigations.

quant-ph↗

Group-Adapted Irreducible Matrix Units for the Walled Brauer Algebra

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.

quant-ph↗

Entanglement recycling in two-step port-based teleportation

A protocol involving the repetitive (twofold, to be precise) application of PBT protocol to the same resource is studied. The quantities characterizing the resulting protocol, so-called \textit{two-step PBT}, namely \textit{enatnglement fidelity} and \textit{success probability} are provided for two scenarios, relying on application of pretty-good measurement, i.e. deterministic and probabilistic PBT with non-EPR resource. This results show that two-step PBT is an accurate protocol, provided the resource is sufficiently large. In particular, the deterministic two-step PBT obtains fidelity that is remarkably close to the optimal MPBT fidelity for teleportation of two quantum states. Additionally, the \textit{recycling fidelity}, i.e. the quantity characterizing the degradation of the resource state is calculated for repetitive application of probabilistic protocol, for both EPR and optimized resource, showing that entanglement recycling with two-step PBT is possible in the former case as well.

quant-ph↗

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

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.

quant-ph↗

Efficient multi port-based teleportation schemes

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.

quant-ph↗

Square-root measurements and degradation of the resource state in port-based teleportation scheme

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.

quant-ph↗

Multiport based teleportation -- transmission of a large amount of quantum information

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.

quant-ph↗

Optimal Multi-port-based Teleportation Schemes

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.

quant-ph↗

Positive Maps From Irreducibly Covariant Operators

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.

quant-ph↗

Simplified formalism of the algebra of partially transposed permutation operators with applications

Hereunder 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 to simplify significantly previously proved theorems and what is the most important derive new results for irreducible representations of the mentioned algebra. In our analysis we are able to reduce complexity of the central expressions by getting rid of sums over all permutations from symmetric group obtaining equations which are much more handy in practical applications. We also find relatively simple matrix representations for the generators of underlying algebra. Obtained simplifications and developments are applied to derive characteristic of the deterministic port-based teleportation scheme written purely in terms of irreducible representations of the studied algebra. We solve an eigenproblem for generators of algebra which is the first step towards to hybrid port-based teleportation scheme and gives us new proofs of asymptotic behaviour of teleportation fidelity. We also show connection between density operator characterising port-based teleportation and particular matrix composed of irreducible representation of the symmetric group which encodes properties of the investigated algebra.

quant-ph↗

On Bipartite Operators Defined by Completely Different Permutations

We introduce a class of bipartite operators acting on $\mathcal{H} \otimes \mathcal{H}$ ($\mathcal{H}$ being an $n$-dimensional Hilbert space) defined by a set of $n$ Completely Different Permutations CDP. Bipartite operators are of particular importance in quantum information theory to represent states and observables of composite quantum systems. It turns out that any set of CDPs gives rise to a certain direct sum decomposition of the total Hilbert space which enables one simple construction of the corresponding bipartite operator. Interestingly, if set of CDPs defines an abelian group then the corresponding bipartite operator displays an additional property -- the partially transposed operator again corresponds to (in general different) set of CDPs. Therefore, our technique may be used to construct new classes of so called PPT states which are of great importance for quantum information. Using well known relation between bipartite operators and linear maps one use also construct linear maps related to CDPs.

math-ph↗

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 PBT scheme for fixed dimension in polynomial time.

quant-ph↗

Optimal Port-based Teleportation

Deterministic port-based teleportation (dPBT) protocol is a scheme where a quantum state is guaranteed to be transferred to another system without unitary correction. We characterize the best achievable performance of the dPBT when both the resource state and the measurement is optimized. Surprisingly, the best possible fidelity for an arbitrary number of ports and dimension of the teleported state is given by the largest eigenvalue of a particular matrix -- Teleportation Matrix. It encodes the relationship between a certain set of Young diagrams and emerges as the the optimal solution to the relevant semidefinite program.

quant-ph↗

Structure of irreducibly covariant quantum channels for finite groups

We obtain an explicit characterization of linear maps, in particular, quantum channels, which are covariant with respect to an irreducible representation ($U$) of a finite group ($G$), whenever $U \otimes U^c$ is simply reducible (with $U^c$ being the contragradient representation). Using the theory of group representations, we obtain the spectral decomposition of any such linear map. The eigenvalues and orthogonal projections arising in this decomposition are expressed entirely in terms of representation characteristics of the group $G$. This in turn yields necessary and sufficient conditions on the eigenvalues of any such linear map for it to be a quantum channel. We also obtain a wide class of quantum channels which are irreducibly covariant by construction. For two-dimensional irrreducible representations of the symmetric group $S(3)$, and the quaternion group $Q$, we also characterize quantum channels which are both irreducibly covariant and entanglement breaking.

quant-ph↗

Generalising Wigner's theorem

We analyse linear maps of operator algebras $\mathcal{B}_H(\mathcal{H})$ mapping the set of rank-$k$ projectors onto the set of rank-$l$ projectors surjectively. We give a complete characterisation of such maps for prime $n = \dim\mathcal{H}$. The solution is known for $k=l=1$ as the Wigner's theorem.

quant-ph↗

Separability Properties for a Class of Block Matrices

It is shown that, for the block matrices belonging to $M(nd,\mathbb{C})$ with commuting and normal block entries of dimension $d$, the separability of such a block matrices is equivalent to its semi-positive definity. The separability decomposition of lenght equal to the dimension of the block matrix (which is smaller then Carathéodory theorem implies) is given. The separability decomposition depends only on eigenvalues of block entries in the first part and on eigenvectors of the block entries in the second part of the tensor product. It is shown that semi-positive definity of considered block matrices is equivalent to semi-positive definity $d$ smaller matrices of dimension $n$.

quant-ph↗

Using non-positive maps to characterize entanglement witnesses

In this paper we present a new method for entanglement witnesses construction. We show that to construct such an object we can deal with maps which are not positive on the whole domain, but only on a certain sub-domain. In our approach crucial role play such maps which are surjective between sets $\mathcal{P}_{k}^d$ of $k \leq d$ rank projectors and the set $\mathcal{P}_1^d$ of rank one projectors acting in the $d$ dimensional space. We argue that our method can be used to check whether a given observable is an entanglement witness. In the second part of this paper we show that inverse reduction map satisfies this requirement and using it we can obtain a bunch of new entanglement witnesses.

quant-ph↗

Explicit constructions of unitary transformations between equivalent irreducible representations

Irreducible representations (irreps) of a finite group $G$ are equivalent if there exists a similarity transformation between them. In this paper, we describe an explicit algorithm for constructing this transformation between a pair of equivalent irreps, assuming we are given an algorithm to compute the matrix elements of these irreps. Along the way, we derive a generalization of the classical orthogonality relations for matrix elements of irreps of finite groups. We give an explicit form of such unitary matrices for the important case of conjugated Young-Yamanouchi representations, when our group $G$ is symmetric group $S(N)$.

math.RT↗