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.
AI Summary
The paper asks how to bound the locally unbiased mean-squared error (MSE) when estimating several parameters of a quantum process using arbitrary sequential controls, coherent ancillas, and a final measurement. It extends the Nagaoka–Hayashi bound to quantum testers/combs, producing an SDP that jointly relaxes optimization over preparation, intermediate controls, measurement, and estimator. The formulation includes temporally correlated noise and general parameterized multi-time processes.
The SDP lower-bounds the sum of parameter MSEs. For regular finite-dimensional single-parameter problems admitting an optimal tester, it is tight: its value is $1/\mathcal{J}_{\mathrm{seq}}$, where $\mathcal{J}_{\mathrm{seq}}$ is the maximum output-state SLD quantum Fisher information. A strategy can be reconstructed by decomposing the optimized tester into preparation and intermediate isometries, followed by an SLD measurement. Multiparameter attainability is not established in general because of measurement incompatibility.
A sufficient criterion transfers Heisenberg scaling from known-noise branches to processes with an unknown persistent finite noise label: exponentially reliable calibration uses $O(\log T)$ rounds, leaving an MSE of $O(T^{-2})$ under additional continuation, bounded-estimator, and encoding assumptions. Examples include correlated Pauli errors and cyclic sets of unknown equatorial noise directions; numerical optimizations reach four channel uses. Continuous, unknown noise direction remains an open problem beyond the analyzed protocols.
Computational cost is polynomial in probe dimension and parameter count for fixed $T$, but exponential in $T$. The paper acknowledges that its main SDP coincides with a program in a contemporaneous conic hierarchy; its single-parameter specialization recovers established comb QFI.
Little sign of AI-generated textUnclear noveltyStrong assumptions
Error found: The abstract must restrict its universal MSE bound and optimality claims to locally unbiased estimation at an operating point, since unrestricted estimators can have zero pointwise MSE where its bound is positive.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
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.
The paper asks how to bound the locally unbiased mean-squared error (MSE) when estimating several parameters of a quantum process using arbitrary sequential controls, coherent ancillas, and a final measurement. It extends the Nagaoka–Hayashi bound to quantum testers/combs, producing an SDP that jointly relaxes optimization over preparation, intermediate controls, measurement, and estimator. The formulation includes temporally correlated noise and general parameterized multi-time processes.
The SDP lower-bounds the sum of parameter MSEs. For regular finite-dimensional single-parameter problems admitting an optimal tester, it is tight: its value is 1/Jseq, where Jseq is the maximum output-state SLD quantum Fisher information. A strategy can be reconstructed by decomposing the optimized tester into preparation and intermediate isometries, followed by an SLD measurement. Multiparameter attainability is not established in general because of measurement incompatibility.
A sufficient criterion transfers Heisenberg scaling from known-noise branches to processes with an unknown persistent finite noise label: exponentially reliable calibration uses O(logT) rounds, leaving an MSE of O(T−2) under additional continuation, bounded-estimator, and encoding assumptions. Examples include correlated Pauli errors and cyclic sets of unknown equatorial noise directions; numerical optimizations reach four channel uses. Continuous, unknown noise direction remains an open problem beyond the analyzed protocols.
Computational cost is polynomial in probe dimension and parameter count for fixed T, but exponential in T. The paper acknowledges that its main SDP coincides with a program in a contemporaneous conic hierarchy; its single-parameter specialization recovers established comb QFI.
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.
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.
The simultaneous estimation of multiple unknown parameters is the most general scenario in quantum sensing. Quantum multiparameter estimation theory provides fundamental bounds on the achievable precision of simultaneous estimation. However, these bounds can become singular (no finite bound exists) in multiparameter sensing due to parameter interdependencies, limited probe accessibility, and insufficient measurement outcomes. Here, we address the singularity issue in quantum sensing through a simple mechanism based on a sequential measurement strategy. This sensing scheme overcomes the singularity constraint and enables the simultaneous estimation of multiple parameters with a local and fixed measurement throughout the sensing protocol. This is because sequential measurements, involving consecutive steps of local measurements followed by probe evolution, inherently produce correlated measurement data that grows exponentially with the number of sequential measurements. Finally, through two different examples, namely a strongly correlated probe and a light-matter system, we demonstrate how such singularities are reflected when inferring the unknown parameters through Bayesian estimation.
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.
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.
Estimation of physical parameters encoded in a Hamiltonian is a central task in quantum sensing and learning. While the ultimate precision limit for estimating a single parameter coupled to a single generator is well established, the corresponding bound for estimating a function of multiple parameters-each coupled to distinct and possibly non-commuting generators-remains unknown in general. Here, we derive the ultimate quantum limit and present an estimation protocol for any function of parameters in a general Hamiltonian that attains this bound. We show that, although the task is fundamentally a multiparameter problem, our tight bound reduces to an optimized single-parameter quantum Cramér-Rao bound, even for arbitrary generator sets. Our result unifies and extends previous works, providing a general framework for optimal function estimation in quantum systems.