Extrapolation of quantum measurement data

• URL: http://arxiv.org/abs/2507.06912v1
• Date: Wed, 09 Jul 2025 14:49:13 GMT
• Title: Extrapolation of quantum measurement data
• Authors: Konstantinos Manos, Mirjam Weilenmann, Miguel Navascues,
• Abstract summary: We consider the problem of predicting future expectation values of a collection of quantum observables, given their noisy expectation values at past times.<n>We find highly problematic datasets that allow full predictability at any future time $tau$, but only when past averages are known up to precision superexponential in $tau$.<n>We identify "aha! datasets", which drastically increase the predictability of the future statistics of an unrelated measurement.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the problem of predicting future expectation values of a collection of quantum observables, given their noisy expectation values at past times. The measured observables, the initial state of the physical system and even the Hilbert space are unknown; we nonetheless assume a promise on the energy distribution of the state. Investigating to what extent extrapolation is possible in this framework, we discover highly problematic datasets that allow full predictability at any future time $\tau$, but only when past averages are known up to precision superexponential in $\tau$. We also find families of "self-testing datasets", which allow practical predictability under reasonable noise levels and whose approximate realization singles out specific Hamiltonians, states and measurement operators. We identify "aha! datasets", which drastically increase the predictability of the future statistics of an unrelated measurement, as well as "fog banks": fairly simple datasets that exhibit complete unpredictability at some future time $\tau$, but full predictability for a later time $\tau'>\tau$. Finally, we prove that the extrapolation problem is efficiently solvable up to arbitrary precision through hierarchies of semidefinite programming relaxations.

Related papers

• Unified Uncertainty-Aware Diffusion for Multi-Agent Trajectory Modeling [13.993231805213354]
  We introduce U2Diff, a textbfunified diffusion model designed to handle trajectory completion.<n>We also incorporate a Rank Neural Network in post-processing to enable textbferror probability estimation for each generated mode.<n>Our method outperforms the state-of-the-art solutions in trajectory completion and forecasting across four challenging sports datasets.
  arXiv  Detail & Related papers  (2025-03-24T11:46:58Z)
• Measuring In-Context Computation Complexity via Hidden State Prediction [33.504027525492056]
  We show that a neural sequence model's ability to predict its own future hidden states correlates with the intuitive interestingness of the task.<n>We propose a novel learned predictive prior that enables us to measure the novel information gained in each step.<n>Our metric predicts the description length of formal languages learned in-context, the complexity of mathematical reasoning problems, and the correctness of self-generated reasoning chains.
  arXiv  Detail & Related papers  (2025-03-17T17:56:14Z)
• Predicting adaptively chosen observables in quantum systems [1.1562071835482224]
  This work investigates the adaptive setting for three classes of observables: local, Pauli, and bounded-Frobenius-norm observables. We prove that $Omega(sqrtM)$ samples of an arbitrarily large unknown quantum state are necessary to predict expectation values of $M$ adaptively chosen local and Pauli observables.
  arXiv  Detail & Related papers  (2024-10-20T20:45:10Z)
• Tackling Missing Values in Probabilistic Wind Power Forecasting: A Generative Approach [1.384633930654651]
  We propose treating missing values and forecasting targets indifferently and predicting all unknown values simultaneously. Compared with the traditional "impute, then predict" pipeline, the proposed approach achieves better performance in terms of continuous ranked probability score.
  arXiv  Detail & Related papers  (2024-03-06T11:38:08Z)
• Score Matching-based Pseudolikelihood Estimation of Neural Marked Spatio-Temporal Point Process with Uncertainty Quantification [59.81904428056924]
  We introduce SMASH: a Score MAtching estimator for learning markedPs with uncertainty quantification. Specifically, our framework adopts a normalization-free objective by estimating the pseudolikelihood of markedPs through score-matching. The superior performance of our proposed framework is demonstrated through extensive experiments in both event prediction and uncertainty quantification.
  arXiv  Detail & Related papers  (2023-10-25T02:37:51Z)
• Pedestrian Trajectory Forecasting Using Deep Ensembles Under Sensing Uncertainty [125.41260574344933]
  We consider an encoder-decoder based deep ensemble network for capturing both perception and predictive uncertainty simultaneously. Overall, deep ensembles provided more robust predictions and the consideration of upstream uncertainty further increased the estimation accuracy for the model.
  arXiv  Detail & Related papers  (2023-05-26T04:27:48Z)
• Exponentially improved efficient machine learning for quantum many-body states with provable guarantees [0.0]
  We provide theoretical guarantees for efficient learning of quantum many-body states and their properties, with model-independent applications. Our results provide theoretical guarantees for efficient learning of quantum many-body states and their properties, with model-independent applications.
  arXiv  Detail & Related papers  (2023-04-10T02:22:36Z)
• Uncertainty estimation of pedestrian future trajectory using Bayesian approximation [137.00426219455116]
  Under dynamic traffic scenarios, planning based on deterministic predictions is not trustworthy. The authors propose to quantify uncertainty during forecasting using approximation which deterministic approaches fail to capture. The effect of dropout weights and long-term prediction on future state uncertainty has been studied.
  arXiv  Detail & Related papers  (2022-05-04T04:23:38Z)
• Dense Uncertainty Estimation [62.23555922631451]
  In this paper, we investigate neural networks and uncertainty estimation techniques to achieve both accurate deterministic prediction and reliable uncertainty estimation. We work on two types of uncertainty estimations solutions, namely ensemble based methods and generative model based methods, and explain their pros and cons while using them in fully/semi/weakly-supervised framework.
  arXiv  Detail & Related papers  (2021-10-13T01:23:48Z)
• Understanding the Under-Coverage Bias in Uncertainty Estimation [58.03725169462616]
  quantile regression tends to emphunder-cover than the desired coverage level in reality. We prove that quantile regression suffers from an inherent under-coverage bias. Our theory reveals that this under-coverage bias stems from a certain high-dimensional parameter estimation error.
  arXiv  Detail & Related papers  (2021-06-10T06:11:55Z)
• Improving Uncertainty Calibration via Prior Augmented Data [56.88185136509654]
  Neural networks have proven successful at learning from complex data distributions by acting as universal function approximators. They are often overconfident in their predictions, which leads to inaccurate and miscalibrated probabilistic predictions. We propose a solution by seeking out regions of feature space where the model is unjustifiably overconfident, and conditionally raising the entropy of those predictions towards that of the prior distribution of the labels.
  arXiv  Detail & Related papers  (2021-02-22T07:02:37Z)
• Ambiguity in Sequential Data: Predicting Uncertain Futures with Recurrent Models [110.82452096672182]
  We propose an extension of the Multiple Hypothesis Prediction (MHP) model to handle ambiguous predictions with sequential data. We also introduce a novel metric for ambiguous problems, which is better suited to account for uncertainties.
  arXiv  Detail & Related papers  (2020-03-10T09:15:42Z)

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.