Quantum channel discrimination against jammers

• URL: http://arxiv.org/abs/2510.07977v1
• Date: Thu, 09 Oct 2025 09:10:09 GMT
• Title: Quantum channel discrimination against jammers
• Authors: Kun Fang, Michael X. Cao,
• Abstract summary: We study the problem of quantum channel discrimination between two channels with an adversary input party (a.k.a. a jammer)<n>We introduce the notion of minimax channel divergence and establish several of its key properties.<n>We prove that the optimal type-II exponent error in the regime under parallel strategies is characterized by the regularized minimax channel divergence.
• Score: 5.232225863167099
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the problem of quantum channel discrimination between two channels with an adversary input party (a.k.a. a jammer). This setup interpolates between the best-case channel discrimination as studied by (Wang & Wilde, 2019) and the worst-case channel discrimination as studied by (Fang, Fawzi, & Fawzi, 2025), thereby generalizing both frameworks. To address this problem, we introduce the notion of minimax channel divergence and establish several of its key mathematical properties. We prove the Stein's lemma in this new setting, showing that the optimal type-II error exponent in the asymptotic regime under parallel strategies is characterized by the regularized minimax channel divergence.

Related papers

• CP Loss: Channel-wise Perceptual Loss for Time Series Forecasting [67.3477355449697]
  We propose a Channel-wise Perceptual Loss (CP Loss) for time-series data.<n>We learn a unique perceptual space for each channel that is adapted to its characteristics.<n>Loss is calculated within these perception spaces to optimize the model.
  arXiv  Detail & Related papers  (2026-01-25T15:31:37Z)
• 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)
• Query complexities of quantum channel discrimination and estimation: A unified approach [16.916040234975796]
  We establish lower bounds on the query complexities of channel discrimination and estimation.<n>We give conceptually simple proofs for both novel and known bounds.<n>We present a consistent and unified framework for quantum channel discrimination and estimation.
  arXiv  Detail & Related papers  (2025-11-13T22:25:41Z)
• Adversarial quantum channel discrimination [11.59751616011475]
  We show that in asymmetric hypothesis testing, the optimal type-II error exponent is precisely characterized by the minimum output channel divergence.<n>This serves as a direct analog of the quantum Stein's lemma in the adversarial channel discrimination.
  arXiv  Detail & Related papers  (2025-06-03T16:39:01Z)
• Query Complexity of Classical and Quantum Channel Discrimination [5.211732144306638]
  We study the query complexity of quantum channel discrimination.<n>The goal is to determine the minimum number of channel uses needed to reach a desired error probability.
  arXiv  Detail & Related papers  (2025-04-17T14:54:00Z)
• Resolvability of classical-quantum channels [54.825573549226924]
  We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
  arXiv  Detail & Related papers  (2024-10-22T05:18:43Z)
• Composite Classical and Quantum Channel Discrimination [9.877005520976846]
  We study the problem of binary composite channel discrimination in the asymmetric setting, where the hypotheses are given by fairly arbitrary sets of channels.<n>We show that there can be an advantage to channel discrimination strategies with composite hypotheses for classical channels, unlike in general general simple hypotheses.
  arXiv  Detail & Related papers  (2023-03-03T15:31:38Z)
• Revisiting Random Channel Pruning for Neural Network Compression [159.99002793644163]
  Channel (or 3D filter) pruning serves as an effective way to accelerate the inference of neural networks. In this paper, we try to determine the channel configuration of the pruned models by random search. We show that this simple strategy works quite well compared with other channel pruning methods.
  arXiv  Detail & Related papers  (2022-05-11T17:59:04Z)
• Towards the ultimate limits of quantum channel discrimination and quantum communication [9.513467246615642]
  This work advances the understanding of quantum channel discrimination and its fundamental limits.<n>We develop new tools for quantum divergences, including sharper bounds on the quantum hypothesis testing relative entropy.<n>We recast quantum communication tasks as discrimination problems, uncovering deep connections between channel capacities, channel discrimination, and the mathematical structure of channel divergences.
  arXiv  Detail & Related papers  (2021-10-28T01:48:13Z)
• Learning to Perform Downlink Channel Estimation in Massive MIMO Systems [72.76968022465469]
  We study downlink (DL) channel estimation in a Massive multiple-input multiple-output (MIMO) system. A common approach is to use the mean value as the estimate, motivated by channel hardening. We propose two novel estimation methods.
  arXiv  Detail & Related papers  (2021-09-06T13:42:32Z)
• Channel-wise Knowledge Distillation for Dense Prediction [73.99057249472735]
  We propose to align features channel-wise between the student and teacher networks. We consistently achieve superior performance on three benchmarks with various network structures.
  arXiv  Detail & Related papers  (2020-11-26T12:00:38Z)
• Usefulness of adaptive strategies in asymptotic quantum channel discrimination [43.7637825272776]
  We investigate the usefulness of adaptive methods in the framework of binary hypothesis testing. There is a fundamental distinction between adaptive and non-adaptive strategies with respect to the channel uses. We show that adaptive strategies with classical feedback do not increase the discrimination power of the channel beyond non-adaptive product input strategies.
  arXiv  Detail & Related papers  (2020-11-12T18:40:47Z)
• The Devil is in the Channels: Mutual-Channel Loss for Fine-Grained Image Classification [67.79883226015824]
  Key for solving fine-grained image categorization is finding discriminate and local regions that correspond to subtle visual traits. In this paper, we show it is possible to cultivate subtle details without the need for overly complicated network designs or training mechanisms. The proposed loss function, termed as mutual-channel loss (MC-Loss), consists of two channel-specific components.
  arXiv  Detail & Related papers  (2020-02-11T09:12: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.