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
Hd⊗t is generally unsuitable for \textsf{QPB}, identified
Symt(Hd) 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
S⊆Hd⊗t on which the collective Haar twirl
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λ⊗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
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≤(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.
Composition is a cornerstone of classical differential privacy, enabling strong end-to-end guarantees for complex algorithms through composition theorems (e.g., basic and advanced). In the quantum setting, however, privacy is defined operationally against arbitrary measurements, and classical composition arguments based on scalar privacy-loss random variables no longer apply. As a result, it has remained unclear when meaningful composition guarantees can be obtained for quantum differential privacy (QDP).
In this work, we clarify both the limitations and possibilities of composition in the quantum setting. We first show that classical-style composition fails in full generality for POVM-based approximate QDP: even quantum channels that are individually perfectly private can completely lose privacy when combined through correlated joint implementations. We then identify a setting in which clean composition guarantees can be restored. For tensor-product channels acting on product neighboring inputs, we introduce a quantum moments accountant based on an operator-valued notion of privacy loss and a matrix moment-generating function. Although the resulting Rényi-type divergence does not satisfy a data-processing inequality, we prove that controlling its moments suffices to bound measured Rényi divergence, yielding operational privacy guarantees against arbitrary measurements. This leads to advanced-composition-style bounds with the same leading-order behavior as in the classical theory.
Our results demonstrate that meaningful composition theorems for quantum differential privacy require carefully articulated structural assumptions on channels, inputs, and adversarial measurements, and provide a principled framework for understanding which classical ideas do and do not extend to the quantum setting.
Differential privacy provides a mathematical framework for guaranteeing privacy for sensitive data. In quantum information processing, the interaction of privacy constraints with quantum resources such as entanglement remains a question of interest. Given that the utility of many protocols, and often the presence of a quantum advantage, relies on quantum resources such as entanglement, it is crucial to understand when a privacy requirement for a quantum channel is compatible with the channel's ability to preserve entanglement. We study this question for quantum local differential privacy (QLDP). Our main result shows that every
ε-QLDP channel with a
d-dimensional input is entanglement-breaking whenever
ε≤logd−1d. We also prove an approximate version for
(ε,δ)-QLDP, where channels in the same high-privacy regime are close in diamond norm to an entanglement-breaking channel. We further prove a composition result for a collection of private quantum channels having entangled inputs and global measurements in the high-privacy regime. Finally, we apply our results to private quantum learning theory. We prove that any learning protocol using arbitrary quantum memory on copies of the output of an entanglement-breaking channel can be simulated by a protocol that measures the corresponding unprocessed input copies one at a time while storing only classical information. Combining this result with our high-privacy entanglement-breaking theorem, we show that under sufficiently private local noise, a learning protocol with quantum memory for purity testing and bipartite product testing is subject to the sample complexity lower bounds for protocols with single-copy measurements on the noiseless tasks. We also obtain stronger sample complexity lower bounds when a single highly private channel acts on the entire multipartite input.