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

Physical Review Letters

Lower Bound for Mutual Information of a Quantum Channel

Horia Scutaru

Published Jul 31, 1995• 8 citations
Publisher

Abstract

We obtain a lower bound for the mutual information of a quantum transmission channel, which is perfectly analogous with Holevo's upper bound. The Uhlmann inequality for relative entropies is used, in a reverted order, for a completely positive mapping related with the mixed coherent states introduced by us seventeen years ago. Possible applications to quantum cryptography are discussed.

DOI
10.1103/physrevlett.75.773

Related papers

Generalized relative entropies and the capacity of classical-quantum channels

Milán Mosonyi, Nilanjana Datta

We provide lower and upper bounds on the information transmission capacity of one single use of a classical-quantum channel. The lower bound is expressed in terms of the Hoeffding capacity, which we define similarly to the Holevo capacity but replacing the relative entropy with the Hoeffding distance. Similarly, our upper bound is in terms of a quantity obtained by replacing the relative entropy with the recently introduced max-relative entropy in the definition of the divergence radius of a channel.

arXiv:0810.3478•Journal of Mathematical Physics•Jul 1, 2009•68 citations

Rényi–Holevo inequality from α-z-Rényi relative entropies

Diego G. Bussandri, Grzegorz Rajchel-Mieldzioć, Pedro W. Lamberti +1 more

We investigate bounds in the transmission of classical information through quantum systems. Our focus lies in the generalized Holevo theorem, which provides a single-letter Holevo-like inequality from arbitrary quantum distance measures. Through the introduction of the α-z -Rényi relative entropies, which comprise known relevant quantities such as the Rényi relative entropy and the sandwiched Rényi relative entropy, we establish the Holevo–Rényi inequality. This result leads to a quantum bound for the α -mutual information, suggesting new insights into communication channel performance and the fundamental limits for reliability functions in memoryless multi-letter communication channels.

WORLD SCIENTIFIC eBooks•Aug 1, 2025•0 citations

Quantum measurements and entropic bounds

Alberto Barchielli, G. Lupieri

While a positive operator valued measure gives the probabilities in a quantum measurement, an instrument gives both the probabilities and the a posteriori states. By interpreting the instrument as a quantum channel and by using the monotonicity theorem for relative entropies many bounds on the classical information extracted in a quantum measurement are obtained in a unified manner. In particular, it is shown that such bounds can all be stated as inequalities between mutual entropies. This approach based on channels gives rise to a unified picture of known and new bounds on the classical information (the bounds by Holevo, by Shumacher, Westmoreland and Wootters, by Hall, by Scutaru, a new upper bound and a new lower one). Some examples clarify the mutual relationships among the various bounds.

arXiv:quant-ph/0505090•Quantum Information and Computation•Jan 1, 2006•12 citations

Quantum signal propagation in depolarizing channels

Nicholas J. Pippenger

Let X be an unbiased random bit, let Y be a qubit. whose mixed state depends on X, and let the qubit Z be the result of passing Y through a depolarizing channel, which replaces Y with a completely random qubit with probability p. We measure the quantum mutual information between X and Y by T(X; Y)=S(X)+S(Y)-S(X, Y), where S(...) denotes von Neumann's (1948) entropy. (Since X is a classical bit, the quantity T(X; Y) agrees with Holevo's (1973) bound /spl chi/(X; Y) to the classical mutual information between X and the outcome of any measurement of Y.) We show that T(X; Z) /spl les/ (1-p)/sup 2/T(X; Y). This generalizes an analogous bound for classical mutual information due to Evans and Schulman (1993), and provides a new proof of their result.

IEEE Transactions on Information Theory•Jan 1, 2002•0 citations

ON QUANTUM MUTUAL TYPE ENTROPIES AND QUANTUM CAPACITY

Noboru Watanabe

The mutual entropy (information) denotes an amount of information transmitted correctly from the input system to the output system through a channel. The (semi-classical) mutual entropies for classical input and quantum output were defined by several researchers. The fully quantum mutual entropy, which is called Ohya mutual entropy, for quantum input and output by using the relative entropy was defined by Ohya in 1983, and he extended it to general quantum systems by means of the relative entropy of Araki and Uhlmann. The capacity shows the ability of the information transmission of the channel, which is used as a measure for construction of channels. The fully quantum capacity is formulated by taking the supremum of Ohya mutual entropy with respect to a certain subset of the initial state space. One of the most important theorems in quantum communication theory is coding theorem. The quantum coding theorems are discussed by using the mutual entropy - type measures introduced in the studies of quantum information. In this paper, we compare with these mutual entropy-type measures in order to obtain most suitable one for discussing the information transmission for quantum communication processes.

Stochastic Analysis: Classical and Quantum•Oct 1, 2005•0 citations

Rényi–Holevo inequality from α-z-Rényi relative entropies

Diego G. Bussandri, Grzegorz Rajchel-Mieldzioć, Pedro W. Lamberti +1 more

We investigate bounds in the transmission of classical information through quantum systems. Our focus lies in the generalized Holevo theorem, which provides a single-letter Holevo-like inequality from arbitrary quantum distance measures. Through the introduction of the [Formula: see text]-[Formula: see text]-Rényi relative entropies, which comprise known relevant quantities such as the Rényi relative entropy and the sandwiched Rényi relative entropy, we establish the Holevo–Rényi inequality. This result leads to a quantum bound for the [Formula: see text]-mutual information, suggesting new insights into communication channel performance and the fundamental limits for reliability functions in memoryless multi-letter communication channels.

arXiv:2309.04539•International Journal of Quantum Information•Apr 30, 2024•2 citations
We obtain a lower bound for the mutual information of a quantum transmission channel, which is perfectly analogous with Holevo's upper bound. The Uhlmann inequality for relative entropies is used, in a reverted order, for a completely positive mapping related with the mixed coherent states introduced by us seventeen years ago. Possible applications to quantum cryptography are discussed.
We provide lower and upper bounds on the information transmission capacity of one single use of a classical-quantum channel. The lower bound is expressed in terms of the Hoeffding capacity, which we define similarly to the Holevo capacity but replacing the relative entropy with the Hoeffding distance. Similarly, our upper bound is in terms of a quantity obtained by replacing the relative entropy with the recently introduced max-relative entropy in the definition of the divergence radius of a channel.
We investigate bounds in the transmission of classical information through quantum systems. Our focus lies in the generalized Holevo theorem, which provides a single-letter Holevo-like inequality from arbitrary quantum distance measures. Through the introduction of the α-z -Rényi relative entropies, which comprise known relevant quantities such as the Rényi relative entropy and the sandwiched Rényi relative entropy, we establish the Holevo–Rényi inequality. This result leads to a quantum bound for the α -mutual information, suggesting new insights into communication channel performance and the fundamental limits for reliability functions in memoryless multi-letter communication channels.
While a positive operator valued measure gives the probabilities in a quantum measurement, an instrument gives both the probabilities and the a posteriori states. By interpreting the instrument as a quantum channel and by using the monotonicity theorem for relative entropies many bounds on the classical information extracted in a quantum measurement are obtained in a unified manner. In particular, it is shown that such bounds can all be stated as inequalities between mutual entropies. This approach based on channels gives rise to a unified picture of known and new bounds on the classical information (the bounds by Holevo, by Shumacher, Westmoreland and Wootters, by Hall, by Scutaru, a new upper bound and a new lower one). Some examples clarify the mutual relationships among the various bounds.
Let X be an unbiased random bit, let Y be a qubit. whose mixed state depends on X, and let the qubit Z be the result of passing Y through a depolarizing channel, which replaces Y with a completely random qubit with probability p. We measure the quantum mutual information between X and Y by T(X; Y)=S(X)+S(Y)-S(X, Y), where S(...) denotes von Neumann's (1948) entropy. (Since X is a classical bit, the quantity T(X; Y) agrees with Holevo's (1973) bound /spl chi/(X; Y) to the classical mutual information between X and the outcome of any measurement of Y.) We show that T(X; Z) /spl les/ (1-p)/sup 2/T(X; Y). This generalizes an analogous bound for classical mutual information due to Evans and Schulman (1993), and provides a new proof of their result.
The mutual entropy (information) denotes an amount of information transmitted correctly from the input system to the output system through a channel. The (semi-classical) mutual entropies for classical input and quantum output were defined by several researchers. The fully quantum mutual entropy, which is called Ohya mutual entropy, for quantum input and output by using the relative entropy was defined by Ohya in 1983, and he extended it to general quantum systems by means of the relative entropy of Araki and Uhlmann. The capacity shows the ability of the information transmission of the channel, which is used as a measure for construction of channels. The fully quantum capacity is formulated by taking the supremum of Ohya mutual entropy with respect to a certain subset of the initial state space. One of the most important theorems in quantum communication theory is coding theorem. The quantum coding theorems are discussed by using the mutual entropy - type measures introduced in the studies of quantum information. In this paper, we compare with these mutual entropy-type measures in order to obtain most suitable one for discussing the information transmission for quantum communication processes.
We investigate bounds in the transmission of classical information through quantum systems. Our focus lies in the generalized Holevo theorem, which provides a single-letter Holevo-like inequality from arbitrary quantum distance measures. Through the introduction of the [Formula: see text]-[Formula: see text]-Rényi relative entropies, which comprise known relevant quantities such as the Rényi relative entropy and the sandwiched Rényi relative entropy, we establish the Holevo–Rényi inequality. This result leads to a quantum bound for the [Formula: see text]-mutual information, suggesting new insights into communication channel performance and the fundamental limits for reliability functions in memoryless multi-letter communication channels.