Researchers have achieved precise results and improved known bounds for quantum data hiding, a fundamental concept in quantum information theory. This phenomenon explores how much distinguishing power can be lost when global measurements on a quantum system are restricted to local operations and classical communication (LOCC). The new findings provide a deeper understanding of the capabilities and limitations of data hiding in bipartite systems.

For bipartite systems in Hilbert spaces of dimensions $\mathbb C^n\otimes\mathbb C^m$, the study demonstrates that the optimal data-hiding ratios against separable and LOCC measurements are both $\min\{n,m\}$. This result stems from a more general finding: for any $2\le p\le\infty$, the radius of the largest centered Schatten $p$-ball, whose associated binary measurements are implementable by finite-round LOCC, is $\min\{n,m\}^{2/p-1}$. This not only strengthens classic separable-ball theorems but also provides an explicit finite-round LOCC implementation.

The work also addresses more specific scenarios. For one-way LOCC with Alice as the first operator and a local dimension $n$, the optimal ratio is established at $(1+o(1))n$, with the upper bound obtained from a Gaussian rank-one POVM. Furthermore, for local operations without communication, the universal upper bound is improved to $(\pi\sqrt3/4+o(1))\min\{n,m\}$. These advances are crucial for understanding how quantum information can be protected or, paradoxically, hidden from restricted measurements, which has direct implications for the security of quantum communications and distributed quantum computing.