Efficient computation of the Nagaoka--Hayashi bound for multi-parameter estimation with separable measurements

• URL: http://arxiv.org/abs/2008.02612v2
• Date: Thu, 15 Jul 2021 23:33:48 GMT
• Title: Efficient computation of the Nagaoka--Hayashi bound for multi-parameter estimation with separable measurements
• Authors: Lorc\'an Conlon, Jun Suzuki, Ping Koy Lam, Syed M. Assad
• Abstract summary: We introduce a tighter bound for estimating multiple parameters simultaneously when performing separable measurements on finite copies of the probe. We show that this bound can be efficiently computed by casting it as a semidefinite program.
• Score: 16.53410208934304
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Finding the optimal attainable precisions in quantum multiparameter metrology is a non trivial problem. One approach to tackling this problem involves the computation of bounds which impose limits on how accurately we can estimate certain physical quantities. One such bound is the Holevo Cramer Rao bound on the trace of the mean squared error matrix. The Holevo bound is an asymptotically achievable bound when one allows for any measurement strategy, including collective measurements on many copies of the probe. In this work we introduce a tighter bound for estimating multiple parameters simultaneously when performing separable measurements on finite copies of the probe. This makes it more relevant in terms of experimental accessibility. We show that this bound can be efficiently computed by casting it as a semidefinite program. We illustrate our bound with several examples of collective measurements on finite copies of the probe. These results have implications for the necessary requirements to saturate the Holevo bound.

Related papers

• Holevo Cramér-Rao bound: How close can we get without entangling measurements? [12.398602782598045]
  Entangling measurements over multiple identical copies of a probe state are known to be superior to measuring each probe individually. In this work we investigate the maximum precision improvement that collective quantum measurements can offer over individual measurements.
  arXiv  Detail & Related papers  (2024-05-15T18:00:06Z)
• Finding the optimal probe state for multiparameter quantum metrology using conic programming [61.98670278625053]
  We present a conic programming framework that allows us to determine the optimal probe state for the corresponding precision bounds. We also apply our theory to analyze the canonical field sensing problem using entangled quantum probe states.
  arXiv  Detail & Related papers  (2024-01-11T12:47:29Z)
• Quantum metrology in the finite-sample regime [0.6299766708197883]
  In quantum metrology, the ultimate precision of estimating an unknown parameter is often stated in terms of the Cram'er-Rao bound. We propose to quantify the quality of a protocol by the probability of obtaining an estimate with a given accuracy.
  arXiv  Detail & Related papers  (2023-07-12T18:00:04Z)
• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping [55.47824411563162]
  Estimation of the energy of quantum many-body systems is a paradigmatic task in various research fields. We aim to find the optimal strategy with single-qubit measurements that yields the highest provable accuracy given a total measurement budget. We develop a practical, efficient estimation strategy, which we call ShadowGrouping.
  arXiv  Detail & Related papers  (2023-01-09T14:41:07Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• Tight Cram\'{e}r-Rao type bounds for multiparameter quantum metrology through conic programming [61.98670278625053]
  It is paramount to have practical measurement strategies that can estimate incompatible parameters with best precisions possible. Here, we give a concrete way to find uncorrelated measurement strategies with optimal precisions. We show numerically that there is a strict gap between the previous efficiently computable bounds and the ultimate precision bound.
  arXiv  Detail & Related papers  (2022-09-12T13:06:48Z)
• The gap persistence theorem for quantum multiparameter estimation [16.53410208934304]
  We show that it is impossible to saturate the Holevo Cram'er-Rao bound (HCRB) for several physically motivated problems. We further prove that if the SLDCRB cannot be reached with a single copy of the probe state, it cannot be reached with collective measurements on any finite number of copies of the probe state.
  arXiv  Detail & Related papers  (2022-08-15T18:01:22Z)
• Lower bounds for learning quantum states with single-copy measurements [3.2590610391507444]
  We study the problems of quantum tomography and shadow tomography using measurements performed on individual copies of an unknown $d$-dimensional state. In particular, this rigorously establishes the optimality of the folklore Pauli tomography" algorithm in terms of its complexity.
  arXiv  Detail & Related papers  (2022-07-29T02:26:08Z)
• Fixed-point iterations for several dissimilarity measure barycenters in the Gaussian case [69.9674326582747]
  In target tracking and sensor fusion contexts it is not unusual to deal with a large number of Gaussian densities. Fixed-Point Iterations (FPI) are presented for the computation of barycenters according to several dissimilarity measures.
  arXiv  Detail & Related papers  (2022-05-10T11:12:12Z)
• Distributed, partially collapsed MCMC for Bayesian Nonparametrics [68.5279360794418]
  We exploit the fact that completely random measures, which commonly used models like the Dirichlet process and the beta-Bernoulli process can be expressed as, are decomposable into independent sub-measures. We use this decomposition to partition the latent measure into a finite measure containing only instantiated components, and an infinite measure containing all other components. The resulting hybrid algorithm can be applied to allow scalable inference without sacrificing convergence guarantees.
  arXiv  Detail & Related papers  (2020-01-15T23:10:13Z)

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.