arXiv:2609.40332
Tight Universal Bounds on Quantum Data Hiding with Multipartite Werner States
Oren Akresh, Jacob Beckey, Felix Leditzky
Abstract
Quantum data hiding concerns pairs of states which are highly distinguishable with global measurements, yet nearly indistinguishable when restricted to local operations and classical communication. More than two decades after Eggeling and Werner introduced a multipartite hiding scheme based on Werner states, the optimal dependence of its uniform security guarantee on the number of parties and local dimension remained unknown. We resolve this problem by showing that the distinguishing bias of any pair of $n$-qudit Werner states is $O(n^2/d)$ under measurements whose effects remain positive under partial transposition (PPT) across every bipartition. An explicit pair attains this scaling using only nonadaptive local measurements, establishing worst-case optimality and showing that the PPT relaxation preserves the optimal dependence on both the number of parties and the local dimension. At fixed security, this extends the certified hiding regime from $n=O(d^{1/4})$ to $n=O(\sqrt d)$. Beyond data hiding, the same bound implies that testing any nontrivial unitarily invariant property with adaptive single-copy measurements requires $Ω(\sqrt d)$ copies, yielding separations for any property with dimension-independent sample complexity under collective measurements. Our proof reduces the distinguishing bias to trace norms of partially transposed operators and analyzes them using mixed Schur-Weyl duality, demonstrating the utility of representation theoretic methods developed for port-based teleportation to data hiding and quantum property testing.
AI Summary
The paper determines the optimal uniform distinguishability bound for multipartite Werner states, addressing how security in the Eggeling–Werner data-hiding scheme scales with the number of parties $n$ and local dimension $d$. For any two states commuting with every $U^{\otimes n}$, it proves that a binary measurement whose two effects are PPT across every bipartition has distinguishing bias at most $\frac{3n(n-1)}{2d}$ in the nontrivial regime $3n(n-1)<2d$. This improves the previous uniform bound $6n^2/\sqrt d$, extending the certified fixed-security regime from $n=O(d^{1/4})$ to $n=O(\sqrt d)$. A matching $\Omega(n^2/d)$ bias is achieved by measuring each subsystem in a fixed basis and checking for outcome collisions, distinguishing the normalized symmetric-subspace projector from the maximally mixed state. Thus, the uniform scaling is optimal even for nonadaptive local measurements, not merely under the PPT relaxation. The proof telescopes each state’s difference from the maximally mixed state into marginal increments, then uses partial transposition to bound their contributions by trace norms. Mixed Schur–Weyl duality separates polynomial and non-polynomial sectors; exact spectra handle permutation-invariant states, while an operator-order inequality controls general Werner-state coherences. The same bound implies an $\Omega(\sqrt d)$ copy requirement for PPT testers—and hence adaptive single-copy testers—of any nontrivial unitarily invariant property with nonempty promise classes. Applications include purity and low-rank testing. Optimality is only uniform over state pairs: particular orthogonal Werner pairs can have bias $O(d^{-n/2})$. Constants are not established as optimal.
Error found: The general-state proof incorrectly labels its final trace-norm inequality as valid whenever d ≥ m ≥ 2, although the theorem's stronger assumption does make that inequality valid. The symmetric-state proof invokes a trace-norm corollary outside its stated dimensional regime, although its intermediate estimate directly extends to the regime needed by the theorem.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.