Metraipolis › archive › dc_5455a362bb11
On Optimal Quantum Data Hiding and Maximal Separable Ball — arXiv:2608.06308
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.06308
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T10:53:50.630Z
- SHA-256 of the archived text
81418ea2a982ed47cabec28af05ba2eb39b0be25d2f9400a028fa318436cbe2d- Stable URL of this page
https://metraipolis.com/documento/dc_5455a362bb11
How to cite
On Optimal Quantum Data Hiding and Maximal Separable Ball — arXiv:2608.06308 — arXiv (en), https://arxiv.org/abs/2608.06308 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5455a362bb11 (Metraipolis archive dc_5455a362bb11, sha256 81418ea2a982ed47cabec28af05ba2eb39b0be25d2f9400a028fa318436cbe2d)
BibTeX
@misc{dc5455a362bb11,
title = {On Optimal Quantum Data Hiding and Maximal Separable Ball — arXiv:2608.06308},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.06308},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5455a362bb11; sha256 81418ea2a982ed47cabec28af05ba2eb39b0be25d2f9400a028fa318436cbe2d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.06308. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Quantum data hiding asks how much distinguishing power can be lost when global measurements are restricted to local measurements and classical communication. In this work, we establish sharp results and improved bounds for several natural classes of restricted measurements. For bipartite systems on $\mathbb C^n\otimes\mathbb C^m$, we prove that the optimal data-hiding ratios against separable and LOCC measurements are both $\min\{n,m\}$. This result follows from a stronger result that, for every $2\le p\le\infty$, the largest centered Schatten $p$-ball whose associated binary measurements are implementable by finite-round LOCC has radius $\min\{n,m\}^{2/p-1}$. This strengthens the classic separable-ball theorems, while also providing an explicit finite-round LOCC implementation. For Alice-first one-way LOCC with Alice's local dimension equal to $n$, we prove that the optimal ratio is $(1+o(1))n$, with the upper bound obtained from a Gaussian rank-one POVM. For local operations without communication, we improve the universal upper bound to $(\pi\sqrt3/4+o(1))\min\{n,m\}$.
Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-07 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.06308 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T10:40:45.629Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).