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

Admissible Subspaces for the Collective Haar Twirl: Schur-Weyl Classification and Heredity under Tensor-Factor Reduction

Sayantan Ganguly

math-phquant-phSubmitted Oct 24, 2026• Announced Oct 27, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum private broadcasting (\textsf{QPB}) asks whether a quantum message can be encrypted once, broadcast to several recipients, and decrypted locally while the joint ciphertext reveals no plaintext information. Broadbent, González-Guillén, and Schuknecht showed that the full tensor-power space \(\mathcal H_d^{\otimes t}\) is generally unsuitable for \textsf{QPB}, identified \(\mathrm{Sym}^t(\mathcal H_d)\) as a natural plaintext space, introduced symmetric unitary \(t\)-designs, and asked which other subspaces support private broadcast. Using Schur-Weyl duality, we classify all subspaces \(\mathcal S\subseteq\mathcal H_d^{\otimes t}\) on which the collective Haar twirl \(\mathcal T^{(t)}\) is a replacement channel. Precisely, every Schur-Weyl block weight must be independent of the encoded state, and in each active block \(V_λ\otimes W_λ\), the reduced state on the multiplicity space \(W_λ\) must be fixed. This yields explicit two-block and general multiblock constructions and realizes the classification as the Schur-Weyl form of the Knill-Laflamme conditions for a complementary channel of \(\mathcal T^{(t)}\). We also introduce a canonical reduction under deletion of a recipient and characterize privacy heredity, design heredity, and \textsf{QPB}-heredity for exact restricted designs. The symmetric tower is fully \textsf{QPB}-hereditary, whereas the antisymmetric tower is fully privacy-hereditary and is design-hereditary from level \(s\) to \(s-1\) exactly when \(s\leq(d+1)/2\). For canonical carriers in arbitrary Schur-Weyl blocks, hereditary reduction is governed by multiplicity-free branching along the Young graph and inclusion of the associated Peter-Weyl coefficient spaces.

AI Summary

The paper classifies subspaces $\mathcal S\subseteq(\mathbb C^d)^{\otimes t}$ on which collective Haar encryption $U^{\otimes t}$ erases all plaintext information, and asks whether privacy and finite-ensemble moment guarantees survive deletion of a tensor factor. This characterizes plaintext spaces supporting perfectly private collective encryption with local inverse-unitary decryption. In the Schur–Weyl decomposition $\bigoplus_\lambda V_\lambda\otimes W_\lambda$, admissibility requires input-independent block weights $c_\lambda$ and fixed multiplicity-space states $\omega_\lambda$, including the corresponding off-diagonal identities. An explicit purification-based normal form describes every admissible subspace: dimension $n$ is possible for prescribed active blocks and multiplicity states exactly when $n\operatorname{rank}\omega_\lambda\leq\dim V_\lambda$ in every active block. The characterization also follows from scalar compression of the twirl’s image algebra and privacy–correctability complementarity. Deletion is defined through $\operatorname{Red}_j(\mathcal S)=\operatorname{supp}(\operatorname{Tr}_j\Pi_{\mathcal S})$. Privacy on this entire reduced space and descent of every exact restricted design are distinct, logically independent properties; design descent is equivalent to inclusion of coefficient-function spaces. The symmetric tower has both properties. Exterior powers always preserve privacy, but preserve designs from level $s$ to $s-1$ exactly when $s\leq(d+1)/2$. Branching rules, Jucys–Murphy eigenspaces and Peter–Weyl theory give further criteria for canonical irreducible carriers. The generalized plaintext is an already prepared distributed state: local recovery need not give each recipient the logical message. The heredity results concern exact designs; they do not establish efficient ensemble constructions or quantitative approximate-heredity guarantees.

Little sign of AI-generated textIncremental

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Quantum private broadcasting

Anne Broadbent, Carlos E. González-Guillén, Christine Schuknecht

In private broadcasting, a single plaintext is broadcast to multiple recipients in an encrypted form, such that each recipient can decrypt locally. When the message is classical, a straightforward solution is to encrypt the plaintext with a single key shared among all parties, and to send to each recipient a copy of the ciphertext. Surprisingly, the analogous method is insufficient in the case where the message is quantum [i.e., in quantum private broadcasting (QPB)]. In this work, we give three solutions to $t$-recipient quantum private broadcasting ($t$-QPB) and compare them in terms of key lengths. The first method is the independent encryption with the quantum one-time pad, which requires a key linear in the number of recipients, $t$. We show that the key length can be decreased to be logarithmic in $t$ by using unitary $t$-designs. Our main contribution is to show that this can be improved to a key length that is logarithmic in the dimension of the symmetric subspace, using a concept that we define of symmetric unitary $t$-designs, which may be of independent interest.

arXiv:2107.11474•Physical Review A•Feb 10, 2022•0 citations

Choi-level twirling of quantum channels: finite constructions and non-compact transformations

Marcin Markiewicz, Łukasz Pawela, Zbigniew Puchała

Twirling, i.e. averaging over symmetry actions, is a standard tool for reducing quantum states and channels to a symmetry-invariant form. We study channel twirling from the perspective of the channel-state duality and provide a constructive Choi-level description of the averaging map induced by arbitrary input/output representations. Our main technical result concerns the collective setting: for $π^{\textrm{in}}(U)=U^{\otimes t_{\textrm{in}}}$ and $π^{\textrm{out}}(U)=U^{\otimes t_{\textrm{out}}}$, we introduce a partial-transpose reduction that removes the contragredient action and converts the mixed (walled Brauer) channel twirl into an ordinary Schur-Weyl twirl of the partially transposed Choi operator under $U^{\otimes(t_{\textrm{in}}+t_{\textrm{out}})}$, enabling explicit permutation-based formulas without constructing walled Brauer idempotents or mixed Schur transforms. Beyond compact symmetries, we extend channel twirling to reductive, generally non-unitary groups via Cartan decomposition and obtain an invariant-sector decomposition of the averaged Choi operator with weights determined solely by the Abelian Cartan component. Finally, we provide two finite realizations of channel averaging: a "dual" implementation as a convex mixture of unitary-$1$-design channels acting on invariant sectors, and a design-like reconstruction showing that weighted group $t$-designs induce channel $t$-designs for $t=t_{\textrm{in}}+t_{\textrm{out}}$.

quant-pharXiv:2512.23586•Journal of Physics A Mathematical and Theoretical•Dec 30, 2025•0 citations

Quantum Private Broadcasting

Schuknecht, Christine

In Private Broadcasting, a single plaintext is broadcast to multiple recipients in an encrypted form, such that each recipient can decrypt locally. When the message is classical, a straightforward solution is to encrypt the plaintext with a single key shared among the parties, and to send each recipient a copy of the ciphertext. Surprisingly, the analogous method is insufficient in the case where the message is quantum (i.e. in Quantum Private Broadcasting (QPB)). In this work, we give three solutions to t-recipient QPB and compare them in terms of encryption key length. We examine independent encryption with the quantum one-time pad, unitary t-designs, and a new concept we define as symmetric unitary t-designs. Of these three, symmetric t-designs are the best choice when t is large, and these symmetric designs may be of independent interest beyond QPB.

•Sep 29, 2021•3 citations

Schur--Weyl Reduction of Finite-Copy Precision Bounds for Multiparameter Quantum Estimation

Jianchao Zhang, Masahito Hayashi

In multiparameter quantum estimation, incompatible measurements can impose trade-offs among estimation errors. Understanding the precision attainable with a finite number of jointly measured copies is therefore important, but direct optimization becomes costly as the tensor product space grows exponentially. For independent and identically distributed (i.i.d.) copies, the quantum statistical model is invariant under permutations of the copies. We exploit this symmetry through Schur--Weyl duality to remove permutation multiplicity spaces while using their dimensions as weights. This gives a reduced statistical model equivalent to the original under arbitrary collective measurements. On this reduced model, we derive an exact conic formulation of the tight Cramér--Rao bound and a semidefinite program for its Nagaoka--Hayashi (NH) relaxation. For fixed single-copy dimension, the reduced operator representation grows polynomially rather than exponentially with the number of copies. To approximate the tight bound, we use an exact quadratic identity to correct finite-ray dual solutions and obtain rigorous upper and lower bounds. For fixed copy number and parameter dimension, sufficiently fine meshes admit feasible primal points, and dual solutions with bounded objective gaps have uniformly bounded compact-search radii. These results yield quadratic convergence in the projective covering radius. Numerical examples illustrate the quadratic scaling of the mesh correction term and the computational reach of the reduced NH formulation.

quant-pharXiv:2610.38299•Oct 29, 2026•0 citations

A scalar–Haar dichotomy for consistent covariant quantum projections

Dmitry Lubenskiy

Preprint. This manuscript has not undergone external peer review. We characterize exact projection channels on all tensor powers of a finite-dimensional system. Fix d ≥ 2. Suppose the channels are unital, completely positive, trace preserving and idempotent, covariant under collective SU(d) transformations and tensor permutations, consistent with identity embeddings, and completely depolarizing on one site. Then the entire family is either complete depolarization or collective Haar twirling. The proof combines standard conditional-expectation theory, the two-site Schur–Weyl commutant and an elementary consequence of infinite exchangeability. It requires no general classification of invariant subalgebras. For qubits, any nontrivial family necessarily preserves a logical qubit on three spins, excluding a nontrivial purely classical retained algebra under these assumptions. We illustrate the obstruction with a total-spin measurement channel and give sharp three-spin disturbance bounds. The entanglement-breaking bound is an application of the established trine state-reconstruction benchmark. An explicit example separates small normalized-Choi consistency defects from uniform operational closeness, clarifying a limitation of approximate extensions.

•Sep 27, 2026•0 citations

Universal quantum coding

Jacopo Rizzo, Filippo Girardi, Ludovico Lami +2 more

Entanglement distillation from noisy bipartite states and reliable quantum communication over noisy channels are fundamental tasks in quantum information theory. Yet existing coding schemes typically require prior knowledge of the underlying state or channel, or assume independent or weakly correlated quantum information sources. Here, using Schur-Weyl duality, we establish a universal quantum error-correction principle that overcomes these limitations. We show that the irreducible permutation spaces arising from the local Schur-Weyl decomposition of multiple copies of an unknown bipartite mixed state form maximally entangled quantum code spaces whose error structure is governed entirely by representation theory. Correcting these symmetry-resolved errors yields protocols for entanglement distillation and quantum communication that achieve coherent-information rates with exponentially vanishing error and optimal second-order corrections, even in the case of almost i.i.d. resources. Our approach also provides sharp finite-copy guarantees that are worst-case optimal at every finite block length, including in the sample-efficient regime, where the number of copies scales only polynomially with the number of qubits. Together, these results establish Schur-Weyl duality as a general mechanism for universal, robust, and optimal quantum coding, unifying entanglement distillation, quantum error correction, and quantum communication within a common representation-theoretic framework.

quant-pharXiv:2609.38038•Sep 30, 2026•0 citations
Quantum private broadcasting (\textsf{QPB}) asks whether a quantum message can be encrypted once, broadcast to several recipients, and decrypted locally while the joint ciphertext reveals no plaintext information. Broadbent, González-Guillén, and Schuknecht showed that the full tensor-power space (\mathcal H_d^{\otimes t}) is generally unsuitable for \textsf{QPB}, identified (\mathrm{Sym}^t(\mathcal H_d)) as a natural plaintext space, introduced symmetric unitary (t)-designs, and asked which other subspaces support private broadcast. Using Schur-Weyl duality, we classify all subspaces (\mathcal S\subseteq\mathcal H_d^{\otimes t}) on which the collective Haar twirl (\mathcal T^{(t)}) is a replacement channel. Precisely, every Schur-Weyl block weight must be independent of the encoded state, and in each active block (V_λ\otimes W_λ), the reduced state on the multiplicity space (W_λ) must be fixed. This yields explicit two-block and general multiblock constructions and realizes the classification as the Schur-Weyl form of the Knill-Laflamme conditions for a complementary channel of (\mathcal T^{(t)}). We also introduce a canonical reduction under deletion of a recipient and characterize privacy heredity, design heredity, and \textsf{QPB}-heredity for exact restricted designs. The symmetric tower is fully \textsf{QPB}-hereditary, whereas the antisymmetric tower is fully privacy-hereditary and is design-hereditary from level (s) to (s-1) exactly when (s\leq(d+1)/2). For canonical carriers in arbitrary Schur-Weyl blocks, hereditary reduction is governed by multiplicity-free branching along the Young graph and inclusion of the associated Peter-Weyl coefficient spaces.
The paper classifies subspaces S⊆(Cd)⊗t\mathcal S\subseteq(\mathbb C^d)^{\otimes t}S⊆(Cd)⊗t on which collective Haar encryption U⊗tU^{\otimes t}U⊗t erases all plaintext information, and asks whether privacy and finite-ensemble moment guarantees survive deletion of a tensor factor. This characterizes plaintext spaces supporting perfectly private collective encryption with local inverse-unitary decryption.
In the Schur–Weyl decomposition ⨁λVλ⊗Wλ\bigoplus_\lambda V_\lambda\otimes W_\lambda⨁λ​Vλ​⊗Wλ​, admissibility requires input-independent block weights cλc_\lambdacλ​ and fixed multiplicity-space states ωλ\omega_\lambdaωλ​, including the corresponding off-diagonal identities. An explicit purification-based normal form describes every admissible subspace: dimension nnn is possible for prescribed active blocks and multiplicity states exactly when nrank⁡ωλ≤dim⁡Vλn\operatorname{rank}\omega_\lambda\leq\dim V_\lambdanrankωλ​≤dimVλ​ in every active block. The characterization also follows from scalar compression of the twirl’s image algebra and privacy–correctability complementarity.
Deletion is defined through Red⁡j(S)=supp⁡(Tr⁡jΠS)\operatorname{Red}_j(\mathcal S)=\operatorname{supp}(\operatorname{Tr}_j\Pi_{\mathcal S})Redj​(S)=supp(Trj​ΠS​). Privacy on this entire reduced space and descent of every exact restricted design are distinct, logically independent properties; design descent is equivalent to inclusion of coefficient-function spaces. The symmetric tower has both properties. Exterior powers always preserve privacy, but preserve designs from level sss to s−1s-1s−1 exactly when s≤(d+1)/2s\leq(d+1)/2s≤(d+1)/2. Branching rules, Jucys–Murphy eigenspaces and Peter–Weyl theory give further criteria for canonical irreducible carriers.
The generalized plaintext is an already prepared distributed state: local recovery need not give each recipient the logical message. The heredity results concern exact designs; they do not establish efficient ensemble constructions or quantitative approximate-heredity guarantees.
In private broadcasting, a single plaintext is broadcast to multiple recipients in an encrypted form, such that each recipient can decrypt locally. When the message is classical, a straightforward solution is to encrypt the plaintext with a single key shared among all parties, and to send to each recipient a copy of the ciphertext. Surprisingly, the analogous method is insufficient in the case where the message is quantum [i.e., in quantum private broadcasting (QPB)]. In this work, we give three solutions to ttt-recipient quantum private broadcasting (ttt-QPB) and compare them in terms of key lengths. The first method is the independent encryption with the quantum one-time pad, which requires a key linear in the number of recipients, ttt. We show that the key length can be decreased to be logarithmic in ttt by using unitary ttt-designs. Our main contribution is to show that this can be improved to a key length that is logarithmic in the dimension of the symmetric subspace, using a concept that we define of symmetric unitary ttt-designs, which may be of independent interest.
Twirling, i.e. averaging over symmetry actions, is a standard tool for reducing quantum states and channels to a symmetry-invariant form. We study channel twirling from the perspective of the channel-state duality and provide a constructive Choi-level description of the averaging map induced by arbitrary input/output representations. Our main technical result concerns the collective setting: for πin(U)=U⊗tinπ^{\textrm{in}}(U)=U^{\otimes t_{\textrm{in}}}πin(U)=U⊗tin​ and πout(U)=U⊗toutπ^{\textrm{out}}(U)=U^{\otimes t_{\textrm{out}}}πout(U)=U⊗tout​, we introduce a partial-transpose reduction that removes the contragredient action and converts the mixed (walled Brauer) channel twirl into an ordinary Schur-Weyl twirl of the partially transposed Choi operator under U⊗(tin+tout)U^{\otimes(t_{\textrm{in}}+t_{\textrm{out}})}U⊗(tin​+tout​), enabling explicit permutation-based formulas without constructing walled Brauer idempotents or mixed Schur transforms. Beyond compact symmetries, we extend channel twirling to reductive, generally non-unitary groups via Cartan decomposition and obtain an invariant-sector decomposition of the averaged Choi operator with weights determined solely by the Abelian Cartan component. Finally, we provide two finite realizations of channel averaging: a "dual" implementation as a convex mixture of unitary-111-design channels acting on invariant sectors, and a design-like reconstruction showing that weighted group ttt-designs induce channel ttt-designs for t=tin+toutt=t_{\textrm{in}}+t_{\textrm{out}}t=tin​+tout​.
In Private Broadcasting, a single plaintext is broadcast to multiple recipients in an encrypted form, such that each recipient can decrypt locally. When the message is classical, a straightforward solution is to encrypt the plaintext with a single key shared among the parties, and to send each recipient a copy of the ciphertext. Surprisingly, the analogous method is insufficient in the case where the message is quantum (i.e. in Quantum Private Broadcasting (QPB)). In this work, we give three solutions to t-recipient QPB and compare them in terms of encryption key length. We examine independent encryption with the quantum one-time pad, unitary t-designs, and a new concept we define as symmetric unitary t-designs. Of these three, symmetric t-designs are the best choice when t is large, and these symmetric designs may be of independent interest beyond QPB.
In multiparameter quantum estimation, incompatible measurements can impose trade-offs among estimation errors. Understanding the precision attainable with a finite number of jointly measured copies is therefore important, but direct optimization becomes costly as the tensor product space grows exponentially. For independent and identically distributed (i.i.d.) copies, the quantum statistical model is invariant under permutations of the copies. We exploit this symmetry through Schur--Weyl duality to remove permutation multiplicity spaces while using their dimensions as weights. This gives a reduced statistical model equivalent to the original under arbitrary collective measurements. On this reduced model, we derive an exact conic formulation of the tight Cramér--Rao bound and a semidefinite program for its Nagaoka--Hayashi (NH) relaxation. For fixed single-copy dimension, the reduced operator representation grows polynomially rather than exponentially with the number of copies. To approximate the tight bound, we use an exact quadratic identity to correct finite-ray dual solutions and obtain rigorous upper and lower bounds. For fixed copy number and parameter dimension, sufficiently fine meshes admit feasible primal points, and dual solutions with bounded objective gaps have uniformly bounded compact-search radii. These results yield quadratic convergence in the projective covering radius. Numerical examples illustrate the quadratic scaling of the mesh correction term and the computational reach of the reduced NH formulation.
Preprint. This manuscript has not undergone external peer review. We characterize exact projection channels on all tensor powers of a finite-dimensional system. Fix d ≥ 2. Suppose the channels are unital, completely positive, trace preserving and idempotent, covariant under collective SU(d) transformations and tensor permutations, consistent with identity embeddings, and completely depolarizing on one site. Then the entire family is either complete depolarization or collective Haar twirling. The proof combines standard conditional-expectation theory, the two-site Schur–Weyl commutant and an elementary consequence of infinite exchangeability. It requires no general classification of invariant subalgebras. For qubits, any nontrivial family necessarily preserves a logical qubit on three spins, excluding a nontrivial purely classical retained algebra under these assumptions. We illustrate the obstruction with a total-spin measurement channel and give sharp three-spin disturbance bounds. The entanglement-breaking bound is an application of the established trine state-reconstruction benchmark. An explicit example separates small normalized-Choi consistency defects from uniform operational closeness, clarifying a limitation of approximate extensions.
Entanglement distillation from noisy bipartite states and reliable quantum communication over noisy channels are fundamental tasks in quantum information theory. Yet existing coding schemes typically require prior knowledge of the underlying state or channel, or assume independent or weakly correlated quantum information sources. Here, using Schur-Weyl duality, we establish a universal quantum error-correction principle that overcomes these limitations. We show that the irreducible permutation spaces arising from the local Schur-Weyl decomposition of multiple copies of an unknown bipartite mixed state form maximally entangled quantum code spaces whose error structure is governed entirely by representation theory. Correcting these symmetry-resolved errors yields protocols for entanglement distillation and quantum communication that achieve coherent-information rates with exponentially vanishing error and optimal second-order corrections, even in the case of almost i.i.d. resources. Our approach also provides sharp finite-copy guarantees that are worst-case optimal at every finite block length, including in the sample-efficient regime, where the number of copies scales only polynomially with the number of qubits. Together, these results establish Schur-Weyl duality as a general mechanism for universal, robust, and optimal quantum coding, unifying entanglement distillation, quantum error correction, and quantum communication within a common representation-theoretic framework.