arXiv:2610.38299
Schur--Weyl Reduction of Finite-Copy Precision Bounds for Multiparameter Quantum Estimation
Jianchao Zhang, Masahito Hayashi
Abstract
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 independent and identically distributed (i.i.d.) copies, the quantum statistical model is invariant under permutations of the copies. We exploit this symmetry through Schur--Weyl duality to remove permutation multiplicity spaces while using their dimensions as weights. This gives a reduced statistical model equivalent to the original under arbitrary collective measurements. On this reduced model, we derive an exact conic formulation of the tight Cramér--Rao bound and a semidefinite program for its Nagaoka--Hayashi (NH) relaxation. For fixed single-copy dimension, the reduced operator representation grows polynomially rather than exponentially with the number of copies. To approximate the tight bound, we use an exact quadratic identity to correct finite-ray dual solutions and obtain rigorous upper and lower bounds. For fixed copy number and parameter dimension, sufficiently fine meshes admit feasible primal points, and dual solutions with bounded objective gaps have uniformly bounded compact-search radii. These results yield quadratic convergence in the projective covering radius. Numerical examples illustrate the quadratic scaling of the mesh correction term and the computational reach of the reduced NH formulation.
AI Summary
The paper addresses computation of the exact finite-copy, locally unbiased multiparameter estimation cost under arbitrary collective measurements, and its Nagaoka–Hayashi (NH) relaxation, for full-rank finite-dimensional i.i.d. models with linearly independent tangents. Schur–Weyl duality removes permutation multiplicity spaces while retaining their dimensions as weights in the state and tangent blocks. Explicit parameter-independent compression and recovery channels establish statistical equivalence with the full model, preserving all POVM outcome distributions and attainable MSE matrices. Applying these maps to existing conic formulations gives an exact reduced separable-cone program for the tight cost and an equivalent reduced NH SDP. The physical operator representation has dimension $\binom{m+n^2-1}{n^2-1}$ rather than $n^{2m}$; for qubits, the largest NH PSD block decreases from $(d+1)2^m$ to $(d+1)(m+1)$. For the tight program, finite projective-ray sampling supplies an SDP upper bound. Completing the square in normalized dual constraints yields a correction producing a rigorous lower bound. Constructive eventual primal feasibility and uniform boundedness of near-optimal sampled dual coefficients establish an enclosure width $O(\delta^2)$ at fixed copy number, improving the earlier linear estimate. Reference meshes require $O(\epsilon^{-d/2})$ rays for width $\epsilon$. Numerics include reduced NH calculations to 100 copies and fixed-mesh tight calculations to ten copies. Constants are not controlled uniformly in copy number, so no joint complexity or runtime bound follows. Numerical feasibility generally remains tolerance-based; certified intervals concern only two finite-ray SDP instances, not continuum tight values. Some sensing-example corrections are too conservative for narrow rigorous enclosures.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 43 pages, 12 figures. Metadata correction only