Metraipolis › archive › dc_fca80c03bfa6
Tight Lower Bounds for State Tomography with Limited Entanglement — arXiv:2609.05718
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.05718
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T13:58:42.513Z
- SHA-256 of the archived text
afcfe671b230356fbbff26877356abc5b44cc3718ed0e847abc1bb9d45c40a5e- Stable URL of this page
https://metraipolis.com/documento/dc_fca80c03bfa6
How to cite
Tight Lower Bounds for State Tomography with Limited Entanglement — arXiv:2609.05718 — arXiv (en), https://arxiv.org/abs/2609.05718 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fca80c03bfa6 (Metraipolis archive dc_fca80c03bfa6, sha256 afcfe671b230356fbbff26877356abc5b44cc3718ed0e847abc1bb9d45c40a5e)
BibTeX
@misc{dcfca80c03bfa6,
title = {Tight Lower Bounds for State Tomography with Limited Entanglement — arXiv:2609.05718},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.05718},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fca80c03bfa6; sha256 afcfe671b230356fbbff26877356abc5b44cc3718ed0e847abc1bb9d45c40a5e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05718. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study state tomography when each measurement acts on at most $k$ fresh copies and no quantum memory is retained between blocks. We prove a lower bound matching the upper bound in [ arXiv:2510.07788 ]. Thus the copy complexity of estimating an arbitrary $d$-dimensional state to trace distance $\epsilon$ is, up to absolute constant factors, $\max\{d^3/(\sqrt{k}\epsilon^2),d^2/\epsilon^2\}$ for every $k$ and all sufficiently small $\epsilon$. This removes the earlier restriction that $k$ be small as a function of the accuracy. The lower bound applies to arbitrary measurements within each block and adaptive choices between blocks. The lower bound already applies in a small neighborhood of any state whose smallest eigenvalue is of order $1/d$, even when the center is known. The main ingredient is a uniform Fisher information bound for one measurement block that depends only on the smallest eigenvalue of the state. The proof avoids the perturbative expansion responsible for the restriction in [ arXiv:2402.16353 ]. Fano's inequality for metric balls and a log-Sobolev comparison between mutual and Fisher information then reduce the adaptive protocol to this block bound [ arXiv:1607.00550 , arXiv:1902.08582 ].
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-09 in cs.LG).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT); Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.05718 — 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-16T13:39:43.126Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).