Related papers: Infinite Dimensional Asymmetric Quantum Channel Di…
We investigate the performance of parallel and adaptive quantum channel discrimination strategies for a finite number of channel uses. It has recently been shown that, in the asymmetric setting with asymptotically vanishing type I error…
We study the problem of binary composite channel discrimination in the asymmetric setting, where the hypotheses are given by fairly arbitrary sets of channels, and samples do not have to be identically distributed. In the case of quantum…
It is well known that for the discrimination of classical and quantum channels in the finite, non-asymptotic regime, adaptive strategies can give an advantage over non-adaptive strategies. However, Hayashi [IEEE Trans. Inf. Theory 55(8),…
We introduce a new framework for quantum channel discrimination in an adversarial setting, where the tester plays against an adversary. We show that in asymmetric hypothesis testing, the optimal type-II error exponent is precisely…
This paper studies the difficulty of discriminating between an arbitrary quantum channel and a "replacer" channel that discards its input and replaces it with a fixed state. We show that, in this particular setting, the most general…
We consider the sequential quantum channel discrimination problem using adaptive and non-adaptive strategies. In this setting the number of uses of the underlying quantum channel is not fixed but a random variable that is either bounded in…
Distinguishability is fundamental to information theory and extends naturally to quantum systems. While quantum state discrimination is well understood, quantum channel discrimination remains challenging due to the dynamic nature of…
We present a systematic study of the geometric R\'enyi divergence (GRD), also known as the maximal R\'enyi divergence, from the point of view of quantum information theory. We show that this divergence, together with its extension to…
We study binary discrimination of idempotent quantum channels. When the two channels share a common full-rank invariant state, we show that a simple image inclusion condition completely determines the asymptotic behavior: when it holds, a…
We provide a simple example that illustrates the advantage of adaptive over non-adaptive strategies for quantum channel discrimination. In particular, we give a pair of entanglement-breaking channels that can be perfectly discriminated by…
Divergence chain rules for channels relate the divergence of a pair of channel inputs to the divergence of the corresponding channel outputs. An important special case of such a rule is the data-processing inequality, which tells us that if…
Adaptiveness is a key principle in information processing including statistics and machine learning. We investigate the usefulness of adaptive methods in the framework of asymptotic binary hypothesis testing, when each hypothesis represents…
Recently, the resource theory of asymmetric distinguishability for quantum strategies was introduced by [Wang et al., Phys. Rev. Research 1, 033169 (2019)]. The fundamental objects in the resource theory are pairs of quantum strategies,…
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…
Quantum channel estimation and discrimination are fundamentally related information processing tasks of interest in quantum information science. In this paper, we analyze these tasks by employing the right logarithmic derivative Fisher…
In the problem of binary quantum channel discrimination with product inputs, the supremum of all type II error exponents for which the optimal type I errors go to zero is equal to the Umegaki channel relative entropy, while the infimum of…
We derive new bounds on achievable precision in the most general adaptive quantum metrological scenarios. The bounds are proven to be asymptotically saturable and equivalent to the known parallel scheme bounds in the limit of large number…
We present an instance of a task of minimum-error discrimination of two qubit-qubit quantum channels for which a sequential strategy outperforms any parallel strategy. We then establish two new classes of strategies for channel…
For minimum-error channel discrimination tasks that involve only unitary channels, we show that sequential strategies may outperform the parallel ones. Additionally, we show that general strategies that involve indefinite causal order are…
What is the ultimate performance for discriminating two arbitrary quantum channels acting on a finite-dimensional Hilbert space? Here we address this basic question by deriving a general and fundamental lower bound. More precisely, we…