Maximal Fisher Budget Forces Blind Directions in Bipartite Collective SU(d) Metrology

• URL: http://arxiv.org/abs/2607.22195v1
• Date: Fri, 24 Jul 2026 11:11:40 GMT
• Title: Maximal Fisher Budget Forces Blind Directions in Bipartite Collective SU(d) Metrology
• Abstract summary: For pure two-qudit probes, maximal total Fisher sensitivity and full local identifiability are mutually exclusive.<n>We derive exact identities that determine the trace of the quantum Fisher information matrix from two measurable probe properties.
• Score: 2.9273378452263876
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: For pure two-qudit probes used in a single fixed setting to estimate a common SU(d) transformation, maximal total Fisher sensitivity and full local identifiability are mutually exclusive. We derive exact identities that determine the trace of the quantum Fisher information matrix from two measurable probe properties: exchange symmetry and collective polarization. Every maximizer is exchange symmetric and maximally entangled. Its Fisher matrix has equal sensitivity in every visible direction, while $d(d-1)/2$ generator directions are blind. More generally, weak compatibility, defined by vanishing mean generator commutators, forces at least $\lfloor d/2\rfloor$ blind directions for every pure bipartite probe. A probe-defined antiunitary invariant classifies the complete Fisher spectrum at maximal entanglement, and approaches to the optimum that preserve exchange symmetry have a divergent Holevo cost. The bipartite obstruction is sharp in particle number: for $N\geq 3$, generalized GHZ probes can satisfy weak compatibility, attain the corresponding $N$-partite Fisher trace bound, and retain full local identifiability. Hence, Fisher sensitivity, weak compatibility, identifiability, and attainable precision are distinct resources in quantum metrology with noncommuting generators.

Related papers

• $\ ext{GSF-}χ$: Global Stereochemical Fields for Chiral Graph Transformers [49.85093436361195]
  We introduce GSF-$$, a graph transformer in which stereogenic units modulate all pairwise interactions.<n>A $C$ projection separates mirror-even ECD peak counts and positions from mirror-odd peak signs.<n>GSF-$$ leads every central-ECD output and improves axial Rotation and Symbol by $12.6%$ and $7.9%$ over the strongest baseline.
  arXiv  Detail & Related papers  (2026-09-11T07:41:20Z)
• Loss-Parameterized Fisher Width Along Learning Trajectories [0.0]
  We first derive an exact trace--shape factorization and a deterministic stability bound for fixed compact probes.<n>Results support a branchwise, rather than universal, loss parametrization of Fisher width.
  arXiv  Detail & Related papers  (2026-08-21T18:52:04Z)
• Intrinsic Structure: Spectral Identifiability for Mechanistic Interpretability [51.56484100374058]
  We prove the first identifiability theorem for a mechanistic-interpretability primitive.<n>The spectrum is an identifiable, model-intrinsic fingerprint with a stated error bar, not a legible decomposition.
  arXiv  Detail & Related papers  (2026-08-10T19:42:01Z)
• Full-state information-disturbance tradeoff for direction estimation with antiparallel spin-coherent pairs [0.0]
  We determine the optimal information--disturbance tradeoff for estimating an unknown direction encoded in two antiparallel spins.<n>We also formulate the parallel benchmark and, as a central extension of the method, treat antiparallel spin-coherent states of arbitrary spin $j$.
  arXiv  Detail & Related papers  (2026-06-16T15:17:37Z)
• Fisher geometry reshapes the effect of incompatibility in multiparameter quantum estimation [1.0542145271875853]
  We show how the distribution of incompatibility across parameter planes affects its overall cost.<n>We also prove that at fixed sloppiness, or equivalently fixed Fisher volume, concentrating incompatibility into a single parameter plane reduces the optimized trade-off cost.<n>A qutrit $SU(2)$ encoding numerically confirms that states with larger incompatibility strength can nevertheless incur a smaller cost if the matching factor $G$ is sufficiently small.
  arXiv  Detail & Related papers  (2026-06-09T18:22:29Z)
• Self-Attention as Transport: Limits of Symmetric Spectral Diagnostics [0.0]
  We show that uniform causal attention satisfies an $n$-independent floor $ge 1/5$ with worst cut at $tast/n approx 0.32$, while window attention pierces the floor as $O(w/n)$.<n>The resulting two-axis diagnostic yields a falsifiable polarity prediction.
  arXiv  Detail & Related papers  (2026-05-06T13:25:13Z)
• Variational Joint Magnetometry and Gradiometry on Dipolar Spin Chains [14.720429715932829]
  We present a variational framework that takes det(F) as the objective and a hardware-motivated layered dipolar circuit as the ansatz.<n>Both encoding generators are diagonal in the computational basis, which reduces the search for the quantum Fisher information benchmark to a probability-simplex optimization.
  arXiv  Detail & Related papers  (2026-05-05T15:59:22Z)
• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• Optimal Unconstrained Self-Distillation in Ridge Regression: Strict Improvements, Precise Asymptotics, and One-Shot Tuning [61.07540493350384]
  Self-distillation (SD) is the process of retraining a student on a mixture of ground-truth and the teacher's own predictions.<n>We show that for any prediction risk, the optimally mixed student improves upon the ridge teacher for every regularization level.<n>We propose a consistent one-shot tuning method to estimate $star$ without grid search, sample splitting, or refitting.
  arXiv  Detail & Related papers  (2026-02-19T17:21:15Z)
• Stabilizing Fixed-Point Iteration for Markov Chain Poisson Equations [49.702772230127465]
  We study finite-state Markov chains with $n$ states and transition matrix $P$.<n>We show that all non-decaying modes are captured by a real peripheral invariant subspace $mathcalK(P)$, and that the induced operator on the quotient space $mathbbRn/mathcalK(P) is strictly contractive, yielding a unique quotient solution.
  arXiv  Detail & Related papers  (2026-01-31T02:57:01Z)
• Role of phase of optimal probe in noncommutativity vs coherence in quantum multiparameter estimation [0.0]
  We investigate simultaneous estimation of two phases encoded through arbitrary qubit Hamiltonians.<n>We also consider single-qutrit probes, for which the encoding Hamiltonians are chosen as SU(2) generators.<n>We find that in both the qubit and qutrit scenarios, the optimal probe is a coherent superposition of the eigenstates corresponding to the largest and smallest eigenvalues.
  arXiv  Detail & Related papers  (2025-07-07T09:42:56Z)
• Ancilla quantum measurements on interacting chains: Sensitivity of entanglement dynamics to the type and concentration of detectors [46.76612530830571]
  We consider a quantum many-body lattice system that is coupled to ancillary degrees of freedom (detectors'') We explore the dynamics of density and of entanglement entropy in the chain, for various values of $rho_a$ and $M$.
  arXiv  Detail & Related papers  (2023-11-21T21:41:11Z)
• Reachable sets for two-level open quantum systems driven by coherent and incoherent controls [77.34726150561087]
  We study controllability in the set of all density matrices for a two-level open quantum system driven by coherent and incoherent controls. For two coherent controls, the system is shown to be completely controllable in the set of all density matrices.
  arXiv  Detail & Related papers  (2021-09-09T16:14:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.