Optimal Trace Distance and Fidelity Estimations for Pure Quantum States
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Measuring the distinguishability between quantum states is a basic problem in quantum information theory. In this paper, we develop optimal quantum algorithms that estimate both the trace distance and the (square root) fidelity between pure states to within additive error <inline-formula> <tex-math notation="LaTeX">$\varepsilon $ </tex-math></inline-formula> using <inline-formula> <tex-math notation="LaTeX">$\Theta (1/\varepsilon)$ </tex-math></inline-formula> queries to their state-preparation circuits, quadratically improving the long-standing folklore <inline-formula> <tex-math notation="LaTeX">$O(1/\varepsilon ^{2}) $ </tex-math></inline-formula>. At the heart of our construction, is an algorithmic tool for quantum square root amplitude estimation, which generalizes the well-known quantum amplitude estimation.