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:1508.00860

How to combine three quantum states

Māris Ozols

Published Aug 4, 2015• 4 citations
arXivHTMLPDF

Abstract

We devise a ternary operation for combining three quantum states: it consists of permuting the input systems in a continuous fashion and then discarding all but one of them. This generalizes a binary operation recently studied by Audenaert et al. [arXiv:1503.04213] in the context of entropy power inequalities. Our ternary operation continuously interpolates between all such nested binary operations. Our construction is based on a unitary version of Cayley's theorem: using representation theory we show that any finite group can be naturally embedded into a continuous subgroup of the unitary group. Formally, this amounts to characterizing when a linear combination of certain permutations is unitary.

DOI
10.48550/arxiv.1508.00860

Related papers

Wreath products and multipartite quantum systems

Vladimir V. Kornyak

Abstract A natural symmetry group of a multicomponent quantum system is a special combination of a symmetry group acting within a single component (“local group”) and a group that permutes the components (“spatial symmetry group”). This combination is called the wreath product. Unitary representations of wreath products describe quantum evolutions of multipartite systems. It is known that any unitary representation of a finite group is contained in some permutation representation. We describe an algorithm for decomposing permutation representations of wreath products into irreducible components. This decomposition makes it possible to study the quantum behavior (entanglement, non-local correlations, etc.) of multipartite systems in invariant subspaces of the permutation Hilbert space.

Journal of Physics Conference Series•Dec 1, 2019•0 citations

On the Simplest Entangled Mixed States

Michel Boyer, Tal Mor

Quantum entanglement is a fascinating topic with both theoretical and technological impacts. Yet, even in the simplest scenarios, there are still various open questions involving pure state and mixed state entanglement. Here we present the simplest entangled mixed states. We consider both qubits (quantum bits) and qudits (quantum digits). We first provide our simplest yet most important result for rank-2 bi-partite states, and we then generalize our results to go beyond rank-2 and to go beyond bi-partite states.

•Aug 7, 2023•0 citations

Modeling Quantum Behavior in the Framework of Permutation Groups

Vladimir V. Kornyak

Quantum-mechanical concepts can be formulated in constructive finite terms without loss of their empirical content if we replace a general unitary group by a unitary representation of a finite group. Any linear representation of a finite group can be realized as a subrepresentation of a permutation representation. Thus, quantum-mechanical problems can be expressed in terms of permutation groups. This approach allows us to clarify the meaning of a number of physical concepts. Combining methods of computational group theory with Monte Carlo simulation we study a model based on representations of permutation groups.

arXiv:1709.01831•EPJ Web of Conferences•Jan 1, 2018•16 citations

Every unitary matrix can be extended to a combination of permutations

Przemysław Sadowski

In this work we show the fact that every unitary operator is a combination of permutations on a bigger system. We obtain representation of unitary operators in the spirit of purification or the Stinespring representation.

Quantum Information and Measurement (QIM)•Jan 1, 2017•0 citations

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

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

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.

arXiv:2310.16423•Letters in Mathematical Physics•Apr 16, 2024•3 citations

Impossibility of comparing and sorting quantum states

Arul, A. John

Is there any point of principle that prohibits us from doing one or more forms of quantum information processing? It is now well known that an unknown quantum state can neither be copied nor deleted perfectly. Given a set of states which are not necessarily orthogonal, is it possible to compare any two states from the set, given some reasonable ordering of such states? Is it possible to sort them in some specific order? In the context of quantum computation, it is shown here that there is no quantum circuit implementing a unitary transformation, for comparing and sorting an unrestricted set of quantum states.

arXiv:quant-ph/0107085•Jul 17, 2001•11 citations
We devise a ternary operation for combining three quantum states: it consists of permuting the input systems in a continuous fashion and then discarding all but one of them. This generalizes a binary operation recently studied by Audenaert et al. [arXiv:1503.04213] in the context of entropy power inequalities. Our ternary operation continuously interpolates between all such nested binary operations. Our construction is based on a unitary version of Cayley's theorem: using representation theory we show that any finite group can be naturally embedded into a continuous subgroup of the unitary group. Formally, this amounts to characterizing when a linear combination of certain permutations is unitary.
Abstract A natural symmetry group of a multicomponent quantum system is a special combination of a symmetry group acting within a single component (“local group”) and a group that permutes the components (“spatial symmetry group”). This combination is called the wreath product. Unitary representations of wreath products describe quantum evolutions of multipartite systems. It is known that any unitary representation of a finite group is contained in some permutation representation. We describe an algorithm for decomposing permutation representations of wreath products into irreducible components. This decomposition makes it possible to study the quantum behavior (entanglement, non-local correlations, etc.) of multipartite systems in invariant subspaces of the permutation Hilbert space.
Quantum entanglement is a fascinating topic with both theoretical and technological impacts. Yet, even in the simplest scenarios, there are still various open questions involving pure state and mixed state entanglement. Here we present the simplest entangled mixed states. We consider both qubits (quantum bits) and qudits (quantum digits). We first provide our simplest yet most important result for rank-2 bi-partite states, and we then generalize our results to go beyond rank-2 and to go beyond bi-partite states.
Quantum-mechanical concepts can be formulated in constructive finite terms without loss of their empirical content if we replace a general unitary group by a unitary representation of a finite group. Any linear representation of a finite group can be realized as a subrepresentation of a permutation representation. Thus, quantum-mechanical problems can be expressed in terms of permutation groups. This approach allows us to clarify the meaning of a number of physical concepts. Combining methods of computational group theory with Monte Carlo simulation we study a model based on representations of permutation groups.
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.
Is there any point of principle that prohibits us from doing one or more forms of quantum information processing? It is now well known that an unknown quantum state can neither be copied nor deleted perfectly. Given a set of states which are not necessarily orthogonal, is it possible to compare any two states from the set, given some reasonable ordering of such states? Is it possible to sort them in some specific order? In the context of quantum computation, it is shown here that there is no quantum circuit implementing a unitary transformation, for comparing and sorting an unrestricted set of quantum states.