Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.01027

Multiparameter quantum metrology for general and adaptive strategies

Masahito Hayashi, Yingkai Ouyang

quant-phSubmitted Oct 31, 2026• Announced Nov 3, 2026• 1 citation
arXivHTMLPDF

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.

Likely largely AI-generatedStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
28 pages

Related papers

Optimal Strategies for Multi-parameter Quantum Metrology

Linxuan Li, Zihao Hu, Longyun Chen +2 more

Estimating multiple unknown parameters simultaneously is essential for practical quantum sensing. However, it faces a fundamental challenge: the optimal strategy for estimating one parameter is often incompatible with that for another, making it impossible to simultaneously achieve the ultimate precision limits for all parameters. Here we develop a general and efficient computational framework that jointly optimizes probe states, control operations, and measurements across different strategy families, including parallel, sequential, and those with indefinite causal order. Our approach provides exact semidefinite-program formulations for several precision bounds, including the Holevo, Nagaoka-Hayashi, and quantum Cramér-Rao bounds. We demonstrate the capabilities of the framework in multiparameter magnetometry and frequency estimation, identifying optimal protocols within each class and revealing a strict hierarchy among the achievable performances of different classes in the multiparameter regime. The framework also directly incorporates resource constraints, such as energy budgets, enabling systematic investigation of experimentally realistic sensing scenarios. Furthermore, we develop a finite-memory optimization method for sequential strategies with restricted ancillary-memory dimension. By decomposing the protocol into initial probe preparation and intermediate control operations, this method provides a practical route to designing resource-constrained sequential sensing schemes. Our work establishes a versatile computational tool for determining fundamental precision limits and designing optimal quantum-sensing protocols in complex multiparameter settings.

quant-pharXiv:2608.01114•Aug 4, 2026•4 citations

Tight Cramér-Rao type bounds for multiparameter quantum metrology through conic programming

Masahito Hayashi, Yingkai Ouyang

In the quest to unlock the maximum potential of quantum sensors, it is of paramount importance to have practical measurement strategies that can estimate incompatible parameters with best precisions possible. However, it is still not known how to find practical measurements with optimal precisions, even for uncorrelated measurements over probe states. Here, we give a concrete way to find uncorrelated measurement strategies with optimal precisions. We solve this fundamental problem by introducing a framework of conic programming that unifies the theory of precision bounds for multiparameter estimates for uncorrelated and correlated measurement strategies under a common umbrella. Namely, we give precision bounds that arise from linear programs on various cones defined on a tensor product space of matrices, including a particular cone of separable matrices. Subsequently, our theory allows us to develop an efficient algorithm that calculates both upper and lower bounds for the ultimate precision bound for uncorrelated measurement strategies, where these bounds can be tight. In particular, the uncorrelated measurement strategy that arises from our theory saturates the upper bound to the ultimate precision bound. Also, we show numerically that there is a strict gap between the previous efficiently computable bounds and the ultimate precision bound.

arXiv:2209.05218•Quantum•Aug 29, 2023•38 citations

Unified and computable approach to optimal strategies for multiparameter estimation

Zhao-Yi Zhou, Da-Jian Zhang

Precise estimation of physical parameters underpins both scientific discovery and technological development. A central goal of quantum metrology and sensing is to exploit quantum resources like entanglement to devise optimal strategies for estimating physical parameters as precisely as possible. While substantial progress has been made in single-parameter quantum metrology, the multiparameter scenario remains significantly more challenging due to the issue of parameter incompatibility. In this work, we present a unified and computable approach for the simultaneous estimation of multiple parameters that attains the ultimate precision permitted by quantum mechanics. The core of our approach is to integrate the quantum tester formalism into the recently proposed tight Cramér-Rao type bound. This formulation enables us to figure out the highest achievable precision via upper and lower bounds that are computable via semidefinite programs. More importantly, within this formulation, diverse quantum resources, including entanglement, coherence, quantum control, and indefinite causal order, are treated on equal footing and systematically optimized for the purpose of achieving the ultimate precision in multiparameter estimation. As a result, our approach is applicable to various metrological strategies both in the presence and absence of noise. To demonstrate its utility, we revisit three-dimensional magnetic-field estimation, uncovering the strengths and limitations of existing analytical results and further establishing a strict hierarchy among different types of strategies.

quant-pharXiv:2603.06244•Mar 9, 2026•3 citations

Optimal noisy sequential multiparameter quantum sensing

Andrew Tanggara, Lorcán O Conlon, Alexey V. Gorshkov +1 more

The most general strategy for estimating parameters of a quantum channel is to probe the channel many times sequentially with the help of coherent ancillary systems. However, finding the strategy that minimizes the mean-squared error (MSE) is a notoriously hard problem, requiring optimization over the initial probe state, intermediate evolutions, final measurement, and classical postprocessing. In this work, we study how the minimum attainable MSE can be bounded from below in this setting. We propose a lower bound for the MSE of any physically implementable sequential sensing strategy that applies to estimating parameters of any physical quantum evolution, including quantum channels probed over multiple time steps under temporally correlated noise and general temporally correlated quantum processes. We show that this lower bound can be formulated as a semidefinite program (SDP). Our bound generalizes the Nagaoka-Hayashi lower bound (that applies to parameter estimation tasks with separable measurements) to the regime where the quantum channel can be accessed sequentially multiple times. For regular finite-dimensional single-parameter sequential estimation tasks admitting an optimal strategy, we show that our SDP bound is tight and provide a procedure to obtain a locally optimal strategy from the SDP optimizer. Using our optimization bound, we compute the MSE lower bound and derive new protocols for several other physically motivated problems including error-corrected quantum sensing under an unknown correlated noise model, multiparameter estimation, and estimation with qudit systems.

quant-pharXiv:2609.30398•Sep 28, 2026•1 citation

Strategy optimization for Bayesian quantum parameter estimation with finite copies: Adaptive greedy, parallel, sequential, and general strategies

Erik L. André, Jessica Bavaresco, Mohammad Mehboudi

In this work, we study Bayesian quantum parameter estimation given a finite number of uses of the process encoding one or more unknown physical quantities. We analyze the performance of different kinds of quantum metrological protocols, including the conventional parallel, sequential, or general, which may involve an indefinite causal order. We also analyze a class of hybrid adaptive greedy strategies, which are based on classical feedforward between quantum protocols to optimize the next round. Within each class, the central question is to determine the optimal strategy -- namely, the choice of optimal input state, control operations, measurement, and estimators. Using the formalism of higher-order operations, we develop an algorithm that searches for the optimal solution, and we provide a numerical implementation based on semidefinite programming. Our benchmark cases, specifically those against existing analytical solutions, demonstrate how powerful and precise our method is. We further demonstrate the strength of our algorithm in several examples, from single to multiparameter estimation, and with various prior distributions. Particularly, we find examples where the adaptive greedy strategy matches the performance of general strategies with indefinite causal order, and at the same time examples that showcase a strict hierarchy between all different classes.

quant-pharXiv:2602.09655•Quantum Science and Technology•Feb 11, 2026•8 citations

Fundamental Limits of Quantum Metrology Beyond Fixed Causal Order

Wenjie Wei, Yutong Li, Shengshi Pang

Quantum metrology with indefinite causal order (ICO) has attracted intense interest due to its potential to surpass the limitations of conventional fixed-order strategies. A key open question is whether ICO can fundamentally enhance asymptotic precision scaling. In this work, we bridge this gap for the estimation of a single parameter encoded in $N$ identical uses of a finite-dimensional quantum channel. We first establish a universal Heisenberg-scaling upper bound for the full general ICO process-matrix class and show that for unitary channels its optimal quantum Fisher information (QFI) coincides exactly with that of parallel strategies. For noisy channels, a structurally refined bound shows that channels restricted to the standard quantum limit (SQL) under parallel strategies remain SQL-limited under general ICO strategies. Most significantly, an asymptotically tight (AT) bound is derived to close the remaining possibility of an asymptotic ICO advantage by showing that general ICO and optimal parallel strategies have exactly the same leading QFI coefficient in both the SQL and Heisenberg regimes. For the operationally motivated class of quantum circuits with quantum control of causal order, we further obtain an iterative constraint on finite-query precision whose asymptotic limit agrees with that of the AT bound. Our results clarify the ultimate role of indefinite causality as a metrological resource for quantum channel estimation.

quant-pharXiv:2609.05355•Sep 7, 2026•3 citations
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 NNN uses of an identical quantum channel, we prove an exact 1/N1/N1/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/N1/N1/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.
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 NNN identical channel uses, the attainable set of real RLD-type information matrices is exactly NNN times the one-use set. Consequently, the positive-cone relaxation satisfies J6(N)(G)=J6(1)(G)/NJ_6^{(N)}(G)=J_6^{(1)}(G)/NJ6(N)​(G)=J6(1)​(G)/N. Independent-slot normalization eliminates cross-slot terms, while product normalization operators realize every scaled one-use matrix. For G>0G>0G>0, independent parameter derivatives, and either full-rank Choi operators or derivatives confined to the Choi support, this gives J6(1)/N≤J1(N)≤J1(1)/NJ_6^{(1)}/N\leq J_1^{(N)}\leq J_1^{(1)}/NJ6(1)​/N≤J1(N)​≤J1(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.
Estimating multiple unknown parameters simultaneously is essential for practical quantum sensing. However, it faces a fundamental challenge: the optimal strategy for estimating one parameter is often incompatible with that for another, making it impossible to simultaneously achieve the ultimate precision limits for all parameters. Here we develop a general and efficient computational framework that jointly optimizes probe states, control operations, and measurements across different strategy families, including parallel, sequential, and those with indefinite causal order. Our approach provides exact semidefinite-program formulations for several precision bounds, including the Holevo, Nagaoka-Hayashi, and quantum Cramér-Rao bounds. We demonstrate the capabilities of the framework in multiparameter magnetometry and frequency estimation, identifying optimal protocols within each class and revealing a strict hierarchy among the achievable performances of different classes in the multiparameter regime. The framework also directly incorporates resource constraints, such as energy budgets, enabling systematic investigation of experimentally realistic sensing scenarios. Furthermore, we develop a finite-memory optimization method for sequential strategies with restricted ancillary-memory dimension. By decomposing the protocol into initial probe preparation and intermediate control operations, this method provides a practical route to designing resource-constrained sequential sensing schemes. Our work establishes a versatile computational tool for determining fundamental precision limits and designing optimal quantum-sensing protocols in complex multiparameter settings.
In the quest to unlock the maximum potential of quantum sensors, it is of paramount importance to have practical measurement strategies that can estimate incompatible parameters with best precisions possible. However, it is still not known how to find practical measurements with optimal precisions, even for uncorrelated measurements over probe states. Here, we give a concrete way to find uncorrelated measurement strategies with optimal precisions. We solve this fundamental problem by introducing a framework of conic programming that unifies the theory of precision bounds for multiparameter estimates for uncorrelated and correlated measurement strategies under a common umbrella. Namely, we give precision bounds that arise from linear programs on various cones defined on a tensor product space of matrices, including a particular cone of separable matrices. Subsequently, our theory allows us to develop an efficient algorithm that calculates both upper and lower bounds for the ultimate precision bound for uncorrelated measurement strategies, where these bounds can be tight. In particular, the uncorrelated measurement strategy that arises from our theory saturates the upper bound to the ultimate precision bound. Also, we show numerically that there is a strict gap between the previous efficiently computable bounds and the ultimate precision bound.
Precise estimation of physical parameters underpins both scientific discovery and technological development. A central goal of quantum metrology and sensing is to exploit quantum resources like entanglement to devise optimal strategies for estimating physical parameters as precisely as possible. While substantial progress has been made in single-parameter quantum metrology, the multiparameter scenario remains significantly more challenging due to the issue of parameter incompatibility. In this work, we present a unified and computable approach for the simultaneous estimation of multiple parameters that attains the ultimate precision permitted by quantum mechanics. The core of our approach is to integrate the quantum tester formalism into the recently proposed tight Cramér-Rao type bound. This formulation enables us to figure out the highest achievable precision via upper and lower bounds that are computable via semidefinite programs. More importantly, within this formulation, diverse quantum resources, including entanglement, coherence, quantum control, and indefinite causal order, are treated on equal footing and systematically optimized for the purpose of achieving the ultimate precision in multiparameter estimation. As a result, our approach is applicable to various metrological strategies both in the presence and absence of noise. To demonstrate its utility, we revisit three-dimensional magnetic-field estimation, uncovering the strengths and limitations of existing analytical results and further establishing a strict hierarchy among different types of strategies.
The most general strategy for estimating parameters of a quantum channel is to probe the channel many times sequentially with the help of coherent ancillary systems. However, finding the strategy that minimizes the mean-squared error (MSE) is a notoriously hard problem, requiring optimization over the initial probe state, intermediate evolutions, final measurement, and classical postprocessing. In this work, we study how the minimum attainable MSE can be bounded from below in this setting. We propose a lower bound for the MSE of any physically implementable sequential sensing strategy that applies to estimating parameters of any physical quantum evolution, including quantum channels probed over multiple time steps under temporally correlated noise and general temporally correlated quantum processes. We show that this lower bound can be formulated as a semidefinite program (SDP). Our bound generalizes the Nagaoka-Hayashi lower bound (that applies to parameter estimation tasks with separable measurements) to the regime where the quantum channel can be accessed sequentially multiple times. For regular finite-dimensional single-parameter sequential estimation tasks admitting an optimal strategy, we show that our SDP bound is tight and provide a procedure to obtain a locally optimal strategy from the SDP optimizer. Using our optimization bound, we compute the MSE lower bound and derive new protocols for several other physically motivated problems including error-corrected quantum sensing under an unknown correlated noise model, multiparameter estimation, and estimation with qudit systems.
In this work, we study Bayesian quantum parameter estimation given a finite number of uses of the process encoding one or more unknown physical quantities. We analyze the performance of different kinds of quantum metrological protocols, including the conventional parallel, sequential, or general, which may involve an indefinite causal order. We also analyze a class of hybrid adaptive greedy strategies, which are based on classical feedforward between quantum protocols to optimize the next round. Within each class, the central question is to determine the optimal strategy -- namely, the choice of optimal input state, control operations, measurement, and estimators. Using the formalism of higher-order operations, we develop an algorithm that searches for the optimal solution, and we provide a numerical implementation based on semidefinite programming. Our benchmark cases, specifically those against existing analytical solutions, demonstrate how powerful and precise our method is. We further demonstrate the strength of our algorithm in several examples, from single to multiparameter estimation, and with various prior distributions. Particularly, we find examples where the adaptive greedy strategy matches the performance of general strategies with indefinite causal order, and at the same time examples that showcase a strict hierarchy between all different classes.
Quantum metrology with indefinite causal order (ICO) has attracted intense interest due to its potential to surpass the limitations of conventional fixed-order strategies. A key open question is whether ICO can fundamentally enhance asymptotic precision scaling. In this work, we bridge this gap for the estimation of a single parameter encoded in NNN identical uses of a finite-dimensional quantum channel. We first establish a universal Heisenberg-scaling upper bound for the full general ICO process-matrix class and show that for unitary channels its optimal quantum Fisher information (QFI) coincides exactly with that of parallel strategies. For noisy channels, a structurally refined bound shows that channels restricted to the standard quantum limit (SQL) under parallel strategies remain SQL-limited under general ICO strategies. Most significantly, an asymptotically tight (AT) bound is derived to close the remaining possibility of an asymptotic ICO advantage by showing that general ICO and optimal parallel strategies have exactly the same leading QFI coefficient in both the SQL and Heisenberg regimes. For the operationally motivated class of quantum circuits with quantum control of causal order, we further obtain an iterative constraint on finite-query precision whose asymptotic limit agrees with that of the AT bound. Our results clarify the ultimate role of indefinite causality as a metrological resource for quantum channel estimation.