Time-averaged continuous quantum measurement

• URL: http://arxiv.org/abs/2505.20382v1
• Date: Mon, 26 May 2025 18:00:00 GMT
• Title: Time-averaged continuous quantum measurement
• Authors: Pierre Guilmin, Pierre Rouchon, Antoine Tilloy,
• Abstract summary: Theory of continuous quantum measurement allows to reconstruct the state $rho_t$ of a system from a continuous measurement record $I_t$.<n>In experiments, one generally has access to its digitization, i.e., to a series of time averages $I_k$ over finite intervals of duration $Delta t$.<n>We show that $barrho_n+1$ can be computed recursively from $I_n+1$ and $barrho_n$ using an exact formula.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The theory of continuous quantum measurement allows to reconstruct the state $\rho_t$ of a system from a continuous stochastic measurement record $I_t$. However, this truly continuous-time signal $I_t$ is never available in practice. In experiments, one generally has access to its digitization, i.e., to a series of time averages $I_k$ over finite intervals of duration $\Delta t$. In this letter, we take this digitization seriously and define $\bar{\rho}_n$ as the best Bayesian estimate of the quantum state given (only) a digitized record $(I_1,\dots,I_n)$. We show that $\bar{\rho}_{n+1}$ can be computed recursively from $I_{n+1}$ and $\bar{\rho}_n$ using an exact formula. The latter can be evaluated numerically exactly, or used as the basis for a perturbative expansion into successive powers of $\sqrt{\Delta t}$. This allows reconstructing quantum trajectories in regimes of coarse $\Delta t$ where existing methods fail, estimating parameters at fixed $\Delta t$ without bias, and directly sampling digitized quantum trajectories with schemes of arbitrarily high order.

Related papers

• Quantum oracles for the finite element method [45.200826131319815]
  This study examines the quantum routines required for the implementation of oracles used in the block-encoding of the $N times N stiffness and mass matrices.<n>We show how to construct the necessary oracles, which require the calculation of element geometry, square root and the implementation of conditional operations.
  arXiv  Detail & Related papers  (2025-04-28T14:28:31Z)
• Exact Solvability Of Entanglement For Arbitrary Initial State in an Infinite-Range Floquet System [0.5371337604556311]
  We introduce an $N$-spin Floquet model with infinite-range Ising interactions. We numerically show that the values $langle Srangle/S_Max rightarrow 1$ for Ising strength deviates from $1$ for arbitrary initial states even though the thermodynamic limit does not exist in our model.
  arXiv  Detail & Related papers  (2024-11-25T18:55:05Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma.<n>This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles.<n>We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Optimal convergence rates in trace distance and relative entropy for the quantum central limit theorem [2.7855886538423182]
  We show that for a centered $m$-mode quantum state with finite third-order moments, the trace distance between $rhoboxplus n$ and $rho_G$ decays at the optimal rate of $mathcalO(n-1/2)$.<n>For states with finite fourth-order moments, we prove that the relative entropy between $rhoboxplus n$ and $rho_G$ decays at the optimal rate of $mathcalO(n-1)$.
  arXiv  Detail & Related papers  (2024-10-29T12:35:47Z)
• Control of the von Neumann Entropy for an Open Two-Qubit System Using Coherent and Incoherent Drives [50.24983453990065]
  This article is devoted to developing an approach for manipulating the von Neumann entropy $S(rho(t))$ of an open two-qubit system with coherent control and incoherent control inducing time-dependent decoherence rates. The following goals are considered: (a) minimizing or maximizing the final entropy $S(rho(T))$; (b) steering $S(rho(T))$ to a given target value; (c) steering $S(rho(T))$ to a target value and satisfying the pointwise state constraint $S(
  arXiv  Detail & Related papers  (2024-05-10T10:01:10Z)
• Hamiltonian simulation for low-energy states with optimal time dependence [45.02537589779136]
  We consider the task of simulating time evolution under a Hamiltonian $H$ within its low-energy subspace. We present a quantum algorithm that uses $O(tsqrtlambdaGamma + sqrtlambda/Gammalog (1/epsilon))$ queries to the block-encoding for any $Gamma$.
  arXiv  Detail & Related papers  (2024-04-04T17:58:01Z)
• The role of shared randomness in quantum state certification with unentangled measurements [36.19846254657676]
  We study quantum state certification using unentangled quantum measurements. $Theta(d2/varepsilon2)$ copies are necessary and sufficient for state certification. We develop a unified lower bound framework for both fixed and randomized measurements.
  arXiv  Detail & Related papers  (2024-01-17T23:44:52Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• A Quantum Approximation Scheme for k-Means [0.16317061277457]
  We give a quantum approximation scheme for the classical $k$-means clustering problem in the QRAM model.<n>Our quantum algorithm runs in time $tildeO left( 2tildeO(frackvarepsilon) eta2 dright)$.<n>Unlike previous works on unsupervised learning, our quantum algorithm does not require quantum linear algebra subroutines.
  arXiv  Detail & Related papers  (2023-08-16T06:46:37Z)
• Statistical Inference of Constrained Stochastic Optimization via Sketched Sequential Quadratic Programming [53.63469275932989]
  We consider online statistical inference of constrained nonlinear optimization problems.<n>We apply the Sequential Quadratic Programming (StoSQP) method to solve these problems.
  arXiv  Detail & Related papers  (2022-05-27T00:34:03Z)
• On quantum algorithms for the Schr\"odinger equation in the semi-classical regime [27.175719898694073]
  We consider Schr"odinger's equation in the semi-classical regime. Such a Schr"odinger equation finds many applications, including in Born-Oppenheimer molecular dynamics and Ehrenfest dynamics.
  arXiv  Detail & Related papers  (2021-12-25T20:01:54Z)
• Heisenberg-limited quantum phase estimation of multiple eigenvalues with few control qubits [1.6328866317851185]
  We show that single-control qubit variants of quantum phase estimation can achieve the Heisenberg limit, em also when one is unable to prepare eigenstates of the system. We present numerical evidence that using the matrix pencil technique the algorithm can achieve Heisenberg-limited scaling as well.
  arXiv  Detail & Related papers  (2021-07-09T18:00:10Z)
• Simplest non-additive measures of quantum resources [77.34726150561087]
  We study measures that can be described by $cal E(rhootimes N) =E(e;N) ne Ne$.
  arXiv  Detail & Related papers  (2021-06-23T20:27:04Z)
• Neural networks with superexpressive activations and integer weights [91.3755431537592]
  An example of an activation function $sigma$ is given such that networks with activations $sigma, lfloorcdotrfloor$, integer weights and a fixed architecture is given. The range of integer weights required for $varepsilon$-approximation of H"older continuous functions is derived.
  arXiv  Detail & Related papers  (2021-05-20T17:29:08Z)
• Non-Hermitian and Zeno limit of quantum systems under rapid measurements [0.0]
  We find a scaling collapse in $F(t)$ with respect to $tau$ and compute the total detection probability as well as the moments of the first detection time probability density $F(t)$ in the Zeno limit. We show that both solutions approach the same result in this small $tau$ limit, as long as the initial state $| psi_textin rangle$ is not parallel to the detection state.
  arXiv  Detail & Related papers  (2020-05-01T15:59:13Z)

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.