Posted

Qisheng Wang (Jun 25 2026).
Abstract: We consider the problem of estimating the fidelity of an unknown quantum state to a known reference state to within additive error ε\varepsilon. We show that the sample complexity is O(r2/ε2)O(r^2/\varepsilon^2) with optimal ε\varepsilon-dependence when the reference state is of rank rr, improving the previous best O(r2log2(1/ε)/ε4)O(r^2\log^2(1/\varepsilon)/\varepsilon^4) due to Utsumi, Nakata, Wang, and Takagi (QIP 2026). We also provide a lower bound of Ω(r/ε2)\Omega(r/\varepsilon^2), improving the previous best Ω(r/ε+1/ε2)\Omega(r/\varepsilon+1/\varepsilon^2), with implications to quantum query complexity. Moreover, we further consider the case where the unknown state is of rank at most rr while the reference state can be arbitrary, for which the sample complexity is shown to be O(r2/ε4)O(r^2/\varepsilon^4). As an application, we present an approach to tolerant quantum state certification, generalizing the exact certification studied in Bădescu, O'Donnell, and Wright (STOC 2019).

Order by:

Want to join this discussion?

Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!