Usefulness of adaptive strategies in asymptotic quantum channel discrimination

Abstract

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 asymptotically many independent instances of a quantum channel, and the tests are based on using the unknown channel and observing outputs. Unlike the familiar setting of quantum states as hypotheses, there is a fundamental distinction between adaptive and non-adaptive strategies with respect to the channel uses, and we introduce a number of further variants of the discrimination tasks by imposing different restrictions on the test strategies. The following results are obtained: (1) We prove that for classical-quantum channels, adaptive and non-adaptive strategies lead to the same error exponents both in the symmetric (Chernoff) and asymmetric (Hoeffding, Stein) settings. (2) The first separation between adaptive and non-adaptive symmetric hypothesis testing exponents for quantum channels, which we derive from a general lower bound on the error probability for non-adaptive strategies; the concrete example we analyze is a pair of entanglement-breaking channels. (3)We prove, in some sense generalizing the previous statement, that for general channels adaptive strategies restricted to classical feed-forward and product state channel inputs are not superior in the asymptotic limit to non-adaptive product state strategies. (4) As an application of our findings, we address the discrimination power of an arbitrary quantum channel and show that adaptive strategies with classical feedback and no quantum memory at the input do not increase the discrimination power of the channel beyond non-adaptive tensor product input strategies.

v3 is the accepted version

References in corpus (9)

• The Quantum Chernoff Bound
• Transforming quantum operations: quantum supermaps
• Information-theoretic bounds on quantum advantage in machine learning
• The Chernoff lower bound for symmetric quantum hypothesis testing
• Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
• The Converse Part of The Theorem for Quantum Hoeffding Bound
• Semidefinite programs for completely bounded norms
• Unambiguous discrimination among oracle operators
• On the optimal certification of von Neumann measurements

Cited by in corpus (11)

• Using adaptiveness and causal superpositions against noise in quantum metrology
• Quantum metrology in the finite-sample regime
• Exact quantum sensing limits for bosonic dephasing channels
• Postselected quantum hypothesis testing
• Parallelization of Adaptive Quantum Channel Discrimination in the Non-Asymptotic Regime
• Gaussian Rényi-2 correlations in a nondegenerate three-level laser
• Quantum Network Discrimination
• Indefinite causal order strategy does not improve the estimation of group action
• Discrimination and certification of unknown quantum measurements
• Optimal Hamiltonian recognition of unknown quantum dynamics
• Bayesian and Markovian classical feedforward for discriminating qubit channels