Distributed Quantum Sensing with Squeezed-Vacuum Light in a Configurable Network of Mach-Zehnder Interferometers

• URL: http://arxiv.org/abs/2109.09178v1
• Date: Sun, 19 Sep 2021 17:40:24 GMT
• Title: Distributed Quantum Sensing with Squeezed-Vacuum Light in a Configurable Network of Mach-Zehnder Interferometers
• Authors: Marco Malitesta, Augusto Smerzi, Luca Pezz\`e
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study a sensor network of distributed Mach-Zehnder interferometers (MZIs) for the parallel (simultaneous) estimation of an arbitrary number $d \geq 1$ of phase shifts. The scheme uses a squeezed-vacuum state that is split between $d$ modes by a quantum circuit (QC). Each output mode of the QC is the input of one of $d$ MZIs, the other input of each MZI being a coherent state. In particular, ${\it i}$) we identify the optimal configuration of the sensor network that allows the estimation of any linear combination of the $d$ phases with maximal sensitivity. The protocol overcomes the shot-noise limit and reaches Heisenberg scalings with respect to the total average number of particles in the overall probe state, the multiphase estimation only requiring local photocounting. Furthermore, the parallel multiphase estimation overcomes optimal separable strategies for the estimation of any linear combination of the phases: the sensitivity gain being a factor $d$, at most. Viceversa, ${\it ii}$) given a specific QC, we identify the optimal linear combination of the phases that maximizes the sensitivity and show that results are robust against random choices of the QC. Our scheme paves the ways to a variety of applications in distributed quantum sensing.

Related papers

• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Enhancing phase sensitivity in Mach-Zehnder interferometer with various detection schemes using SU(1,1) coherent states [0.0]
  The Mach-Zehnder interferometer (MZI) is a versatile tool for analyzing this phenomenon. This paper analyzes the phase sensitivity of a MZI in various scenarios using different detection schemes and input states.
  arXiv  Detail & Related papers  (2024-06-12T08:54:17Z)
• Distributed quantum multiparameter estimation with optimal local measurements [0.0]
  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.
  arXiv  Detail & Related papers  (2024-05-28T17:45:07Z)
• Comparing Three Generations of D-Wave Quantum Annealers for Minor Embedded Combinatorial Optimization Problems [1.0878040851638]
  We report benchmarks across three generations of D-Wave quantum annealers. The Ising, or equivalently QUBO, formulation of these problems do not require auxiliary variables for order reduction.
  arXiv  Detail & Related papers  (2023-01-08T10:02:56Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Simulating excited states of the Lipkin model on a quantum computer [0.0]
  We show that the accuracy strongly depends on the fermion to qubit encoding. We use IBM quantum machines to compute the energy spectrum for a system of $N=2, 3$ and $4$ particles.
  arXiv  Detail & Related papers  (2022-03-03T01:43:12Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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)
• Tightening the Dependence on Horizon in the Sample Complexity of Q-Learning [59.71676469100807]
  This work sharpens the sample complexity of synchronous Q-learning to an order of $frac|mathcalS|| (1-gamma)4varepsilon2$ for any $0varepsilon 1$. Our finding unveils the effectiveness of vanilla Q-learning, which matches that of speedy Q-learning without requiring extra computation and storage.
  arXiv  Detail & Related papers  (2021-02-12T14:22:05Z)
• 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)

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.