Abstract:We present two optimal quantum algorithms that estimate the (square root) fidelity of a mixed state to a pure state to within additive error $\varepsilon$:
- Given query access to the state-preparation circuits of the input states, the query complexity is shown to be $\Theta(1/\varepsilon)$, achieving a quadratic speedup over the folklore $O(1/\varepsilon^2)$.
- Given sample access to the input states, the sample complexity is shown to be $\Theta(1/\varepsilon^2)$, achieving a quadratic speedup over the folklore $O(1/\varepsilon^4)$.
Our results generalize the previous approaches to pure-state fidelity estimation, and, to the best of our knowledge, are the first optimal approaches to fidelity estimation involving mixed states. Our approach is technically simple, and can be extended to estimating the uncommon quantity $\sqrt{\operatorname{tr}(\rho\sigma^2)}$ that is of independent interest.
From: Qisheng Wang [view email]
[v1]
Mon, 30 Jun 2025 09:24:03 UTC (14 KB)
[v2]
Thu, 2 Jul 2026 17:48:49 UTC (25 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。