arXiv:2611.01027
Multiparameter quantum metrology for general and adaptive strategies
Masahito Hayashi, Yingkai Ouyang
Abstract
We develop a conic-programming framework for multiparameter estimation of quantum processes under different classes of sensing strategies. Estimation precision depends on the choice of input probe state and measurement and, when a channel is used multiple times, on the arrangement of channel uses and intermediate controls. We specify different strategy classes through linear normalization constraints on generalized measurements, and formulate the local estimation problem using linear constraints and a linear objective function. We show that the separable-cone program gives the exact precision limit under the local estimation conditions considered here, while cone relaxations yield Cramér-Rao-type lower bounds. For $N$ uses of an identical quantum channel, we prove an exact $1/N$ scaling law for an RLD-based positive-cone lower bound, even for general process-matrix testers that allow indefinite causal order. Under the stated conditions on the channel and its parameter dependence, the minimum weighted mean-square error also scales as $1/N$. This extends an RLD-based restriction on Heisenberg scaling from adaptive strategies to this broader class. For fixed-order adaptive strategies, we show that each process-side conic bound equals the corresponding state-estimation bound optimized over sensor combs. We establish this equality by constructing a sensor comb from the process-side normalization operator. A noisy three-parameter field-sensing model illustrates the framework.
AI Summary
The paper studies local multiparameter channel estimation when optimization includes probes, measurements, and the arrangement of channel uses. It represents strategy classes through linear constraints on generalized-measurement normalization operators, covering fixed-order adaptive testers and general process-matrix testers normalized against independently chosen CPTP maps in every slot. A separable-cone program exactly reproduces the infimum weighted MSE over locally unbiased estimators; larger cones provide Cramér–Rao-type lower bounds. For $N$ identical channel uses, the attainable set of real RLD-type information matrices is exactly $N$ times the one-use set. Consequently, the positive-cone relaxation satisfies $J_6^{(N)}(G)=J_6^{(1)}(G)/N$. Independent-slot normalization eliminates cross-slot terms, while product normalization operators realize every scaled one-use matrix. For $G>0$, independent parameter derivatives, and either full-rank Choi operators or derivatives confined to the Choi support, this gives $J_6^{(1)}/N\leq J_1^{(N)}\leq J_1^{(1)}/N$, excluding Heisenberg MSE scaling even for general process testers. The exact coefficient applies to the relaxation, not necessarily the operational optimum. For fixed causal order, five process-side conic bounds equal their corresponding state-estimation bounds optimized over sensor combs. The proof constructs a comb from the normalization operator and transfers feasible variables by cone-preserving congruences. The scaling assumptions exclude nontrivial unitary families. General process-matrix normalization does not establish circuit implementability. A three-parameter noisy-field example compares two relaxations, but derivative convergence and channel-validity audits remain outstanding; small numerical violations of their theoretical ordering are unresolved.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 28 pages