Quantum trajectories for time-binned data and their closeness to fully conditioned quantum trajectories

• URL: http://arxiv.org/abs/2601.10937v1
• Date: Fri, 16 Jan 2026 01:46:56 GMT
• Title: Quantum trajectories for time-binned data and their closeness to fully conditioned quantum trajectories
• Authors: Nattaphong Wonglakhon, Areeya Chantasri, Howard M. Wiseman,
• Abstract summary: We introduce a new finite-interval dynamical map for quantum trajectories with time-intervals of finite size $t$.<n>For a generic system, if the statistic $_t$ can be extracted from experiment along with $I_t$, then the $$-map gives a smaller error than any other.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum trajectories are dynamical equations for quantum states conditioned on the results of a time-continuous measurement, such as a continuous-in-time current $\vec y_t$. Recently there has been renewed interest in dynamical maps for quantum trajectories with time-intervals of finite size $Δt$. Guilmin \emph{et al.} (unpublished) derived such a dynamical map for the (experimentally relevant) case where only the average current $I_t$ over each interval is available. Surprisingly, this binned data still generates a conditioned state $ρ_\text{\faFaucet}$ that is almost pure (for efficient measurements), with an impurity scaling as $(Δt)^{3}$. We show that, nevertheless, the typical distance of $ρ_\text{\faFaucet}$ from $\hatψ_{\text{F}; \vec y_t}$ -- the projector for the pure state conditioned on the full current -- is as large as $(Δt)^{3/2}$. We introduce another finite-interval dynamical map (``$Φ$-map''), which requires only one additional real statistic, $φ_t$, of the current in the interval, that gives a conditioned state $\hatψ_Φ$ which is only $(Δt)^{2}$-distant from $\hatψ_{\text{F}; \vec y_t}$. We numerically verify these scalings of the error (distance from the true states) for these two maps, as well as for the lowest-order (Itô) map and two other higher-order maps. Our results show that, for a generic system, if the statistic $φ_t$ can be extracted from experiment along with $I_t$, then the $Φ$-map gives a smaller error than any other.

Related papers

• High-accuracy sampling for diffusion models and log-concave distributions [70.90863485771405]
  We present algorithms for diffusion model sampling which obtain $$-error in $mathrmpolylog (1/)$ steps.<n>Our approach also yields the first $mathrmpolylog (1/)$ complexity sampler for general log-concave distributions.
  arXiv  Detail & Related papers  (2026-02-01T17:05:31Z)
• Sublinear Time Quantum Sensitivity Sampling [57.356528942341534]
  We present a unified framework for quantum sensitivity sampling, extending the advantages of quantum computing to a broad class of classical approximation problems.<n>Our framework provides a streamlined approach for constructing coresets and offers significant runtime improvements in applications such as clustering, regression, and low-rank approximation.
  arXiv  Detail & Related papers  (2025-09-20T20:18:49Z)
• Time-averaged continuous quantum measurement [0.0]
  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.
  arXiv  Detail & Related papers  (2025-05-26T18:00:00Z)
• Extracting Dynamical Maps of Non-Markovian Open Quantum Systems [0.0]
  We show thatLambda(tau)$ arises from suddenly coupling a system to one or more thermal baths with a strength that is neither weak nor strong. We employ the Choi-Jamiolkowski isomorphism so that $hatLambda(tau)$ can be fully reconstructed. Our numerical examples of interacting spinless Fermi chains and the single impurity Anderson model demonstrate regimes where our approach can offer a significant speedup.
  arXiv  Detail & Related papers  (2024-09-25T16:09:03Z)
• 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)
• Measuring quantum relative entropy with finite-size effect [53.64687146666141]
  We study the estimation of relative entropy $D(rho|sigma)$ when $sigma$ is known.<n>Our estimator attains the Cram'er-Rao type bound when the dimension $d$ is fixed.
  arXiv  Detail & Related papers  (2024-06-25T06:07:20Z)
• The Monge Gap: A Regularizer to Learn All Transport Maps [34.81915836064636]
  Brenier's theorem states that when the ground cost is the squared-Euclidean distance, the best'' map to morph a continuous measure in $mathcalP(Rd)$ into another must be the gradient of a convex function. Despite their mathematical elegance, fitting OT maps with ICNNs raises many challenges. We propose a radically different approach to estimating OT maps.
  arXiv  Detail & Related papers  (2023-02-09T21:56:11Z)
• Dynamic Ranking and Translation Synchronization [3.946250592943285]
  We study an extension of the emphtranslation synchronization problem, to the dynamic setting. We propose two estimators -- one based on a smoothness-penalized least squares approach and the other based on projection onto the low frequency eigenspace of a suitable smoothness operator.
  arXiv  Detail & Related papers  (2022-07-04T14:45:12Z)
• Supervised Training of Conditional Monge Maps [107.78770597815242]
  Optimal transport (OT) theory describes general principles to define and select, among many possible choices, the most efficient way to map a probability measure onto another. We introduce CondOT, a multi-task approach to estimate a family of OT maps conditioned on a context variable. We demonstrate the ability of CondOT to infer the effect of an arbitrary combination of genetic or therapeutic perturbations on single cells.
  arXiv  Detail & Related papers  (2022-06-28T19:34:44Z)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• Improved Sample Complexity for Incremental Autonomous Exploration in MDPs [132.88757893161699]
  We learn the set of $epsilon$-optimal goal-conditioned policies attaining all states that are incrementally reachable within $L$ steps. DisCo is the first algorithm that can return an $epsilon/c_min$-optimal policy for any cost-sensitive shortest-path problem.
  arXiv  Detail & Related papers  (2020-12-29T14:06:09Z)
• On Efficient Low Distortion Ultrametric Embedding [18.227854382422112]
  A widely-used method to preserve the underlying hierarchical structure of the data is to find an embedding of the data into a tree or an ultrametric. In this paper, we provide a new algorithm which takes as input a set of points isometric in $mathbbRd2 (for universal constant $rho>1$) to output an ultrametric $Delta. We show that the output of our algorithm is comparable to the output of the linkage algorithms while achieving a much faster running time.
  arXiv  Detail & Related papers  (2020-08-15T11:06:45Z)

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.