Distributed quantum multiparameter estimation with optimal local measurements

• URL: http://arxiv.org/abs/2405.18404v1
• Date: Tue, 28 May 2024 17:45:07 GMT
• Title: Distributed quantum multiparameter estimation with optimal local measurements
• Authors: Luca Pezzè, Augusto Smerzi,
• Abstract summary: We study a sensor made by an array of $d$ spatially-distributed Mach-Zehnder interferometers (MZIs) We show that local measurements, independently performed on each MZI, are sufficient to provide a sensitivity saturating the quantum Cram'er-Rao bound. We find that the $d$ independent interferometers can achieve the same sensitivity of the entangled protocol but at the cost of using additional $d$ non-classical states.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the multiparameter sensitivity bounds of a sensor made by an array of $d$ spatially-distributed Mach-Zehnder interferometers (MZIs). A generic single non-classical state is mixed with $d-1$ vacuums to create a $d$-modes entangled state, each mode entering one input port of a MZI, while a coherent state enters its second port. We show that local measurements, independently performed on each MZI, are sufficient to provide a sensitivity saturating the quantum Cram\'er-Rao bound. The sensor can overcome the shot noise limit for the estimation of arbitrary linear combinations of the $d$ phase shifts, provided that the non-classical probe state has an anti-squeezed quadrature variance. We compare the sensitivity bounds of this sensor with that achievable with $d$ independent MZIs, each probed with a nonclassical state and a coherent state. We find that the $d$ independent interferometers can achieve the same sensitivity of the entangled protocol but at the cost of using additional $d$ non-classical states rather than a single one. When using in the two protocols the same average number of particles per shot $\bar{n}_T$, we find analytically a sensitivity scaling $1/\bar{n}_T^2$ for the entangled case which provides a gain factor $d$ with respect to the separable case where the sensitivity scales as $d/\bar{n}_T^2$. We have numerical evidences that the gain factor $d$ is also obtained when fixing the total average number of particles, namely when optimizing with respect to the number of repeated measurements.

Related papers

• Relative-Translation Invariant Wasserstein Distance [82.6068808353647]
  We introduce a new family of distances, relative-translation invariant Wasserstein distances ($RW_p$) We show that $RW_p distances are also real distance metrics defined on the quotient set $mathcalP_p(mathbbRn)/sim$ invariant to distribution translations.
  arXiv  Detail & Related papers  (2024-09-04T03:41:44Z)
• 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)
• Robust generation of $N$-partite $N$-level singlet states by identical particle interferometry [0.0]
  We propose an interferometric scheme for generating the totally antisymmetric state of $N$ identical bosons with $N$ internal levels. This state is a resource for various problems with dramatic quantum advantage.
  arXiv  Detail & Related papers  (2023-12-28T18:16:16Z)
• Ancilla quantum measurements on interacting chains: Sensitivity of entanglement dynamics to the type and concentration of detectors [46.76612530830571]
  We consider a quantum many-body lattice system that is coupled to ancillary degrees of freedom (detectors'') We explore the dynamics of density and of entanglement entropy in the chain, for various values of $rho_a$ and $M$.
  arXiv  Detail & Related papers  (2023-11-21T21:41:11Z)
• Distributed quantum sensing with optical lattices [0.0]
  In distributed quantum sensing the correlations between multiple modes, typically of a photonic system, are utilized to enhance the measurement precision of an unknown parameter. We show that it can allow for parameter estimation at the Heisenberg limit of $(N(M-1)T)2$, where $N$ is the number of particles, $M$ is the number of modes, and $T$ is the measurement time.
  arXiv  Detail & Related papers  (2022-08-10T03:47:44Z)
• Distributed Quantum Sensing with Squeezed-Vacuum Light in a Configurable Network of Mach-Zehnder Interferometers [0.0]
  We study a sensor network of distributed Mach-Zehnder interferometers (MZIs) for the parallel estimation of an arbitrary number $d geq 1$ of phase shifts. Our scheme paves the ways to a variety of applications in distributed quantum sensing.
  arXiv  Detail & Related papers  (2021-09-19T17:40:24Z)
• Heisenberg-limited estimation robust to detector inefficiency in a multi-parameter Mach-Zehnder network with squeezed light [0.0]
  A simple and intuitive geometrical picture of the state evolution is provided by the Wigner functions of the state at each interferometer output channel. The protocol allows to detect the value of the sum $beta=frac12(varphi_2)+theta_mathrmin-theta_mathrmout$.
  arXiv  Detail & Related papers  (2021-04-06T10:46:29Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction [63.41789556777387]
  Asynchronous Q-learning aims to learn the optimal action-value function (or Q-function) of a Markov decision process (MDP) We show that the number of samples needed to yield an entrywise $varepsilon$-accurate estimate of the Q-function is at most on the order of $frac1mu_min (1-gamma)5varepsilon2+ fract_mixmu_min (1-gamma)$ up to some logarithmic factor.
  arXiv  Detail & Related papers  (2020-06-04T17:51:00Z)
• Robustly Learning any Clusterable Mixture of Gaussians [55.41573600814391]
  We study the efficient learnability of high-dimensional Gaussian mixtures in the adversarial-robust setting. We provide an algorithm that learns the components of an $epsilon$-corrupted $k$-mixture within information theoretically near-optimal error proofs of $tildeO(epsilon)$. Our main technical contribution is a new robust identifiability proof clusters from a Gaussian mixture, which can be captured by the constant-degree Sum of Squares proof system.
  arXiv  Detail & Related papers  (2020-05-13T16:44: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.