Composite Classical and Quantum Channel Discrimination
- URL: http://arxiv.org/abs/2303.02016v1
- Date: Fri, 3 Mar 2023 15:31:38 GMT
- Title: Composite Classical and Quantum Channel Discrimination
- Authors: Bjarne Bergh, Nilanjana Datta, Robert Salzmann
- Abstract summary: 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.
- Score: 6.553031877558699
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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 channels we prove: (i) a characterization of the Stein exponent for
parallel channel discrimination strategies and (ii) an upper bound on the Stein
exponent for adaptive channel discrimination strategies. We further show that
already for classical channels this upper bound can sometimes be achieved and
be strictly larger than what is possible with parallel strategies. Hence, there
can be an advantage of adaptive channel discrimination strategies with
composite hypotheses for classical channels, unlike in the case of simple
hypotheses. Moreover, we show that classically this advantage can only exist if
the sets of channels corresponding to the hypotheses are non-convex. As a
consequence of our more general treatment, which is not limited to the
composite i.i.d. setting, we also obtain a generalization of previous composite
state discrimination results.
Related papers
- 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) - The Implicit Bias of Gradient Descent on Separable Multiclass Data [38.05903703331163]
We employ the framework of Permutation Equivariant and Relative Margin-based (PERM) losses to introduce a multiclass extension of the exponential tail property.
Our proof techniques closely mirror those of the binary case, thus illustrating the power of the PERM framework for bridging the binary-multiclass gap.
arXiv Detail & Related papers (2024-11-02T19:39:21Z) - 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) - (Quantum) Indifferentiability and Pre-Computation [50.06591179629447]
Indifferentiability is a cryptographic paradigm for analyzing the security of ideal objects.
Despite its strength, indifferentiability is not known to offer security against pre-processing attacks.
We propose a strengthening of indifferentiability which is not only composable but also takes arbitrary pre-computation into account.
arXiv Detail & Related papers (2024-10-22T00:41:47Z) - 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 [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) - Unitary channel discrimination beyond group structures: Advantages of
sequential and indefinite-causal-order strategies [3.222802562733787]
For minimum-error channel discrimination tasks, we show that sequential strategies may outperform the parallel ones.
For the task of discriminating a uniformly distributed set of unitary channels that forms a group, we show that parallel strategies are, indeed, optimal.
We also show that strategies based on the quantum switch cannot outperform sequential strategies in the discrimination of unitary channels.
arXiv Detail & Related papers (2021-05-27T18:00:06Z) - 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) - Unambiguous discrimination of Fermionic states through local operations
and classical communication [68.8204255655161]
The paper studies unambiguous discrimination of Fermionic states through local operations and classical communication (LOCC)
We show that it is not always possible to distinguish two Fermionic states through LOCC unambiguously with the same success probability as if global measurements were allowed.
arXiv Detail & Related papers (2020-09-11T21:08:52Z) - Classical capacities of memoryless but not identical quantum channels [0.0]
We study quantum channels that vary on time in a deterministic way, that is, they change in an independent but not identical way from one to another use.
arXiv Detail & Related papers (2020-05-25T10:00:28Z)
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.