Researchers have established nearly optimal lower bounds for estimating three important quantum functionals: Uhlmann fidelity, trace distance, and von Neumann entropy. These results demonstrate that approximately Ω(N²) samples are required to estimate these quantities, where N is the dimension of the quantum system. This finding is crucial as it resolves several open problems in the field of quantum characterization and metrology, providing a deeper understanding of the computational resources needed for these fundamental tasks.

The new lower bounds imply that a dozen quantum algorithms developed since 2016 are nearly optimal in terms of the number of samples required. Furthermore, by using the quantum sample-to-query lifting technique, these results establish query lower bounds of Ω(N) for the same functionals. This unified framework for proving lower bounds represents a significant advance, as it allows for the evaluation of the intrinsic efficiency of quantum characterization methods.

Uhlmann fidelity measures the similarity between two quantum states, trace distance quantifies their distinguishability, and von Neumann entropy is a measure of the uncertainty or entanglement of a state. The ability to accurately estimate these properties is fundamental for the development of quantum computing, quantum communication, and error detection. The bounds established by this work not only validate the efficiency of existing algorithms but also guide the design of future, more efficient protocols by defining the minimum resource thresholds needed to achieve a given precision.