Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding

Abstract

In the simple quantum hypothesis testing problem, upper bound with asymmetric setting is shown by using a quite useful inequality by Audenaert et al, quant-ph/0610027, which was originally invented for symmetric setting. Using this upper bound, we obtain the Hoeffding bound, which are identical with the classical counter part if the hypotheses, composed of two density operators, are mutually commutative. Our upper bound improves the bound by Ogawa-Hayashi, and also provides a simpler proof of the direct part of the quantum Stein's lemma. Further, using this bound, we obtain a better exponential upper bound of the average error probability of classical-quantum channel coding.

References in corpus (1)

• The Quantum Chernoff Bound

Cited by in corpus (8)

• The Converse Part of The Theorem for Quantum Hoeffding Bound
• Generalized relative entropies and the capacity of classical-quantum channels
• Error exponents in hypothesis testing for correlated states on a spin chain
• Group theoretical study of LOCC-detection of maximally entangled state using hypothesis testing
• Hypothesis testing for Gaussian states on bosonic lattices
• Entanglement Theory and the Quantum Simulation of Many-Body Physics
• Asymptotic distinguishability measures for shift-invariant quasi-free states of fermionic lattice systems
• Two-way classical communication remarkably improves local distinguishability