Optimal Adaptive Strategies for Sequential Quantum Hypothesis Testing

• URL: http://arxiv.org/abs/2104.14706v2
• Date: Mon, 28 Feb 2022 01:58:49 GMT
• Title: Optimal Adaptive Strategies for Sequential Quantum Hypothesis Testing
• Authors: Yonglong Li, Vincent Y. F. Tan, and Marco Tomamichel
• Abstract summary: We consider sequential hypothesis testing between two quantum states using adaptive and non-adaptive strategies. We show that these errors decrease exponentially with decay rates given by the measured relative entropies between the two states.
• Score: 87.17253904965372
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We consider sequential hypothesis testing between two quantum states using adaptive and non-adaptive strategies. In this setting, samples of an unknown state are requested sequentially and a decision to either continue or to accept one of the two hypotheses is made after each test. Under the constraint that the number of samples is bounded, either in expectation or with high probability, we exhibit adaptive strategies that minimize both types of misidentification errors. Namely, we show that these errors decrease exponentially (in the stopping time) with decay rates given by the measured relative entropies between the two states. Moreover, if we allow joint measurements on multiple samples, the rates are increased to the respective quantum relative entropies. We also fully characterize the achievable error exponents for non-adaptive strategies and provide numerical evidence showing that adaptive measurements are necessary to achieve our bounds under some additional assumptions.

Related papers

• Conditional Testing based on Localized Conformal p-values [5.6779147365057305]
  We define the localized conformal p-values by inverting prediction intervals and prove their theoretical properties. These defined p-values are then applied to several conditional testing problems to illustrate their practicality.
  arXiv  Detail & Related papers  (2024-09-25T11:30:14Z)
• Mitigating LLM Hallucinations via Conformal Abstention [70.83870602967625]
  We develop a principled procedure for determining when a large language model should abstain from responding in a general domain. We leverage conformal prediction techniques to develop an abstention procedure that benefits from rigorous theoretical guarantees on the hallucination rate (error rate) Experimentally, our resulting conformal abstention method reliably bounds the hallucination rate on various closed-book, open-domain generative question answering datasets.
  arXiv  Detail & Related papers  (2024-04-04T11:32:03Z)
• Uncertainty-Calibrated Test-Time Model Adaptation without Forgetting [55.17761802332469]
  Test-time adaptation (TTA) seeks to tackle potential distribution shifts between training and test data by adapting a given model w.r.t. any test sample. Prior methods perform backpropagation for each test sample, resulting in unbearable optimization costs to many applications. We propose an Efficient Anti-Forgetting Test-Time Adaptation (EATA) method which develops an active sample selection criterion to identify reliable and non-redundant samples.
  arXiv  Detail & Related papers  (2024-03-18T05:49:45Z)
• Shallow-Depth Variational Quantum Hypothesis Testing [0.0]
  We present a variational quantum algorithm for differentiating several hypotheses encoded as quantum channels. Both state preparation and measurement are simultaneously optimized using success probability of single-shot discrimination.
  arXiv  Detail & Related papers  (2023-04-28T09:26:26Z)
• Randomized adaptive quantum state preparation [0.0]
  A cost function is minimized to prepare a desired quantum state through an adaptively constructed quantum circuit. We provide theoretical arguments and numerical evidence that convergence to the target state can be achieved for almost all initial states.
  arXiv  Detail & Related papers  (2023-01-10T20:32:49Z)
• Using adaptiveness and causal superpositions against noise in quantum metrology [0.0]
  We derive new bounds on achievable precision in the most general adaptive quantum metrological scenarios. The bounds are proven to be saturable and equivalent to the known parallel scheme bounds in the limit of large number of channel uses.
  arXiv  Detail & Related papers  (2022-12-15T19:43:24Z)
• Sequential Quantum Channel Discrimination [19.785872350085878]
  We consider the sequential quantum channel discrimination problem using adaptive and non-adaptive strategies. We show that both types of error probabilities decrease to zero exponentially fast. We conjecture that the achievable rate region is not larger than that achievable with POVMs.
  arXiv  Detail & Related papers  (2022-10-20T08:13:39Z)
• Near-optimal inference in adaptive linear regression [60.08422051718195]
  Even simple methods like least squares can exhibit non-normal behavior when data is collected in an adaptive manner. We propose a family of online debiasing estimators to correct these distributional anomalies in at least squares estimation. We demonstrate the usefulness of our theory via applications to multi-armed bandit, autoregressive time series estimation, and active learning with exploration.
  arXiv  Detail & Related papers  (2021-07-05T21:05:11Z)
• Multivariate Probabilistic Regression with Natural Gradient Boosting [63.58097881421937]
  We propose a Natural Gradient Boosting (NGBoost) approach based on nonparametrically modeling the conditional parameters of the multivariate predictive distribution. Our method is robust, works out-of-the-box without extensive tuning, is modular with respect to the assumed target distribution, and performs competitively in comparison to existing approaches.
  arXiv  Detail & Related papers  (2021-06-07T17:44:49Z)
• The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime [52.38455827779212]
  We propose a novel technique for analyzing adaptive sampling called the em Simulator. We prove the first instance-based lower bounds the top-k problem which incorporate the appropriate log-factors. Our new analysis inspires a simple and near-optimal for the best-arm and top-k identification, the first em practical of its kind for the latter problem.
  arXiv  Detail & Related papers  (2017-02-16T23:42:02Z)

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.