Beyond Hoeffding and Chernoff: Trading conclusiveness for advantages in quantum hypothesis testing

• URL: http://arxiv.org/abs/2510.07601v1
• Date: Wed, 08 Oct 2025 22:42:11 GMT
• Title: Beyond Hoeffding and Chernoff: Trading conclusiveness for advantages in quantum hypothesis testing
• Authors: Kaiyuan Ji, Bartosz Regula,
• Abstract summary: We study protocols that are permitted a suitably measurement probability of producing an inconclusive discrimination outcome.<n>We show that even by allowing an arbitrarily small probability of inconclusiveness, the limits imposed by the quantum Hoeffding and Chernoff bounds can be significantly exceeded.
• Score: 2.046223849354785
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The ultimate limits of quantum state discrimination are often thought to be captured by asymptotic bounds that restrict the achievable error probabilities, notably the quantum Chernoff and Hoeffding bounds. Here we study hypothesis testing protocols that are permitted a probability of producing an inconclusive discrimination outcome, and investigate their performance when this probability is suitably constrained. We show that even by allowing an arbitrarily small probability of inconclusiveness, the limits imposed by the quantum Hoeffding and Chernoff bounds can be significantly exceeded, completely circumventing the conventional trade-offs between error exponents in hypothesis testing. Furthermore, such improvements over standard state discrimination are robust and can be obtained even when an exponentially vanishing probability of inconclusive outcomes is demanded. Relaxing the constraints on the inconclusive probability can enable even larger advantages, but this comes at a price. We show a 'strong converse' property of this setting: targeting error exponents beyond those achievable with vanishing inconclusiveness necessarily forces the probability of inconclusive outcomes to converge to one. By exactly quantifying the rate of this convergence, we give a complete characterisation of the trade-offs between error exponents and rates of conclusive outcome probabilities. Overall, our results provide a comprehensive asymptotic picture of how allowing inconclusive measurement outcomes reshapes optimal quantum hypothesis testing.

Related papers

• Generalized quantum Chernoff bound [1.8371802327210847]
  We establish a quantum Chernoff bound for the discrimination of multiple sets of quantum states.<n>We show that discriminating between sets of quantum states is no harder than discriminating between their worst-case elements in terms of error probability.
  arXiv  Detail & Related papers  (2025-08-18T12:41:04Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Converse bounds for quantum hypothesis exclusion: A divergence-radius approach [14.499463058550683]
  We apply strong converse results for asymmetric binary hypothesis testing to distinguishing an arbitrary dummy'' hypothesis from each of the concerned candidates.<n>This leads to the desired upper bounds in terms of divergence via a geometrically inspired argument.
  arXiv  Detail & Related papers  (2025-01-16T18:01:19Z)
• To Believe or Not to Believe Your LLM [51.2579827761899]
  We explore uncertainty quantification in large language models (LLMs) We derive an information-theoretic metric that allows to reliably detect when only epistemic uncertainty is large. We conduct a series of experiments which demonstrate the advantage of our formulation.
  arXiv  Detail & Related papers  (2024-06-04T17:58:18Z)
• Kirkwood-Dirac Type Quasiprobabilities as Universal Identifiers of Nonclassical Quantum Resources [0.0]
  We show that a Kirkwood-Dirac type quasiprobability distribution is sufficient to reveal any arbitrary quantum resource. The quasiprobability reveals a resourceful quantum state by having at least one quasiprobability outcome with a strictly negative numerical value.
  arXiv  Detail & Related papers  (2024-01-07T14:56:32Z)
• On the optimal error exponents for classical and quantum antidistinguishability [3.481985817302898]
  Antidistinguishability has been used to investigate the reality of quantum states. We show that the optimal error exponent vanishes to zero for classical and quantum antidistinguishability. It remains an open problem to obtain an explicit expression for the optimal error exponent for quantum antidistinguishability.
  arXiv  Detail & Related papers  (2023-09-07T14:03:58Z)
• Near-Optimal Non-Parametric Sequential Tests and Confidence Sequences with Possibly Dependent Observations [44.71254888821376]
  We provide the first type-I-error and expected-rejection-time guarantees under general non-data generating processes. We show how to apply our results to inference on parameters defined by estimating equations, such as average treatment effects.
  arXiv  Detail & Related papers  (2022-12-29T18:37:08Z)
• Monotonicity and Double Descent in Uncertainty Estimation with Gaussian Processes [52.92110730286403]
  It is commonly believed that the marginal likelihood should be reminiscent of cross-validation metrics and that both should deteriorate with larger input dimensions. We prove that by tuning hyper parameters, the performance, as measured by the marginal likelihood, improves monotonically with the input dimension. We also prove that cross-validation metrics exhibit qualitatively different behavior that is characteristic of double descent.
  arXiv  Detail & Related papers  (2022-10-14T08:09:33Z)
• Excluding false negative error in certification of quantum channels [68.8204255655161]
  This work focuses on the scenario when the false negative error cannot occur, even if it leads to the growth of the probability of false positive error. We establish a condition when it is possible to exclude false negative error after a finite number of queries to the quantum channel in parallel.
  arXiv  Detail & Related papers  (2021-06-04T09:41:11Z)
• Optimal Adaptive Strategies for Sequential Quantum Hypothesis Testing [87.17253904965372]
  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.
  arXiv  Detail & Related papers  (2021-04-30T00:52:48Z)
• 'Interaction-Free' Channel Discrimination [0.0]
  We generalize the notion of 'interaction-free' measurement to arbitrary quantum channels. Our main result is a necessary and sufficient criterion for when it is possible or impossible to discriminate quantum channels in an 'interaction-free' manner.
  arXiv  Detail & Related papers  (2020-10-01T18:06:56Z)
• On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization [55.937424268654645]
  We consider algorithm-independent lower bounds for the problem of black-box optimization of functions having a bounded norm. We provide a novel proof technique for deriving lower bounds on the regret, with benefits including simplicity, versatility, and an improved dependence on the error probability.
  arXiv  Detail & Related papers  (2020-08-20T03:48:14Z)

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.