Minimax games for quantum channel discrimination

• URL: http://arxiv.org/abs/2609.09839v1
• Date: Wed, 09 Sep 2026 07:46:08 GMT
• Title: Minimax games for quantum channel discrimination
• Abstract summary: Quantum channel discrimination is a primitive task for identifying, verifying, and benchmarking quantum dynamics.<n>Here, we introduce a game-theoretic framework in which both the tester and jammer control separate inputs.<n>We develop a general argument that upgrades achievability results to strong converse results, thereby establishing strong converse properties for several game models.
• Score: 52.790001414559136
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum channel discrimination is a primitive task for identifying, verifying, and benchmarking quantum dynamics. Previous studies have primarily considered either the best-case tester-input setting or the worst-case jammer-input setting. Here, we introduce a game-theoretic framework in which both the tester and jammer control separate inputs. Combining three input structures, characterized by whether the tester and jammer use entangled inputs or IID inputs across channel uses, with four information patterns, determined by the visibility of the jammer's strategy and its knowledge of the true hypothesis, yields twelve game models. We provide exact finite blocklength hypothesis testing characterizations of all twelve models in terms of nine minimax hypothesis testing divergences and derive their asymptotic Stein exponents. Notably, for entangled jammers, neither the visibility of the jammer's strategy nor its knowledge of the true hypothesis affects the asymptotic Stein exponent, whereas the information pattern remains consequential for IID jammers. As an example, we study the discrimination of a general channel from a replacer channel and show that all asymptotic Stein exponents coincide with the same additive, single letter quantity. We further develop a general argument that upgrades achievability results to strong converse results, thereby establishing strong converse properties for several game models, resolving an open problem in composite hypothesis testing posed by Berta et al. [Commun. Math. Phys. 385, 55 (2021)], and strengthening several recent results of Lami [arXiv:2510.06340]. The framework and techniques developed here may support future studies of quantum information tasks involving competing roles.

Related papers

• Before the Action: Benchmarking LLMs on Prospective Hypothesis Discovery [95.44432473367836]
  Large language models (LLMs) excel at answering pre-specified questions, yet their ability to navigate the open-ended, pre-conclusion stage of discovery remains largely unmeasured.<n>We introduce Prospective Hypothesis Discovery (PHD), which asks models to autonomously construct grounded, discnative, and testable hypothesis spaces from inconclusive evidence.<n>We introduce HypoArena, comprising HypoData, a benchmark of 988 cases across six scientific and analytical domains, and HypoEval, an evaluation framework for open-ended hypothesis sets.
  arXiv  Detail & Related papers  (2026-07-17T08:56:43Z)
• Adversarial Hypothesis Testing for Quantum Channels [57.214837874007856]
  We study adversarial hypothesis testing for quantum-quantum (QQ) and classical-quantum (CQ) channels.<n>For QQ channels with i.i.d. inputs, Bob's knowledge of the input significantly enhances distinguishability.<n>For CQ channels, Bob being informed provides a consistent advantage over the corresponding entanglement-breaking channels for both i.i.d. and general inputs.
  arXiv  Detail & Related papers  (2026-01-15T10:04:10Z)
• The Polynomial Stein Discrepancy for Assessing Moment Convergence [1.0835264351334324]
  We propose a novel method for measuring the discrepancy between a set of samples and a desired posterior distribution for Bayesian inference.<n>We show that the test has higher power than its competitors in several examples, and at a lower computational cost.
  arXiv  Detail & Related papers  (2024-12-06T15:51:04Z)
• Performance advantage of discriminating one-versus-two incoherent sources based on quantum hypothesis testing [5.626518050662406]
  Discrimination of one-versus-two point-like incoherent sources in symmetric and asymmetric scenarios is studied. We calculate the quantum lower bounds on error probabilities of making a decision after one-shot and multi-shot tests. Our results may contribute to real-world quantum imaging such as microscopy and astronomy.
  arXiv  Detail & Related papers  (2024-10-25T02:26:50Z)
• Distributed Quantum Hypothesis Testing under Zero-rate Communication Constraints [14.29947046463964]
  We study a distributed binary hypothesis testing problem to infer a bipartite quantum state shared between two remote parties.<n>We show that the Stein's exponent when one of the parties communicates classically at zero-rate is given by a multi-letter expression.<n>As a key tool for proving the converse direction of our results, we develop a quantum version of the blowing-up lemma.
  arXiv  Detail & Related papers  (2024-10-11T16:03:10Z)
• Prototype-based Aleatoric Uncertainty Quantification for Cross-modal Retrieval [139.21955930418815]
  Cross-modal Retrieval methods build similarity relations between vision and language modalities by jointly learning a common representation space. However, the predictions are often unreliable due to the Aleatoric uncertainty, which is induced by low-quality data, e.g., corrupt images, fast-paced videos, and non-detailed texts. We propose a novel Prototype-based Aleatoric Uncertainty Quantification (PAU) framework to provide trustworthy predictions by quantifying the uncertainty arisen from the inherent data ambiguity.
  arXiv  Detail & Related papers  (2023-09-29T09:41:19Z)
• Towards Optimal Quantum Ranging -- Hypothesis Testing for an Unknown Return Signal [6.345523830122166]
  In rangefinding and LIDAR, the presence or absence of a target can be tested by detecting different states at the receiver. We use quantum hypothesis testing for an unknown coherent-state return signal in order to derive the limits of symmetric and asymmetric error probabilities.
  arXiv  Detail & Related papers  (2021-09-03T16:20:54Z)
• Search Methods for Sufficient, Socially-Aligned Feature Importance Explanations with In-Distribution Counterfactuals [72.00815192668193]
  Feature importance (FI) estimates are a popular form of explanation, and they are commonly created and evaluated by computing the change in model confidence caused by removing certain input features at test time. We study several under-explored dimensions of FI-based explanations, providing conceptual and empirical improvements for this form of explanation.
  arXiv  Detail & Related papers  (2021-06-01T20:36:48Z)
• Causal Inference Under Unmeasured Confounding With Negative Controls: A Minimax Learning Approach [84.29777236590674]
  We study the estimation of causal parameters when not all confounders are observed and instead negative controls are available. Recent work has shown how these can enable identification and efficient estimation via two so-called bridge functions.
  arXiv  Detail & Related papers  (2021-03-25T17:59:19Z)
• Significance tests of feature relevance for a blackbox learner [6.72450543613463]
  We derive two consistent tests for the feature relevance of a blackbox learner. The first evaluates a loss difference with perturbation on an inference sample. The second splits the inference sample into two but does not require data perturbation.
  arXiv  Detail & Related papers  (2021-03-02T00:59:19Z)

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.