Quantum
Optimal noisy sequential multiparameter quantum sensing
Publication: quant-ph updates on arXiv.org
Author: Andrew Tanggara, Lorc\'an O Conlon, Alexey V. Gorshkov, Kishor Bharti
Source published: 28/09/2026, 04:00:00 UTC
Briefing created: 28/09/2026, 04:29:57 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 28/09/2026, 04:13:25 UTC.
Briefings
This research establishes a semidefinite programming (SDP) lower bound for the minimum mean-squared error (MSE) in estimating quantum channel parameters via sequential probing. The study applies this bound to general temporally correlated noise and quantum processes, extending the Nagaoka-Hayashi result to multi-time-step scenarios. For regular single-parameter tasks, the bound is proven tight, and a procedure to generate locally optimal strategies is provided. The work also yields new protocols for error-corrected sensing, multiparameter estimation, and qudit systems.
Key points
- A semidefinite programming (SDP) lower bound was derived for the minimum mean-squared error (MSE) in estimating quantum channel parameters using sequential probing with coherent ancillary systems.
- The bound generalizes the Nagaoka-Hayashi lower bound to the regime of multiple time steps under temporally correlated noise and general quantum processes.
Context and limitations
The bound applies to any physically implementable sequential sensing strategy for any physical quantum evolution. Coverage is limited to regular finite-dimensional single-parameter tasks where an optimal strategy exists; for such tasks, the SDP bound is proven tight.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 28/09/2026, 04:29:57 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeicgose4uewb4sgt76klexp7sxvopb5reviqm3xxgskkw6ss6q7dsa