Query complexities of quantum channel discrimination and estimation: A unified approach

• URL: http://arxiv.org/abs/2511.10832v1
• Date: Thu, 13 Nov 2025 22:25:41 GMT
• Title: Query complexities of quantum channel discrimination and estimation: A unified approach
• Authors: Zixin Huang, Johannes Jakob Meyer, Theshani Nuradha, Mark M. Wilde,
• Abstract summary: 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.
• Score: 16.916040234975796
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The goal of quantum channel discrimination and estimation is to determine the identity of an unknown channel from a discrete or continuous set, respectively. The query complexity of these tasks is equal to the minimum number of times one must call an unknown channel to identify it within a desired threshold on the error probability. In this paper, we establish lower bounds on the query complexities of channel discrimination and estimation, in both the parallel and adaptive access models. We do so by establishing new or applying known upper bounds on the squared Bures distance and symmetric logarithmic derivative Fisher information of channels. Phrasing our statements and proofs in terms of isometric extensions of quantum channels allows us to give conceptually simple proofs for both novel and known bounds. We also provide alternative proofs for several established results in an effort to present a consistent and unified framework for quantum channel discrimination and estimation, which we believe will be helpful in addressing future questions in the field.

Related papers

• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
  Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
  arXiv  Detail & Related papers  (2025-06-06T13:48:20Z)
• Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels [49.126395046088014]
  This work shows that the existence of a DI code in the quantum setting follows from a suitable packing in a modified space of output quantum states.<n>This result enables us to tighten the capacity lower bound for DI over quantum channels beyond the simultaneous decoding approach.
  arXiv  Detail & Related papers  (2025-04-29T17:57:36Z)
• Query Complexity of Classical and Quantum Channel Discrimination [19.69490455003981]
  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)
• 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)
• 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)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• 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)
• 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)
• Ultimate limits for multiple quantum channel discrimination [0.966840768820136]
  This paper studies the problem of hypothesis testing with quantum channels. We establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels. We also show that this lower bound is achievable when the channels have certain symmetries.
  arXiv  Detail & Related papers  (2020-07-29T03:08:48Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)
• 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.