Saturable global quantum sensing
- URL: http://arxiv.org/abs/2410.12050v2
- Date: Sat, 21 Jun 2025 02:51:30 GMT
- Title: Saturable global quantum sensing
- Authors: Chiranjib Mukhopadhyay, Matteo G. A. Paris, Abolfazl Bayat,
- Abstract summary: We provide an operationally motivated approach to global sensing for fixed but optimized settings.<n>Our scheme yields a saturable precision bound optimizing the measurement as well as the probe preparation simultaneously.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Conventional formulation of quantum sensing has been mostly developed in the context of local estimation, where the unknown parameter is roughly known. In contrast, global sensing, where the prior information is incomplete and the unknown parameter is only known to lie within a broad interval, is practically more engaging but has received far less theoretical attention. Available formulations of global sensing rely on adaptive Bayesian strategies requiring on-the-fly change in measurement settings, or minimizing average uncertainty yielding unsaturable bounds. Here, we provide an operationally motivated approach to global sensing for fixed but optimized settings. Our scheme yields a saturable precision bound optimizing the measurement as well as the probe preparation simultaneously. The formalism is general and computationally scalable for generic bosonic multimode Gaussian or many-particle free-fermionic quantum sensors. We illustrate the implications for Gaussian thermometry and Gaussian phase estimation by showing that the optimal measurement changes, either gradually or abruptly, from homodyne for local sensing, towards heterodyne for global sensing. In contrast, for fermionic transverse XY probes, the optimal measurement basis stays fixed independent of width.
Related papers
- Entanglement-Constrained Quantum Metrology: Rapid Low-Entanglement Gains, Tapered High-Level Growth [0.0]
We consider the potential experimental limitation on probe entanglement, and find a relation between achievable precision and initial probe entanglement.<n>For two-qubit probes, we analytically derive an exact relationship between the entanglement-constrained optimal quantum Fisher information and the limited initial entanglement.<n>We identify the specific states that realize maximum precision in these scenarios.
arXiv Detail & Related papers (2025-07-04T12:09:37Z) - On the role of symmetry and geometry in global quantum sensing [0.0]
Global quantum sensing enables parameter estimation across arbitrary ranges with a finite number of measurements.<n>There are two fundamentally different ways to capture prior ignorance and uninformed estimation.<n>We show how to apply the two approaches in relevant examples of rate and coherence estimation in noisy settings.
arXiv Detail & Related papers (2025-02-20T18:39:20Z) - Current Trends in Global Quantum Metrology [0.0]
Quantum sensors are universally acknowledged as one of the most promising near-term quantum technologies.
We review some of the emerging developments in global quantum estimation.
In the first approach, in order to achieve the best performance, one has to optimize the measurement settings adaptively.
arXiv Detail & Related papers (2024-11-06T11:39:58Z) - 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) - Optimal estimation of pure states with displaced-null measurements [0.0]
We revisit the problem of estimating an unknown parameter of a pure quantum state.
We investigate null-measurement' strategies in which the experimenter aims to measure in a basis that contains a vector close to the true system state.
arXiv Detail & Related papers (2023-10-10T16:46:24Z) - 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) - Learning Signed Hyper Surfaces for Oriented Point Cloud Normal Estimation [53.19926259132379]
We propose a novel method called SHS-Net for oriented normal estimation of point clouds by learning signed hyper surfaces.
The signed hyper surfaces are implicitly learned in a high-dimensional feature space where the local and global information is aggregated.
An attention-weighted normal prediction module is proposed as a decoder, which takes the local and global latent codes as input to predict oriented normals.
arXiv Detail & Related papers (2023-05-10T03:40:25Z) - Scalable Bayesian Meta-Learning through Generalized Implicit Gradients [64.21628447579772]
Implicit Bayesian meta-learning (iBaML) method broadens the scope of learnable priors, but also quantifies the associated uncertainty.
Analytical error bounds are established to demonstrate the precision and efficiency of the generalized implicit gradient over the explicit one.
arXiv Detail & Related papers (2023-03-31T02:10:30Z) - Instance-Dependent Generalization Bounds via Optimal Transport [51.71650746285469]
Existing generalization bounds fail to explain crucial factors that drive the generalization of modern neural networks.
We derive instance-dependent generalization bounds that depend on the local Lipschitz regularity of the learned prediction function in the data space.
We empirically analyze our generalization bounds for neural networks, showing that the bound values are meaningful and capture the effect of popular regularization methods during training.
arXiv Detail & Related papers (2022-11-02T16:39:42Z) - Optimal Scaling for Locally Balanced Proposals in Discrete Spaces [65.14092237705476]
We show that efficiency of Metropolis-Hastings (M-H) algorithms in discrete spaces can be characterized by an acceptance rate that is independent of the target distribution.
Knowledge of the optimal acceptance rate allows one to automatically tune the neighborhood size of a proposal distribution in a discrete space, directly analogous to step-size control in continuous spaces.
arXiv Detail & Related papers (2022-09-16T22:09:53Z) - 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) - Bosonic field digitization for quantum computers [62.997667081978825]
We address the representation of lattice bosonic fields in a discretized field amplitude basis.
We develop methods to predict error scaling and present efficient qubit implementation strategies.
arXiv Detail & Related papers (2021-08-24T15:30:04Z) - Fundamental limits in Bayesian thermometry and attainability via
adaptive strategies [0.0]
We investigate the limits of thermometry using quantum probes at thermal equilibrium within the Bayesian approach.
We obtain an ultimate bound on thermometry precision in the Bayesian setting, valid for arbitrary interactions and measurement schemes.
We derive a no-go theorem for non-adaptive protocols that does not allow for better than linear (shot-noise-like) scaling.
arXiv Detail & Related papers (2021-08-12T19:14:20Z) - Positive-Negative Momentum: Manipulating Stochastic Gradient Noise to
Improve Generalization [89.7882166459412]
gradient noise (SGN) acts as implicit regularization for deep learning.
Some works attempted to artificially simulate SGN by injecting random noise to improve deep learning.
For simulating SGN at low computational costs and without changing the learning rate or batch size, we propose the Positive-Negative Momentum (PNM) approach.
arXiv Detail & Related papers (2021-03-31T16:08:06Z) - Global sensing and its impact for quantum many-body probes with
criticality [0.0]
Most quantum sensing protocols operate efficiently only when the unknown parameters vary within a very narrow region.
In many-body probes, in which extra tunable parameters exist, our protocol can tune the performance for harnessing the quantum criticality.
We show that even a simple magnetization measurement significantly benefits from our optimization and moderately delivers the theoretical precision.
arXiv Detail & Related papers (2021-02-07T16:40:17Z) - Temporal Difference Uncertainties as a Signal for Exploration [76.6341354269013]
An effective approach to exploration in reinforcement learning is to rely on an agent's uncertainty over the optimal policy.
In this paper, we highlight that value estimates are easily biased and temporally inconsistent.
We propose a novel method for estimating uncertainty over the value function that relies on inducing a distribution over temporal difference errors.
arXiv Detail & Related papers (2020-10-05T18:11:22Z) - Bayesian parameter estimation using Gaussian states and measurements [0.0]
We consider three paradigmatic estimation schemes in continuous-variable quantum metrology.
We investigate the precision achievable with single-mode Gaussian states under homodyne and heterodyne detection.
This allows us to identify Bayesian estimation strategies that combine good performance with the potential for straightforward experimental realization.
arXiv Detail & Related papers (2020-09-08T12:54:12Z)
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.