Metraipolis › archive › dc_22995339274d
Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform — arXiv:2608.10674
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.10674
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:29:30.459Z
- SHA-256 of the archived text
86037f09d01e72932931b364e0cd7fd7cd639bff54e3b7a3d2656c225e01e1d0- Stable URL of this page
https://metraipolis.com/documento/dc_22995339274d
How to cite
Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform — arXiv:2608.10674 — arXiv (en), https://arxiv.org/abs/2608.10674 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_22995339274d (Metraipolis archive dc_22995339274d, sha256 86037f09d01e72932931b364e0cd7fd7cd639bff54e3b7a3d2656c225e01e1d0)
BibTeX
@misc{dc22995339274d,
title = {Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform — arXiv:2608.10674},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.10674},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_22995339274d; sha256 86037f09d01e72932931b364e0cd7fd7cd639bff54e3b7a3d2656c225e01e1d0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.10674. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Uhlmann fidelity ${\rm F}(\rho_0,\rho_1) = {\rm tr}|\sqrt{\rho_0}\sqrt{\rho_1}|$ is one of the most fundamental quantities in quantum information theory for quantifying the closeness between two quantum states. Estimating the Uhlmann fidelity to within additive error $\varepsilon$ requires a number of copies of the states, or queries to their state-preparation circuits, that depends at least linearly on the smaller of the ranks of $\rho_0$ and $\rho_1$. Consequently, this rank dependence disappears when either state is pure, in which case the query and sample complexities depend only polynomially on $1/\varepsilon$. However, the known optimal estimator for ${\rm F}(\rho,|\psi\rangle\!\langle\psi|)$ due to Fang and Wang (ESA 2025) requires prior knowledge of which state is pure. In this work, we remove this mathematically unnecessary prior-knowledge requirement and establish an optimal estimator for ${\rm F}(\rho, |\psi\rangle\!\langle\psi|)$ under the sole promise that one of the two states is pure, without knowing which one. Our estimator is obtained by specializing the refined algorithmic Uhlmann transform of Utsumi, Nakata, Wang, and Takagi (2025) to the case where one state is pure. In this setting, the Uhlmann fidelity can be recovered as follows: apply a unitary dilation of ${\rm tr}_{\sf A}(|\psi_0\rangle\!\langle\psi_1|)$ (or its inverse) to the reference register $\sf R$ of the purification $|\psi_1\rangle$ (or $|\psi_0\rangle$) on the registers $\sf A$ and $\sf R$, estimate the corresponding square-root amplitude in each case, and take the maximum of the resulting two estimates.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in math.IT).
Categorie arXiv: Quantum Physics (quant-ph) ; Data Structures and Algorithms (cs.DS); Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2608.10674 — 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-19T06:22:36.027Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).