Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0206151

On Error Exponents in Quantum Hypothesis Testing

Tomohiro Ogawa, Masahito Hayashi

Published Jun 21, 2002• 0 citations
arXivHTMLPDF

Abstract

In the simple quantum hypothesis testing problem, upper bounds on the error probabilities are shown based on a key operator inequality between a density operator and its pinching. Concerning the error exponents, the upper bounds lead to a noncommutative analogue of the Hoeffding bound, which is identical with the classical counter part if the hypotheses, composed of two density operators, are mutually commutative. The upper bounds also provide a simple proof of the direct part of the quantum Stein's lemma.

DOI
10.48550/arxiv.quant-ph/0206151

Related papers

On Error Exponents in Quantum Hypothesis Testing

T. Ogawa, Masahito Hayashi

In the simple quantum hypothesis testing problem for two density operators, upper bounds on the error probabilities are shown based on a key operator inequality between a density operator and a conditional expectation of it. Concerning the error exponents, the upper bounds lead to a noncommutative analog of the Hoeffding bound, which is identical with the classical counterpart if two density operators commute. The upper bounds also provide a simple proof of the direct part of the quantum Stein's lemma.

IEEE Transactions on Information Theory•Jun 1, 2004•92 citations

On error exponents in quantum hypothesis testing

T. Ogawa, Masahito Hayashi

On error exponents in the simple quantum hypothesis testing problem, a noncommutative analogue of the Hoeffding bound (W. Hoeffding, 1991) is presented. If the hypotheses, namely two density operators, are mutually commutative, the bound is identical with the classical counter part and thus is optimal. As a by-product, a simple proof of the direct part of the quantum Stein's lemma [F. Hiai (1991)] [T. Ogawa (2000)] is also given.

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2003•3 citations

Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding

Masahito Hayashi

An upper bound on simple quantum hypothesis testing in the asymmetric setting is shown using a useful inequality by Audenaert et al. [Phys. Rev. Lett. 98, 160501 (2007)] which was originally invented for symmetric setting. Using this upper bound, we obtain the Hoeffding bound, which is identical with the classical counterpart if the hypotheses, composed of two density operators, are mutually commutative. Its attainability has been a long-standing open problem. Further, using this bound, we obtain a better exponential upper bound of the average error probability of classical-quantum channel coding.

arXiv:quant-ph/0611013•Physical Review A•Dec 5, 2007•171 citations

A New Proof of the Direct Part of Stein's Lemma in Quantum Hypothesis Testing

Tomohiro Ogawa, Masahito Hayashi

The direct part of Stein's lemma in quantum hypothesis testing is revisited based on a key operator inequality between a density operator and its pinching. The operator inequality is used to show a simple proof of the direct part of Stein's lemma without using Hiai-Petz's theorem, along with an operator monotone function, and in addition it is also used to show a new proof of Hiai-Petz's theorem.

arXiv:quant-ph/0110125•IEEE International Symposium on Information Theory (ISIT)•Oct 21, 2001•5 citations

Error Exponents of Quantum State Discrimination With Composite Correlated Hypotheses

Kun Fang, Masahito Hayashi

We study the error exponents in quantum hypothesis testing between two sets of quantum states, extending the analysis beyond the independent and identically distributed case to encompass composite correlated hypotheses. In particular, we introduce and compare two natural extensions of the quantum Hoeffding divergence and anti-divergence to sets of quantum states, establishing their equivalence or quantitative relations. In the error exponent regime, we generalize the quantum Hoeffding bound to stable sequences of convex, compact sets of quantum states, demonstrating that the optimal Type-I error exponent, under an exponential constraint on the Type-II error, is precisely characterized by the regularized quantum Hoeffding divergence between the sets. In the strong converse exponent regime, we establish a general lower bound on the exponent in terms of the regularized quantum Hoeffding anti-divergence, and we prove a matching upper bound when the null hypothesis is a singleton, under additional assumptions. The generality of these results enables applications in various contexts, including (i) refining the generalized quantum Stein’s lemma by [Fang, Fawzi & Fawzi, 2024]; (ii) exhibiting counterexamples to the continuity of the regularized Petz R´enyi divergence and Hoeffding divergence; (iii) obtaining error exponents for adversarial channel discrimination and resource detection problems.

arXiv:2508.12901•IEEE International Symposium on Information Theory (ISIT)•Apr 16, 2026•1 citation

Strong converse and Stein's lemma in quantum hypothesis testing

Hiroshi Nagaoka, T. Ogawa

The hypothesis testing problem for two quantum states is treated. We show a new inequality between the errors of the first kind and the second kind, which complements the result of Hiai and Petz (1991) to establish the quantum version of Stein's lemma. The inequality is also used to show a bound on the probability of errors of the first kind when the power exponent for the probability of errors of the second kind exceeds the quantum relative entropy, which yields the strong converse in quantum hypothesis testing. Finally, we discuss the relation between the bound and the power exponent derived by Han and Kobayashi (1989) in classical hypothesis testing.

IEEE Transactions on Information Theory•Jan 1, 2000•321 citations
In the simple quantum hypothesis testing problem, upper bounds on the error probabilities are shown based on a key operator inequality between a density operator and its pinching. Concerning the error exponents, the upper bounds lead to a noncommutative analogue of the Hoeffding bound, which is identical with the classical counter part if the hypotheses, composed of two density operators, are mutually commutative. The upper bounds also provide a simple proof of the direct part of the quantum Stein's lemma.
In the simple quantum hypothesis testing problem for two density operators, upper bounds on the error probabilities are shown based on a key operator inequality between a density operator and a conditional expectation of it. Concerning the error exponents, the upper bounds lead to a noncommutative analog of the Hoeffding bound, which is identical with the classical counterpart if two density operators commute. The upper bounds also provide a simple proof of the direct part of the quantum Stein's lemma.
An upper bound on simple quantum hypothesis testing in the asymmetric setting is shown using a useful inequality by Audenaert et al. [Phys. Rev. Lett. 98, 160501 (2007)] which was originally invented for symmetric setting. Using this upper bound, we obtain the Hoeffding bound, which is identical with the classical counterpart if the hypotheses, composed of two density operators, are mutually commutative. Its attainability has been a long-standing open problem. Further, using this bound, we obtain a better exponential upper bound of the average error probability of classical-quantum channel coding.
We study the error exponents in quantum hypothesis testing between two sets of quantum states, extending the analysis beyond the independent and identically distributed case to encompass composite correlated hypotheses. In particular, we introduce and compare two natural extensions of the quantum Hoeffding divergence and anti-divergence to sets of quantum states, establishing their equivalence or quantitative relations. In the error exponent regime, we generalize the quantum Hoeffding bound to stable sequences of convex, compact sets of quantum states, demonstrating that the optimal Type-I error exponent, under an exponential constraint on the Type-II error, is precisely characterized by the regularized quantum Hoeffding divergence between the sets. In the strong converse exponent regime, we establish a general lower bound on the exponent in terms of the regularized quantum Hoeffding anti-divergence, and we prove a matching upper bound when the null hypothesis is a singleton, under additional assumptions. The generality of these results enables applications in various contexts, including (i) refining the generalized quantum Stein’s lemma by [Fang, Fawzi & Fawzi, 2024]; (ii) exhibiting counterexamples to the continuity of the regularized Petz R´enyi divergence and Hoeffding divergence; (iii) obtaining error exponents for adversarial channel discrimination and resource detection problems.
The hypothesis testing problem for two quantum states is treated. We show a new inequality between the errors of the first kind and the second kind, which complements the result of Hiai and Petz (1991) to establish the quantum version of Stein's lemma. The inequality is also used to show a bound on the probability of errors of the first kind when the power exponent for the probability of errors of the second kind exceeds the quantum relative entropy, which yields the strong converse in quantum hypothesis testing. Finally, we discuss the relation between the bound and the power exponent derived by Han and Kobayashi (1989) in classical hypothesis testing.