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:1106.3089 · IEEE Transactions on Information Theory

A Smooth Entropy Approach to Quantum Hypothesis Testing and the Classical Capacity of Quantum Channels

Nilanjana Datta, Milán Mosonyi, Min-Hsiu Hsieh, Fernando G. S. L. Brandão

Published Nov 19, 2013• 63 citations
arXivHTMLPDF

Abstract

We use the smooth entropy approach to treat the problems of binary quantum hypothesis testing and the transmission of classical information through a quantum channel. We provide lower and upper bounds on the optimal type II error of quantum hypothesis testing in terms of the smooth max-relative entropy of the two states representing the two hypotheses. Then using a relative entropy version of the quantum asymptotic equipartition property (QAEP), we can recover the strong converse rate of the i.i.d. hypothesis testing problem in the asymptotics. On the other hand, combining Stein's lemma with our bounds, we obtain a stronger ( ε-independent) version of the relative entropy-QAEP. Similarly, we provide bounds on the one-shot ε-error classical capacity of a quantum channel in terms of a smooth max-relative entropy variant of its Holevo capacity. Using these bounds and the ε-independent version of the relative entropy-QAEP, we can recover both the Holevo- Schumacher- Westmoreland theorem about the optimal direct rate of a memoryless quantum channel with product state encoding, as well as its strong converse counterpart.

DOI
10.1109/tit.2013.2282160

Related papers

Strong converses for classical information transmission and hypothesis testing

Nilanjana Datta, Milán Mosonyi, Min-Hsiu Hsieh +1 more

We obtain lower and upper bounds on the one-shot strong converse capacity for the transmission of classical information through quantum channels, in terms of a generalized relative entropy quantity, namely, the smoothed max-relative entropy. For the case of a memoryless channel, these bounds converge independently to the Holevo capacity, in the limit of asymptotically many uses. We also employ our one-shot result to obtain an upper bound to the strong converse capacity of a channel with long-term memory which can be shown to violate the strong converse property. Finally, we show bounds on the strong converse rate of hypothesis testing in the one-shot scenario, again in terms of the smoothed max-relative entropies.

•Jun 15, 2011•4 citations

One-Shot Classical-Quantum Capacity and Hypothesis Testing

Ligong Wang, Renato Renner

The one-shot classical capacity of a quantum channel quantifies the amount of classical information that can be transmitted through a single use of the channel such that the error probability is below a certain threshold. In this work, we show that this capacity is well approximated by a relative-entropy-type measure defined via hypothesis testing. Combined with a quantum version of Stein's lemma, our results give a conceptually simple proof of the well-known Holevo-Schumacher-Westmoreland theorem for the capacity of memoryless channels. More generally, we obtain tight capacity formulas for arbitrary (not necessarily memoryless) channels.

arXiv:1007.5456•Physical Review Letters•May 15, 2012•317 citations

Strong Converse and Stein's Lemma in the Quantum Hypothesis Testing

Tomohiro Ogawa, Hiroshi Nagaoka

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

•Jun 25, 1999•42 citations

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•340 citations

Strong Converse and Stein's Lemma in Quantum Hypothesis Testing

Tomohiro Ogawa, Hiroshi Nagaoka

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

arXiv:quant-ph/9906090•WORLD SCIENTIFIC eBooks•Feb 1, 2005•74 citations

One-shot and asymptotic classical capacity in general physical theories

Shintaro Minagawa, Hayato Arai

With the recent development of quantum information theory, some attempts have been made to construct information theory beyond quantum theory. Here, we consider hypothesis-testing relative entropy and one-shot classical capacity, that is, the optimal rate of classical information transmitted by using a single channel under the constraint of a certain error probability, in general physical theories where states and measurements are operationally defined. Then we obtain the upper bound of the one-shot classical capacity by generalizing the method given by Wang and Renner [Phys. Rev. Lett. 108, 200501 (2012)]. Also, we derive the lower bound of the capacity by showing the existence of a good code that can transmit classical information with a certain error probability. Applying the above two bounds, we prove the asymptotic equivalence between classical capacity and hypothesis-testing relative entropy in any general physical theory.

arXiv:2303.04138•Physical Review A•Jun 11, 2024•0 citations
We use the smooth entropy approach to treat the problems of binary quantum hypothesis testing and the transmission of classical information through a quantum channel. We provide lower and upper bounds on the optimal type II error of quantum hypothesis testing in terms of the smooth max-relative entropy of the two states representing the two hypotheses. Then using a relative entropy version of the quantum asymptotic equipartition property (QAEP), we can recover the strong converse rate of the i.i.d. hypothesis testing problem in the asymptotics. On the other hand, combining Stein's lemma with our bounds, we obtain a stronger ( ε-independent) version of the relative entropy-QAEP. Similarly, we provide bounds on the one-shot ε-error classical capacity of a quantum channel in terms of a smooth max-relative entropy variant of its Holevo capacity. Using these bounds and the ε-independent version of the relative entropy-QAEP, we can recover both the Holevo- Schumacher- Westmoreland theorem about the optimal direct rate of a memoryless quantum channel with product state encoding, as well as its strong converse counterpart.
We obtain lower and upper bounds on the one-shot strong converse capacity for the transmission of classical information through quantum channels, in terms of a generalized relative entropy quantity, namely, the smoothed max-relative entropy. For the case of a memoryless channel, these bounds converge independently to the Holevo capacity, in the limit of asymptotically many uses. We also employ our one-shot result to obtain an upper bound to the strong converse capacity of a channel with long-term memory which can be shown to violate the strong converse property. Finally, we show bounds on the strong converse rate of hypothesis testing in the one-shot scenario, again in terms of the smoothed max-relative entropies.
The one-shot classical capacity of a quantum channel quantifies the amount of classical information that can be transmitted through a single use of the channel such that the error probability is below a certain threshold. In this work, we show that this capacity is well approximated by a relative-entropy-type measure defined via hypothesis testing. Combined with a quantum version of Stein's lemma, our results give a conceptually simple proof of the well-known Holevo-Schumacher-Westmoreland theorem for the capacity of memoryless channels. More generally, we obtain tight capacity formulas for arbitrary (not necessarily memoryless) channels.
The hypothesis testing problem of two quantum states is treated. We show a new inequality between the error of the first kind and the second kind, which complements the result of Hiai and Petz to establish the quantum version of Stein's lemma. The inequality is also used to show a bound on the first kind error when the power exponent for the second kind error exceeds the quantum relative entropy, and the bound yields the strong converse in the quantum hypothesis testing. Finally, we discuss the relation between the bound and the power exponent derived by Han and Kobayashi in the classical hypothesis testing.
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.
The hypothesis testing problem of two quantum states is treated. We show a new inequality between the error of the first kind and the second kind, which complements the result of Hiai and Petz to establish the quantum version of Stein's lemma. The inequality is also used to show a bound on the first kind error when the power exponent for the second kind error exceeds the quantum relative entropy, and the bound yields the strong converse in the quantum hypothesis testing. Finally, we discuss the relation between the bound and the power exponent derived by Han and Kobayashi in the classical hypothesis testing.
With the recent development of quantum information theory, some attempts have been made to construct information theory beyond quantum theory. Here, we consider hypothesis-testing relative entropy and one-shot classical capacity, that is, the optimal rate of classical information transmitted by using a single channel under the constraint of a certain error probability, in general physical theories where states and measurements are operationally defined. Then we obtain the upper bound of the one-shot classical capacity by generalizing the method given by Wang and Renner [Phys. Rev. Lett. 108, 200501 (2012)]. Also, we derive the lower bound of the capacity by showing the existence of a good code that can transmit classical information with a certain error probability. Applying the above two bounds, we prove the asymptotic equivalence between classical capacity and hypothesis-testing relative entropy in any general physical theory.