Metraipolis › archive › dc_ffaf22865b37

On the Power of Adaptivity in Testing Quantum States in Fidelity — arXiv:2609.08733

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.08733
License (as archived)
CC0-1.0
Archived
2026-10-16T11:17:58.867Z
SHA-256 of the archived text
e8ea38d13aaeb3f68e16bd11d4248b0af66af38da6004063301de8e5ef698e96
Stable URL of this page
https://metraipolis.com/documento/dc_ffaf22865b37

How to cite

On the Power of Adaptivity in Testing Quantum States in Fidelity — arXiv:2609.08733 — arXiv (en), https://arxiv.org/abs/2609.08733 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ffaf22865b37 (Metraipolis archive dc_ffaf22865b37, sha256 e8ea38d13aaeb3f68e16bd11d4248b0af66af38da6004063301de8e5ef698e96)
BibTeX
@misc{dcffaf22865b37,
  title = {On the Power of Adaptivity in Testing Quantum States in Fidelity — arXiv:2609.08733},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.08733},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ffaf22865b37; sha256 e8ea38d13aaeb3f68e16bd11d4248b0af66af38da6004063301de8e5ef698e96},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08733. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the problems of quantum state certification, equivalence testing and independence testing. In certification, given samples of an unknown quantum state $\rho$ and the description of a state $\sigma$, the goal is to test whether $\rho=\sigma$, or whether $\rho$ and $\sigma$ are far in a given distance measure. In equivalence testing, $\sigma$ is also unknown and only accessible via samples. Independence testing decides whether $\rho_{AC}=\rho_A\otimes\rho_C$, or is far from being a product. The sample complexities of these problems are now well-understood for a decision gap $\varepsilon$ in trace distance: in the single-copy measurement setting with $d$-dimensional states, all three tasks can be solved using the same non-adaptive approach, which uses $\Theta(d^{3/2}/\varepsilon^2)$ samples and is optimal in general, even without adaptivity. In this work, we consider decision gaps expressed in fidelity and study possible separations between these problems and how adaptivity can help. We prove that certification with respect to fidelity for a state $\sigma$ of rank $r$ does not benefit from adaptivity and requires $\widetilde{\Theta}(r^{3/2}/\varepsilon)$ samples. For equivalence testing and independence testing, we provide adaptive algorithms using $\widetilde{O}(\min\{d^{3/2}/\varepsilon^2,d^{9/4}/\varepsilon\})$ and $\widetilde{O}(\min\{(d_Ad_C)^{3/2}/\varepsilon^2,d_A^{9/4}d_C^{3/4}/\varepsilon\})$ samples, for $d_A\geq d_C$, respectively. Our main technique is a framework that uses partial learning and a reduction to testing in $\ell_2$-distance, adapted from the distribution testing literature. We show that adaptivity matters for equivalence testing in fidelity by proving that $\widetilde{\Omega}(1/\varepsilon^2)$ samples are necessary in the non-adaptive case even for qubits, showing a separation from certification.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in cs.DS).
Categorie arXiv: Quantum Physics (quant-ph) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.08733 — 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-16T10:56:12.728Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).