Optimal Measurement of Field Properties with Quantum Sensor Networks

• URL: http://arxiv.org/abs/2011.01259v1
• Date: Mon, 2 Nov 2020 19:02:28 GMT
• Title: Optimal Measurement of Field Properties with Quantum Sensor Networks
• Authors: Timothy Qian, Jacob Bringewatt, Igor Boettcher, Przemyslaw Bienias, and Alexey V. Gorshkov
• Abstract summary: We consider a quantum sensor network of qubit sensors coupled to a field $f(vecx;vectheta)$ analytically parameterized by the vector of parameters $vectheta$. We derive saturable bounds on the precision of measuring an arbitrary analytic function $q(vectheta)$ of these parameters.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider a quantum sensor network of qubit sensors coupled to a field $f(\vec{x};\vec{\theta})$ analytically parameterized by the vector of parameters $\vec\theta$. The qubit sensors are fixed at positions $\vec{x}_1,\dots,\vec{x}_d$. While the functional form of $f(\vec{x};\vec{\theta})$ is known, the parameters $\vec{\theta}$ are not. We derive saturable bounds on the precision of measuring an arbitrary analytic function $q(\vec{\theta})$ of these parameters and construct the optimal protocols that achieve these bounds. Our results are obtained from a combination of techniques from quantum information theory and duality theorems for linear programming. They can be applied to many problems, including optimal placement of quantum sensors, field interpolation, and the measurement of functionals of parametrized fields.

Related papers

• Fundamental limits of metrology at thermal equilibrium [0.0]
  We consider the estimation of an unknown parameter $theta$ through a quantum probe at thermal equilibrium. We find the maximal Quantum Fisher Information attainable via arbitrary $HC$, which provides a fundamental bound on the measurement precision.
  arXiv  Detail & Related papers  (2024-02-09T18:01:45Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• 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)
• Efficient displacement convex optimization with particle gradient descent [57.88860627977882]
  Particle gradient descent is widely used to optimize functions of probability measures. This paper considers particle gradient descent with a finite number of particles and establishes its theoretical guarantees to optimize functions that are emphdisplacement convex in measures.
  arXiv  Detail & Related papers  (2023-02-09T16:35:59Z)
• Quantum Multi-Parameter Adaptive Bayesian Estimation and Application to Super-Resolution Imaging [1.4222887950206657]
  In quantum sensing tasks, the user gets $rho_theta$, the quantum state that encodes $theta$. Personick found the optimum POVM $Pi_l$ that minimizes the MMSE over all possible measurements. This result from 1971 is less-widely known than the quantum Fisher information (QFI), which lower bounds the variance of an unbiased estimator.
  arXiv  Detail & Related papers  (2022-02-21T04:12:55Z)
• Multiparameter simultaneous optimal estimation with an SU(2) coding unitary evolution [5.789743084845758]
  In a ubiquitous $SU(2)$ dynamics, achieving the simultaneous optimal estimation of multiple parameters is difficult. We propose a method, characterized by the nested cross-products of the coefficient vector $mathbfX$ of $SU(2)$ generators. Our work reveals that quantum control is not always functional in improving the estimation precision.
  arXiv  Detail & Related papers  (2022-02-08T06:05:20Z)
• Random matrices in service of ML footprint: ternary random features with no performance loss [55.30329197651178]
  We show that the eigenspectrum of $bf K$ is independent of the distribution of the i.i.d. entries of $bf w$. We propose a novel random technique, called Ternary Random Feature (TRF) The computation of the proposed random features requires no multiplication and a factor of $b$ less bits for storage compared to classical random features.
  arXiv  Detail & Related papers  (2021-10-05T09:33:49Z)
• Intrinsic Sensitivity Limits for Multiparameter Quantum Metrology [0.0]
  The quantum Cram'er-Rao bound provides the ultimate precision in parameter estimation. We show that, if the information is encoded in a unitary transformation, we can naturally choose the weight matrix. This ensures an intrinsic bound that is independent of the choice of parametrization.
  arXiv  Detail & Related papers  (2021-05-10T18:00:03Z)
• Spectral density estimation with the Gaussian Integral Transform [91.3755431537592]
  spectral density operator $hatrho(omega)=delta(omega-hatH)$ plays a central role in linear response theory. We describe a near optimal quantum algorithm providing an approximation to the spectral density.
  arXiv  Detail & Related papers  (2020-04-10T03:14:38Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits [0.755972004983746]
  Variational quantum algorithms (VQAs) optimize the parameters $vectheta$ of a parametrized quantum circuit. We prove two results, assuming $V(vectheta)$ is an alternating layered ansatz composed of blocks forming local 2-designs. We illustrate these ideas with large-scale simulations, up to 100 qubits, of a quantum autoencoder implementation.
  arXiv  Detail & Related papers  (2020-01-02T18:18:25Z)

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.