English

Quantum chi-squared tomography and mutual information testing

Quantum Physics 2024-06-26 v2 Data Structures and Algorithms

Abstract

For quantum state tomography on rank-rr dimension-dd states, we show that O~(r.5d1.5/ϵ)O~(d2/ϵ)\widetilde{O}(r^{.5}d^{1.5}/\epsilon) \leq \widetilde{O}(d^2/\epsilon) copies suffice for accuracy~ϵ\epsilon with respect to (Bures) χ2\chi^2-divergence, and O~(rd/ϵ)\widetilde{O}(rd/\epsilon) copies suffice for accuracy~ϵ\epsilon with respect to quantum relative entropy. The best previous bound was O~(rd/ϵ)O~(d2/ϵ)\widetilde{O}(rd/\epsilon) \leq \widetilde{O}(d^2/\epsilon) with respect to infidelity; our results are an improvement since infidelity is bounded above by both the relative entropy and the χ2\chi^2-divergence. For algorithms that are required to use single-copy measurements, we show that O~(r1.5d1.5/ϵ)O~(d3/ϵ)\widetilde{O}(r^{1.5} d^{1.5}/\epsilon) \leq \widetilde{O}(d^3/\epsilon) copies suffice for χ2\chi^2-divergence, and O~(r2d/ϵ)\widetilde{O}(r^{2} d/\epsilon) suffice for relative entropy. Using this tomography algorithm, we show that O~(d2.5/ϵ)\widetilde{O}(d^{2.5}/\epsilon) copies of a d×dd\times d-dimensional bipartite state suffice to test if it has quantum mutual information~00 or at least~ϵ\epsilon. As a corollary, we also improve the best known sample complexity for the \emph{classical} version of mutual information testing to O~(d/ϵ)\widetilde{O}(d/\epsilon).

Cite

@article{arxiv.2305.18519,
  title  = {Quantum chi-squared tomography and mutual information testing},
  author = {Steven T. Flammia and Ryan O'Donnell},
  journal= {arXiv preprint arXiv:2305.18519},
  year   = {2024}
}

Comments

34 pages

R2 v1 2026-06-28T10:49:51.785Z