Barycentric bounds on the error exponents of quantum hypothesis exclusion

• URL: http://arxiv.org/abs/2407.13728v1
• Date: Thu, 18 Jul 2024 17:27:36 GMT
• Title: Barycentric bounds on the error exponents of quantum hypothesis exclusion
• Authors: Kaiyuan Ji, Hemant K. Mishra, Milán Mosonyi, Mark M. Wilde,
• Abstract summary: We study the optimal error probability of quantum state exclusion from an information-theoretic perspective. We extend our analysis to the more complicated task of quantum channel exclusion.
• Score: 7.812210699650153
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum state exclusion is an operational task that has significance in studying foundational questions related to interpreting quantum theory. In such a task, one is given a system whose state is randomly selected from a finite set, and the goal is to identify a state from the set that is not the true state of the system. An error, i.e., an unsuccessful exclusion, occurs if and only if the state identified is the true state. In this paper, we study the optimal error probability of quantum state exclusion and its error exponent -- the rate at which the error probability decays asymptotically -- from an information-theoretic perspective. Our main finding is a single-letter upper bound on the error exponent of state exclusion given by the multivariate log-Euclidean Chernoff divergence, and we prove that this improves upon the best previously known upper bound. We also extend our analysis to the more complicated task of quantum channel exclusion, and we establish a single-letter and efficiently computable upper bound on its error exponent, even assuming the use of adaptive strategies. We derive both upper bounds, for state and channel exclusion, based on one-shot analysis and formulate them as a type of multivariate divergence measure called a barycentric Chernoff divergence. Moreover, our result on channel exclusion has implications in two important special cases. First, for the special case of two hypotheses, our upper bound provides the first known efficiently computable upper bound on the error exponent of symmetric binary channel discrimination. Second, for the special case of classical channels, we show that our upper bound is achievable by a nonadaptive strategy, thus solving the exact error exponent of classical channel exclusion and generalising a similar result on symmetric binary classical channel discrimination.

Related papers

• Storage and retrieval of two unknown unitary channels [37.928612512813494]
  We consider the case where the unknown unitary is selected with equal prior probability from two options. First, we prove that the optimal storage strategy involves the sequential application of the $n$ uses of the unknown unitary. Next, we show that incoherent "measure-and-prepare" retrieval achieves the maximum fidelity between the retrieved operation and the original (qubit) unitary.
  arXiv  Detail & Related papers  (2024-10-30T18:27:46Z)
• Bounds for Revised Unambiguous Discrimination Tasks of Quantum Resources [0.9790236766474201]
  Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. We show an upper bound of the success probability for a revised discrimination task in the unasymptotic and unambiguous scenarios. We also show the advantage of the quantum by considering a quantifier on a set of semidefinite positive operators.
  arXiv  Detail & Related papers  (2024-10-06T14:52:17Z)
• 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)
• Rate-Limited Quantum-to-Classical Optimal Transport in Finite and Continuous-Variable Quantum Systems [11.152271223282463]
  We consider the rate-limited quantum-to-classical optimal transport in terms of output-constrained rate-distortion coding. We develop a coding framework for continuous-variable quantum systems by employing a clipping projection and a dequantization block. For the Gaussian quantum systems, we derive an analytical solution for rate-limited Wasserstein distance of order 2.
  arXiv  Detail & Related papers  (2023-05-17T07:16:20Z)
• Analytical bounds for non-asymptotic asymmetric state discrimination [0.0]
  Asymmetric state discrimination involves minimizing the probability of one type of error, subject to a constraint on the other. We give explicit expressions bounding the set of achievable errors using the trace norm, the fidelity, and the quantum Chernoff bound. Unlike bounds, our bounds give error values instead of exponents, so can give more precise results when applied to finite-copy state discrimination problems.
  arXiv  Detail & Related papers  (2022-07-21T18:21:04Z)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• 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)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Quantum Causal Inference in the Presence of Hidden Common Causes: an Entropic Approach [34.77250498401055]
  We put forth a new theoretical framework for merging quantum information science and causal inference by exploiting entropic principles. We apply our proposed framework to an experimentally relevant scenario of identifying message senders on quantum noisy links. This approach can lay the foundations of identifying originators of malicious activity on future multi-node quantum networks.
  arXiv  Detail & Related papers  (2021-04-24T22:45:50Z)
• 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)

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.