Skip to content
Preprint

Uniqueness and Cram\'er-Rao Efficiency of Quantum U-Statistics

Sep 2026 · 0 citations · 38 references
Physics Mathematics

Abstract

We study unbiased estimation of scalar-valued polynomial functionals of quantum states from independent copies. We establish an equivalence between the first-order marginal of a permutation-invariant finite-copy observable and the functional gradient. We then prove that, among unbiased permutation-invariant estimators, the quantum U-statistic is the unique extension to an arbitrary number of copies. We further derive a universal variance expansion in which the leading $1/n$ term is determined by the variance of the functional gradient, while higher-order contributions are of order $O(1/n^2)$. This leading variance coincides with the multiparameter quantum Cram\'er-Rao limit, establishing asymptotic efficiency of quantum U-statistics. We also characterize the higher-order scaling at points where the variance of the first-order gradient vanishes. As an application, we analyze the Bures $\chi^2$-divergence and show that a spectral lower bound on the reference state is sufficient but not necessary for bounded-variance estimation.

View source

Similar papers

Preprint Oct 2026

Schur--Weyl Reduction of Finite-Copy Precision Bounds for Multiparameter Quantum Estimation

In multiparameter quantum estimation, incompatible measurements can impose trade-offs among estimation errors. Understanding the precision attainable with a finite number of jointly measured copies is therefore important, but direct optimization becomes costly as the tensor product space grows exponentially. For indepe...

Jian-Chao Zhang, Masahito Hayashi · 0 citations
Preprint Sep 2026

Exact Characterization of the Holevo Bound by a Quantum Fisher Information Family

The quantum Cram\'er-Rao bound constrains the precision of parameter estimation through the symmetric logarithmic derivative quantum Fisher information (SLD QFI). It is asymptotically achievable for regular single-parameter estimation models, but generally not in the multiparameter setting, where optimal measurements f...

Koji Yamaguchi, Hiroyasu Tajima · 0 citations
Preprint Oct 2026

Geometric R\'enyi divergence and RLD Fisher information under quantum processes without definite causal order

Quantum experiments without a definite causal order offer new ways to distinguish devices, estimate physical parameters, and communicate. We prove a common limit on these tasks: the geometric R\'enyi divergence at the output of a deterministic completely positive process cannot exceed the sum of the divergences of its...

Zi-Xin Huang, Mark M. Wilde · 0 citations
Preprint Sep 2026

Sharp pairwise reduction for quantum hypothesis testing

We determine the optimal universal coefficient in a reduction of multiple to binary quantum hypothesis testing. Specifically, for every finite ensemble in any Hilbert space dimension (finite or infinite), we prove that the error probability of the global pretty good measurement (PGM) is at most four times the sum of th...

Kuan-Yi Lee, Ludovico Lami · 2 citations
Preprint Sep 2026

Quantum de Finetti theorems for states and channels in any distance measure

Standard finite quantum de Finetti theorems approximate the $k$-system marginals of permutation-invariant states of $n$-systems by mixtures of independent and identically distributed (iid) states, usually in trace distance. We prove both standard and Renner's exponential de Finetti theorems in the stronger form of oper...

Liu Ye, Bjarne Bergh, Nilanjana Datta · 1 citation
Preprint Sep 2026

Quantum Channel Stein's Lemma with an Exponential Strong Converse

We establish the quantum channel Stein lemma at every fixed type-I error tolerance in $(0,1)$ and prove an exponential strong converse under arbitrary adaptive strategies. For any finite-dimensional channel pair, the optimal type-II exponent equals the regularized channel relative entropy and is attained by parallel st...

Minbo Gao, Zheng-Feng Ji, Cheng-Hua Liu · 5 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.