Query Complexity of Classical and Quantum Channel Discrimination

• URL: http://arxiv.org/abs/2504.12989v1
• Date: Thu, 17 Apr 2025 14:54:00 GMT
• Title: Query Complexity of Classical and Quantum Channel Discrimination
• Authors: Theshani Nuradha, Mark M. Wilde,
• Abstract summary: 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.
• Score: 5.211732144306638
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum channel discrimination has been studied from an information-theoretic perspective, wherein one is interested in the optimal decay rate of error probabilities as a function of the number of unknown channel accesses. In this paper, we study the query complexity of quantum channel discrimination, wherein the goal is to determine the minimum number of channel uses needed to reach a desired error probability. To this end, we show that the query complexity of binary channel discrimination depends logarithmically on the inverse error probability and inversely on the negative logarithm of the (geometric and Holevo) channel fidelity. As a special case of these findings, we precisely characterize the query complexity of discriminating between two classical channels. We also provide lower and upper bounds on the query complexity of binary asymmetric channel discrimination and multiple quantum channel discrimination. For the former, the query complexity depends on the geometric R\'enyi and Petz R\'enyi channel divergences, while for the latter, it depends on the negative logarithm of (geometric and Uhlmann) channel fidelity. For multiple channel discrimination, the upper bound scales as the logarithm of the number of channels.

Related papers

• Rate-reliability functions for deterministic identification [49.126395046088014]
  We find that for positive exponents linear scaling is restored, now with a rate that is a function of the reliability exponents.<n>We extend our results to classical-quantum channels and quantum channels with product input restriction.
  arXiv  Detail & Related papers  (2025-02-04T15:09:14Z)
• Learning Orthogonal Random Unitary Channels with Contracted Quantum Approaches and Simplex Optimization [41.94295877935867]
  We present a procedure for learning a class of random unitary channels on a quantum computer.<n>Our approach involves a multi-objective, Pauli- and unitary-based minimization, and allows for learning locally equivalent channels.
  arXiv  Detail & Related papers  (2025-01-28T19:02:52Z)
• Reverse-type Data Processing Inequality [11.013342155938801]
  A quantum data processing inequality asserts that two quantum states become harder to distinguish when a noisy channel is applied.<n>A reverse quantum data processing inequality characterizes whether distinguishability is preserved after the application of a noisy channel.<n>In this work, we explore these concepts through contraction and expansion coefficients of the relative entropy of quantum channels.
  arXiv  Detail & Related papers  (2024-11-29T17:56:36Z)
• Characterising memory in quantum channel discrimination via constrained separability problems [4.007882727805384]
  Quantum memories are a crucial precondition in many protocols for processing quantum information. We characterise the quality of channel discrimination protocols when the quantum memory is limited. This insight allows to systematically characterise quantum and classical memories in adaptive channel discrimination protocols.
  arXiv  Detail & Related papers  (2024-11-12T19:00:02Z)
• 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)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Composite Classical and Quantum Channel Discrimination [6.553031877558699]
  We study the problem of binary composite channel discrimination in the asymmetric setting, where the hypotheses are given by fairly arbitrary sets of channels. 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)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Quantum machine learning channel discrimination [0.0]
  In the problem of quantum channel discrimination, one distinguishes between a given number of quantum channels. This work studies applications of variational quantum circuits and machine learning techniques for discriminating such channels.
  arXiv  Detail & Related papers  (2022-06-20T18:00:05Z)
• Towards the ultimate limits of quantum channel discrimination [18.836836815159764]
  We make a conjecture on the exponentially strong converse of quantum channel hypothesis testing under coherent strategies. We develop a framework to show the interplay between the strategies of channel discrimination, the operational regimes, and variants of channel divergences.
  arXiv  Detail & Related papers  (2021-10-28T01:48:13Z)
• Group Fisher Pruning for Practical Network Compression [58.25776612812883]
  We present a general channel pruning approach that can be applied to various complicated structures. We derive a unified metric based on Fisher information to evaluate the importance of a single channel and coupled channels. Our method can be used to prune any structures including those with coupled channels.
  arXiv  Detail & Related papers  (2021-08-02T08:21:44Z)
• Geometric distinguishability measures limit quantum channel estimation and discrimination [6.345523830122166]
  We show that a chain-rule property holds for the right logarithmic derivative Fisher information and the geometric R'enyi relative entropy. In channel estimation, these results imply a condition for the unattainability of Heisenberg scaling. More generally, we introduce the amortized quantum Fisher information as a conceptual framework for analyzing general sequential protocols.
  arXiv  Detail & Related papers  (2020-04-22T17:11:34Z)

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.