Bayesian and frequentist estimators for the transition frequency of a driven two-level quantum system

• URL: http://arxiv.org/abs/2411.10199v1
• Date: Fri, 15 Nov 2024 13:58:52 GMT
• Title: Bayesian and frequentist estimators for the transition frequency of a driven two-level quantum system
• Authors: Chun Kit Dennis Law, József Zsolt Bernád,
• Abstract summary: We employ both Bayesian and frequentist approaches to estimate the unknown transition frequency. In the frequentist approach, we have shown that reducing the distance between the classical and the quantum Fisher information does not necessarily mean that the estimators as functions of the data deliver an estimate with desirable precision.
• Score: 0.0
• License:
• Abstract: The formalism of quantum estimation theory with a specific focus on the classical postprocessing of data is applied to a two-level system driven by an external gyrating magnetic field. We employed both Bayesian and frequentist approaches to estimate the unknown transition frequency. In the frequentist approach, we have shown that reducing the distance between the classical and the quantum Fisher information does not necessarily mean that the estimators as functions of the data deliver an estimate with desirable precision. Due to the nonlinearity of the probability mass function of the data on the transition frequency, the minimum variance unbiased estimator may not exist. The maximum likelihood and the maximum a posteriori estimators often result in ambiguous estimates, which in certain cases can be made unambiguous upon changing the parameters of the external field. It is demonstrated that the most promising solution is given by the minimum mean-square error estimator of the Bayesian statistics, which is efficient even for finite data points. In the Bayesian approach, we have considered both informative and noninformative priors, including a uniform prior, Jeffrey's prior, and a Gaussian prior.

Related papers

• On the existence of unbiased resilient estimators in discrete quantum systems [0.0]
  We compare the performance of Cram'er-Rao and Bhattacharyya bounds when faced with less-than-ideal prior knowledge of the parameter. For a given system dimension, one can construct estimators in quantum systems that exhibit increased robustness to prior ignorance.
  arXiv  Detail & Related papers  (2024-02-23T10:12:35Z)
• Score Matching-based Pseudolikelihood Estimation of Neural Marked Spatio-Temporal Point Process with Uncertainty Quantification [59.81904428056924]
  We introduce SMASH: a Score MAtching estimator for learning markedPs with uncertainty quantification. Specifically, our framework adopts a normalization-free objective by estimating the pseudolikelihood of markedPs through score-matching. The superior performance of our proposed framework is demonstrated through extensive experiments in both event prediction and uncertainty quantification.
  arXiv  Detail & Related papers  (2023-10-25T02:37:51Z)
• Deterministic and Bayesian Characterization of Quantum Computing Devices [0.4194295877935867]
  This paper presents a data-driven characterization approach for estimating transition frequencies and decay times in a superconducting quantum device. The data includes parity events in the transition frequency between the first and second excited states. A simple but effective mathematical model, based upon averaging solutions of two Lindbladian models, is demonstrated to accurately capture the experimental observations.
  arXiv  Detail & Related papers  (2023-06-23T19:11:41Z)
• Bayesian Renormalization [68.8204255655161]
  We present a fully information theoretic approach to renormalization inspired by Bayesian statistical inference. The main insight of Bayesian Renormalization is that the Fisher metric defines a correlation length that plays the role of an emergent RG scale. We provide insight into how the Bayesian Renormalization scheme relates to existing methods for data compression and data generation.
  arXiv  Detail & Related papers  (2023-05-17T18:00:28Z)
• Using Random Walks for Iterative Phase Estimation [12.892284518456059]
  We provide a new approach to online Bayesian phase estimation that achieves Heisenberg limited scaling. This practically means that we can perform an update in microseconds on a CPU as opposed to milliseconds for existing particle filter methods. This work shows that online Bayesian inference is practical, efficient and ready for deployment in modern FPGA driven adaptive experiments.
  arXiv  Detail & Related papers  (2022-08-09T03:31:15Z)
• Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms [76.15799379604898]
  Quantum phase estimation suffers from spectral leakage when the reciprocal of the record length is not an integer multiple of the unknown phase. We propose a dual-frequency estimator, which approaches the Cramer-Rao bound, when multiple samples are available.
  arXiv  Detail & Related papers  (2022-01-23T17:20:34Z)
• Near-Optimal Quantum Algorithms for Multivariate Mean Estimation [0.0]
  We propose the first near-optimal quantum algorithm for estimating in Euclidean norm the mean of a vector-valued random variable. We exploit a variety of additional algorithmic techniques such as amplitude amplification, the Bernstein-Vazirani algorithm, and quantum singular value transformation.
  arXiv  Detail & Related papers  (2021-11-18T16:35:32Z)
• Learning to Estimate Without Bias [57.82628598276623]
  Gauss theorem states that the weighted least squares estimator is a linear minimum variance unbiased estimation (MVUE) in linear models. In this paper, we take a first step towards extending this result to non linear settings via deep learning with bias constraints. A second motivation to BCE is in applications where multiple estimates of the same unknown are averaged for improved performance.
  arXiv  Detail & Related papers  (2021-10-24T10:23:51Z)
• Quantum Sub-Gaussian Mean Estimator [0.0]
  We present a new quantum algorithm for estimating the mean of a real-valued random variable. Our estimator achieves a nearly-optimal quadratic speedup over the number of classical i.i.d. samples.
  arXiv  Detail & Related papers  (2021-08-27T08:34:26Z)
• Quantifying Uncertainty in Deep Spatiotemporal Forecasting [67.77102283276409]
  We describe two types of forecasting problems: regular grid-based and graph-based. We analyze UQ methods from both the Bayesian and the frequentist point view, casting in a unified framework via statistical decision theory. Through extensive experiments on real-world road network traffic, epidemics, and air quality forecasting tasks, we reveal the statistical computational trade-offs for different UQ methods.
  arXiv  Detail & Related papers  (2021-05-25T14:35:46Z)
• Discriminative Jackknife: Quantifying Uncertainty in Deep Learning via Higher-Order Influence Functions [121.10450359856242]
  We develop a frequentist procedure that utilizes influence functions of a model's loss functional to construct a jackknife (or leave-one-out) estimator of predictive confidence intervals. The DJ satisfies (1) and (2), is applicable to a wide range of deep learning models, is easy to implement, and can be applied in a post-hoc fashion without interfering with model training or compromising its accuracy.
  arXiv  Detail & Related papers  (2020-06-29T13:36:52Z)

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.