Dynamical one-from-many quantum metrology: Sum rule and matrix-free precision bound

• URL: http://arxiv.org/abs/2608.19988v1
• Date: Thu, 20 Aug 2026 13:04:11 GMT
• Title: Dynamical one-from-many quantum metrology: Sum rule and matrix-free precision bound
• Abstract summary: We show that for dynamical one-from-many estimation, a previously overlooked sum rule connects the QFI about all model parameters to the QFI about time.<n>We derive a tight, matrix-free quantum precision bound that involves only scalar quantities, offers broad applicability, and subsumes existing results as special cases.
• Score: 7.745571136962667
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Practical quantum single-parameter estimation is rarely a pristine task; it almost invariably involves nuisance parameters, casting it as a one-from-many problem. Existing approaches to this problem rely on multi-parameter metrology, reducing the matrix quantum Cramér-Rao bound to obtain scalar quantum precision limits. However, these methods are often hampered by the demanding inversion of the quantum Fisher information (QFI) matrix and the requisite choice of a weight matrix, and they break down when the QFI matrix becomes singular. Here, we show that for dynamical one-from-many estimation, a previously overlooked sum rule connecting the QFI about all model parameters to the QFI about time necessitates including the latter to consider an augmented QFI matrix while simultaneously rendering it inherently singular--precisely the scenario where conventional approaches fail. To meet this challenge, we derive a tight, matrix-free quantum precision bound that involves only scalar quantities, offers broad applicability, and subsumes existing results as special cases. Validated in both unitary and noisy settings, our findings provide a refined operational framework for practical quantum single-parameter metrology.

Related papers

• Parametrized-circuit-free quantum regression with variance regularization [0.09999629695552194]
  We propose an approach of constructing problem-specific quantum regression models with encoding relevant symmetries and regularizing the variance.<n>Our approach is accurate and less resource-intensive than conventional variational methods.
  arXiv  Detail & Related papers  (2026-07-02T18:38:23Z)
• Heisenberg-Limited Quantum Eigenvalue Estimation for Non-normal Matrices [5.733109475878588]
  Estimating the eigenvalues of non-normal matrices is a foundational problem with far-reaching implications.<n>Here we introduce a new class of quantum algorithms that directly address this challenge.<n>Our work lays the foundation for a rigorous and scalable quantum computing approach to one of the most demanding problems in linear algebra.
  arXiv  Detail & Related papers  (2025-10-22T14:55:44Z)
• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Saturation of the Multiparameter Quantum Cramér-Rao Bound at the Single-Copy Level with Projective Measurements [0.0]
  It was not known when the quantum Cram'er-Rao bound can be saturated (achieved) when only a single copy of the quantum state is available.<n>In this paper, key structural properties of optimal measurements that saturate the quantum Cram'er-Rao bound are illuminated.
  arXiv  Detail & Related papers  (2024-05-02T17:04:13Z)
• Randomized semi-quantum matrix processing [0.0]
  We present a hybrid quantum-classical framework for simulating generic matrix functions. The method is based on randomization over the Chebyshev approximation of the target function. We prove advantages on average depths, including quadratic speed-ups on costly parameters.
  arXiv  Detail & Related papers  (2023-07-21T18:00:28Z)
• PreQuant: A Task-agnostic Quantization Approach for Pre-trained Language Models [52.09865918265002]
  We propose a novel quantize before fine-tuning'' framework, PreQuant. PreQuant is compatible with various quantization strategies, with outlier-aware fine-tuning incorporated to correct the induced quantization error. We demonstrate the effectiveness of PreQuant on the GLUE benchmark using BERT, RoBERTa, and T5.
  arXiv  Detail & Related papers  (2023-05-30T08:41:33Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Taming singularities of the quantum Fisher information [0.0]
  singular QFIMs occur when the curvature of the metric vanishes in one or more directions. QFIMs have discontinuities when the density matrix has parameter-dependent rank. We present a nuanced discussion of how to deal with each of these scenarios.
  arXiv  Detail & Related papers  (2021-08-12T21:38:29Z)
• On the properties of the asymptotic incompatibility measure in multiparameter quantum estimation [62.997667081978825]
  Incompatibility (AI) is a measure which quantifies the difference between the Holevo and the SLD scalar bounds. We show that the maximum amount of AI is attainable only for quantum statistical models characterized by a purity larger than $mu_sf min = 1/(d-1)$.
  arXiv  Detail & Related papers  (2021-07-28T15:16:37Z)
• Measurement cost of metric-aware variational quantum algorithms [0.0]
  We consider metric-aware quantum algorithms that use a quantum computer to estimate both a matrix and a vector object. We propose a general approach for optimally distributing samples between matrix and vector entries. We establish that the number of circuit repetitions needed for estimating the quantum Fisher information matrix is negligible for an increasing number of iterations.
  arXiv  Detail & Related papers  (2020-05-11T15:06:29Z)

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.